2001 search results - page 79 / 401 » Indexing in a Hypertext Database |
CIDR
2003
13 years 10 months ago
2003
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
ICDE
2002
IEEE
14 years 10 months ago
2002
IEEE
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...