POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Priority search trees in secondary memory (extended abstract)
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
A data structure for dynamic trees
Journal of Computer and System Sciences
Indexing techniques for object-oriented databases
Object-oriented concepts, databases, and applications
Object-oriented concepts, databases, and applications
Object-oriented concepts, databases, and applications
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Maintaining range trees in secondary memory. Part I: partitions
Acta Informatica
Maintaining range trees in secondary memory. Part II: lower bounds
Acta Informatica
Readings in object-oriented database systems
Readings in object-oriented database systems
Efficient memory access in large-scale computation (invited paper)
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
H-trees: a dynamic associative search index for OODB
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Indexing in an object-oriented DBMS
OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finitely representable databases (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database querying and constraint programming
ACM SIGACT News
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Separability of polyhedra for optimal filtering of spatial and constraint data
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
OODB indexing by class-division
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
Towards practical constraint databases (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient 3-D range searching in external memory
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in constraint programming
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Constraint databases: promising technology or just intellectual exercise?
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
I/O optimal isosurface extraction (extended abstract)
VIS '97 Proceedings of the 8th conference on Visualization '97
A lower bound theorem for indexing schemes and its application to multidimensional range queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tight bounds for 2-dimensional indexing schemes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Indexing schemes for random points
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Constraint Programming: Strategic Directions
Constraints
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data
Journal of Automated Reasoning
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
The Data Warehouse of Newsgroups
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Managing Intervals Efficiently in Object-Relational Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Toward Practical Constraint Databases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Approximation Techniques for Indexing Two-Dimensional Constraint Databases
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A configurable type hierarchy index for OODB
The VLDB Journal — The International Journal on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently processing queries on interval-and-value tuples in relational databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Scalable isosurface visualization of massive datasets on commodity off-the-shelf clusters
Journal of Parallel and Distributed Computing
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Hi-index | 0.00 |
We examine I/O-efficient data structures that provide indexing support for new data models. The database languages of these models include concepts from constraint programming (e.g., relational tuples are generalized to conjunctions of constraints) and from object-oriented programming (e.g., objects are organized in class hierarchies). Let n be the size of the database, c the number of classes, B the secondary storage page size, and t the size of the output of a query. Indexing by one attribute in the constraint data model (for a fairly general type of constraints) is equivalent to external dynamic interval management, which is a special case of external dynamic 2-dimensional range searching. We present a semi-dynamic data structure for this problem which has optimal worst-case space O(n/B) pages and optimal query I/O time O(logBn+t/B) and has O(logBn+(log2Bn)/B) amortized insert I/O time. If the order of the insertions is random then the expected number of I/O operations needed to perform insertions is reduced to O(logBn). Indexing by one attribute and by class name in an object-oriented model, where objects are organized as a forest hierarchy of classes, is also a special case of external dynamic 2-dimensional range searching. Based on this observation we first identify a simple algorithm with good worst-case performance for the class indexing problem. Using the forest structure of the class hierarchy and techniques from the constraint indexing problem, we improve its query I/O time from O(log2c logBn + t/B) to O(logB + log2B).