Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A data model and query language for EXODUS
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A query language for the O2 object-oriented databases
Proceedings of the second international workshop on Database programming languages
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Document processing in a relational database system
ACM Transactions on Information Systems (TOIS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Performance comparison of index structures for multi-key retrieval
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Object and File Management in the EXODUS Extensible Database System
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Supporting Lists in a Data Model (A Timely Approach)
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Ordered Types in the AQUA Data Model
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
| Hi-index | 0.00 |
The high frequency of applications involving large, ordered, nested lists suggests that list is the "next most" natural data type after set. A list differs from a set through positioning and nesting elements within the list. Directly supporting such position-related operations will greatly improve the performance of database systems targeting at the above applications. Unlike other attributes, the position will be changed by insertion and deletion within a list and known methods are not appropriate for indexing the position. We present an indexing structure, called the P-tree (where P for position), to index a set of lists. The P-tree generalizes the B-tree by dealing with a set of lists rather than a set of records, while preserving all the properties of the B-tree.