1388 search results - page 239 / 278 » Querying Linguistic Trees |
166
click to vote
SIGMOD
2005
ACM
16 years 18 days ago
2005
ACM
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
100
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...
EDBT
2006
ACM
16 years 18 days ago
2006
ACM
Abstract. Modern document collections often contain groups of documents with overlapping or shared content. However, most information retrieval systems process each document separa...
114
click to vote
EDBT
2006
ACM
16 years 18 days ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
109
Voted
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we study the problem of indexing multidimensional data in the P2P networks based on distributed hash tables (DHTs). We identify several design issues and propose a ...