Recursive Queries in Product Databases

Authors:
J. H. ter Bekke;J. A. Bakker
Affiliations:
-;-
Venue:
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Year:
2002

Citing 7
Cited 0

Semantic data modeling

Semantic data modeling
On the expressive power of query languages

ACM Transactions on Information Systems (TOIS)
Any algorithm in the complex object algebra with powerset needs exponential space to compute transitive closure

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The essence of databases

The essence of databases
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Can We Rely on SQL?

DEXA '97 Proceedings of the 8th International Workshop on Database and Expert Systems Applications
Database Processing: Fundamentals, Design and Implementation

Database Processing: Fundamentals, Design and Implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The relational data model does not offer query language solutions for recursive applications. A missing semantic update operation is the fundamental reason for this failure. It is shown that a semantic data model can solve these applications using simple linear constructs for definition and manipulation, without explicit recursion, nesting, iteration or navigation. The new implementation technique is reliable and efficient for application in end user environments. It is based on semantic query specification and metadata processing. Experiments with the semantic Xplain DBMS have confirmed the linear time complexity for product database applications.