Abstract

The author identifies inference aggregation and cardinality aggregation as two distinct aspects of the aggregation problem. He develops the concept of a semantic relationship graph to describe the relationships between data and then presents inference aggregation as the problem of finding alternative paths between vertices on the graph. He presents an algorithm for processing the semantic relationship graph to discover whether potential inference aggregation problems exist. A method of detecting some aggregation conditions within the database management system (DBMS) is presented that uses the normal DBMS query language and adds additional catalytic data to the DBMS to permit a query to make the inference. The author also suggests the use of set theory to describe aggregation conditions and the addition of set operations to the DBMS to permit the description of aggregation detection queries.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Computer scienceInferenceCardinality (data modeling)GraphInformation retrievalDeductive databaseSet (abstract data type)Graph databaseOnline aggregationTheoretical computer scienceData miningDatabase queryDatabaseArtificial intelligenceSearch engineWeb search queryProgramming languageWeb query classification

Related Publications

Self-organising multilayer topographic mappings

Minimization of distortion measures requires multilayer mappings to be topographic. The author shows this only for tree-like multilayer networks. He also shows how to modify the...

1988 IEEE International Conference on Neur... 14 citations

Publication Info

Year
2003
Type
article
Pages
96-106
Citations
110
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

110
OpenAlex

Cite This

Thomas H. Hinke (2003). Inference aggregation detection in database management systems. , 96-106. https://doi.org/10.1109/secpri.1988.8101

Identifiers

DOI
10.1109/secpri.1988.8101