ACM Transactions on Database Systems (TODS)
Estimating the cost of updates in a relational database
ACM Transactions on Database Systems (TODS)
Modeling the storage architectures of commercial database systems
ACM Transactions on Database Systems (TODS)
Data model issues for object-oriented applications
ACM Transactions on Information Systems (TOIS)
ACM Transactions on Database Systems (TODS)
Combining language and database advances in an object-oriented development environment
OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
An Automatic Physical Designer for Network Model Databases
IEEE Transactions on Software Engineering
A Physical Database Design Evaluation System for CODASYL Databases
IEEE Transactions on Software Engineering
The Gem–Stone data management system
Object-oriented concepts, databases, and applications
Indexing techniques for object-oriented databases
Object-oriented concepts, databases, and applications
Version control in an object-oriented architecture
Object-oriented concepts, databases, and applications
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A unified analysis of batched searching of sequential and tree-structured files
ACM Transactions on Database Systems (TODS)
Optimization of queries using nested indices
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Access support in object bases
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Indexing in an object-oriented DBMS
OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
An object server for an object-oriented database system
OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
Object-Oriented Database Systems: Concepts and Architectures
Object-Oriented Database Systems: Concepts and Architectures
Indexing Techniques for Queries on Nested Objects
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Object-Oriented Databases: Definition and Research Directions
IEEE Transactions on Knowledge and Data Engineering
Object-Oriented Query Languages: The Notion and the Issues
IEEE Transactions on Knowledge and Data Engineering
Queries in Object-Oriented Databases
Proceedings of the Fourth International Conference on Data Engineering
Implementation Techniques of Complex Objects
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Acyclic Query Processing in Object-Oriented Databases
Proceedings of the Seventh International Conference on Enity-Relationship Approach: A Bridge to the User
Estimating nested selectivity in object-oriented databases
Proceedings of the ninth international conference on Information and knowledge management
The Indispensability of Dispensable Indexes
IEEE Transactions on Knowledge and Data Engineering
Data Organization and Retrieval on Parallel Air Channels
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
Estimating nested selectivity in object-oriented and object-relational databases
Information and Software Technology
Optimizing query shortcuts in RDF databases
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Hi-index | 0.00 |
In relational databases, an attribute of a relation can have only a single primitive value, making it cumbersome to model complex objects. The object-oriented paradigm removes this difficulty by introducing the notion of nested objects, which allows the value of an object attribute to be another object or a set of other objects. This means that a class consists of a set of attributes, and the values of the attributes are objects that belong to other classes; that is, the definition of a class forms a hierarchy of classes. All attributes of the nested classes are nested attributes of the root of the hierarchy. A branch of such hierarchy is called a path. In this article, we address the problem of index configuration for a given path. We first summarize some basic concepts, and introduce the concept of index configuration for a path. Then we present cost formulas to evaluate the costs of the various configurations. Finally, we present the algorithm that determines the optimal configuration, and show its correctness.