A linear-time probabilistic counting algorithm for database applications
ACM Transactions on Database Systems (TODS)
Querying object-oriented databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Introduction to object-oriented databases
Introduction to object-oriented databases
Optimizing disjunctive queries with expensive predicates
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Query size estimation by adaptive sampling (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Towards estimation error guarantees for distinct values
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximating block accesses in database organizations
Communications of the ACM
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Dynamic maintenance of data distribution for selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
Index configuration in object-oriented databases
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal Histograms with Quality Guarantees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fast Incremental Maintenance of Approximate Histograms
VLDB '97 Proceedings of the 23rd 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
Fundamentals of Database Systems (5th Edition)
Fundamentals of Database Systems (5th Edition)
Separability An Approach to Physical Database Design
IEEE Transactions on Computers
An efficient storage model for the SBML documents using object databases
VDMB'06 Proceedings of the First international conference on Data Mining and Bioinformatics
Intelligent statistics management in sybase ASE 15.0
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Hi-index | 0.00 |
A search condition in object-oriented/object-relational queries consists of nested predicates, which are predicates on path expressions. In this paper, we propose a new technique for estimating selectivity for nested predicates. Selectivity of a nested predicate, nested selectivity, is defined as the ratio of the number of the qualified objects of the starting class in the path expression to the total number of objects of the class. The new technique takes into account the effects of direct representation of the many-to-many relationship and the partial participation of objects in the relationship. These two features occur frequently in object-oriented/object-relational databases, but have not been properly handled in the conventional selectivity estimation techniques. For the many-to-many relationship, we generalize the block-hit function proposed by S.B. Yao to allow the cases that an object belongs to more than one block. For the partial participation, we propose the concept of active objects and extend our technique for total participation to handle active objects. We also propose efficient methods for obtaining statistical information needed for our estimation technique. We finally analyze the accuracy of our technique through a series of experiments and compare with the conventional ones. The experiment results showed that there was a significant inaccuracy in the estimation by the conventional ones, confirming the advantage of our technique.