709 search results - page 100 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
285
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
125
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
170
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
302
click to vote
DAWAK
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
154
click to vote
TIME
1997
IEEE
15 years 10 months ago
1997
IEEE
Temporal databases provide built-in supports for efficient recording and querying of time-evolving data. In this paper, data clustering issues in temporal database environment are...