The relational model with relation-valued attributes
Information Systems
Non first normal form relations: An algebra allowing data restructuring
Journal of Computer and System Sciences
Sets and negation in a logic data base language (LDL1)
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extended algebra and calculus for nested relational databases
ACM Transactions on Database Systems (TODS)
Optimization of object-retrieval queries
Lecture notes in computer science on Advances in object-oriented database systems
Journal of Computer and System Sciences
VERSO: a database machine based on nested relations
Nested relations and complex objects in databases
A recursive algebra for nested relations
Information Systems
A rule-based language with functions and sets
ACM Transactions on Database Systems (TODS)
Converting nested algebra expressions into flat algebra expressions
ACM Transactions on Database Systems (TODS)
Querying object-oriented databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Tractable query languages for complex object databases
Journal of Computer and System Sciences
The object database standard: ODMG 2.0
The object database standard: ODMG 2.0
On the expressive power of logic programming languages with sets
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Object-Relational DBMSs: Tracking the Next Great Wave
Object-Relational DBMSs: Tracking the Next Great Wave
A new approach to database logic
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
ICDT '90 Proceedings of the Third International Conference on Database Theory
XML Data and Object Databases: A Perfect Couple?
Proceedings of the 17th International Conference on Data Engineering
Theoretical Foundation of Algebraic Optimization Utilizing Unnormalized Relations
ICDT '86 Proceedings of the International Conference on Database Theory
An Efficient Join for Nested Relational Databases
DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
An automatic load/extract scheme for XML documents through object-relational repositories
Journal of Systems and Software
Relational computation for mining association rules from XML data
Proceedings of the 14th ACM international conference on Information and knowledge management
SQL query optimization through nested relational algebra
ACM Transactions on Database Systems (TODS)
Safety, domain independence and translation of complex value database queries
Information Sciences: an International Journal
A Logic-Based Approach to Mining Inductive Databases
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Equivalence of nested queries with mixed semantics
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Logic-Based association rule mining in XML documents
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Towards an algebraic framework for querying inductive databases
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Hi-index | 0.00 |
Algebraic optimisation is both theoretically and practically important for query processing in complex value databases. In this paper, we consider this issue and investigate some algebraic properties concerning the nested relational operators.The join operation is one of the most time-consuming operations in nested relational query processing. We introduce a new join operator, called P-join, which combines the advantages of Roth's extended natural join and Colby's recursive join for efficient data access. We also investigate some algebraic properties concerning the P-join operator and extended relational operators, which can be used for query optimisation in nested relational databases.We then examine the role of the restructuring operators nest and unnest in their interactions with the extended relational operators proposed by Roth et al. Under certain functional and mutual data dependencies, the six nested relational equations will hold.Finally, we outline the steps of a heuristic optimisation algorithm that utilises algebraic transformation rules developed in this paper and previous related work to transform an initial query to an optimised one that is more efficient to execute.