2539 search results - page 311 / 508 » Updates for Structure Indexes |
218
click to vote
ACSC
2000
IEEE
15 years 11 months ago
2000
IEEE
Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for...
167
click to vote
CIKM
2000
Springer
15 years 11 months ago
2000
Springer
The complexity of deploying high-performance spatial structures in transactional DBMS environments has motivated researchers to experiment with the idea of reusing the effort inve...
210
click to vote
PODS
1998
ACM
15 years 10 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
184
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
221
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...