277 search results - page 26 / 56 » Opportunistic Data Structures for Range Queries |
SIGMOD
1998
ACM
15 years 2 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
179
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
161
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
SSDBM
1999
IEEE
15 years 2 months ago
1999
IEEE
Conducting bioinformatic analyses involves biologists in expressing requests over a range of highly heterogeneous information sources and software tools. Such activities are labor...