312 search results - page 18 / 63 » Indexing Gapped-Factors Using a Tree |
PKDD
2000
Springer
15 years 3 months ago
2000
Springer
: Relational representation of objects using graphs reveals much information that cannot be obtained by attribute value representations alone. There are already many databases that...
127
click to vote
ADC
2000
Springer
15 years 4 months ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
137
click to vote
DASFAA
2004
IEEE
15 years 3 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
119
click to vote
EUROPAR
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...