709 search results - page 21 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
SIGMOD
2008
ACM
13 years 7 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
DASFAA
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...