958 search results - page 43 / 192 » Efficient data structures for range-aggregate queries on tre... |
209
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
114
Voted
ICWS
2009
IEEE
14 years 10 months ago
2009
IEEE
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries...
109
Voted
ADC
2000
Springer
15 years 4 months ago
2000
Springer
Answering range queries is a common database operation. Methods based on hashing techniques to minimise the cost of answering range queries by taking the query distribution into a...
115
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The ever-increasing amount of data in biomedical research, and in cancer research in particular, needs to be managed to support efficient data access, exchange and integration. Exi...
101
Voted
PODS
2006
ACM
16 years 18 days ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...