627 search results - page 66 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
190
click to vote
TPDS
2010
15 years 4 months ago
2010
—One of the major applications of wireless ad hoc networks is to extend the Internet coverage and support pervasive and efficient data dissemination and sharing. To reduce data a...
263
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
176
click to vote
VLDB
1989
ACM
15 years 10 months ago
1989
ACM
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
218
click to vote
SSDBM
2002
IEEE
15 years 11 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
252
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...