2121 search results - page 82 / 425 » Indexing Incomplete Databases |
114
click to vote
CIDR
2003
15 years 3 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...
156
Voted
EDBT
2012
ACM
13 years 4 months ago
2012
ACM
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
103
click to vote
KDD
2004
ACM
16 years 2 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...
211
click to vote
SIGMOD
2007
ACM
16 years 2 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...
247
click to vote
ICDE
2007
IEEE
16 years 3 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...