627 search results - page 20 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
DASFAA
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
ICSNC
2007
IEEE
15 years 3 months ago
2007
IEEE
RFID data are usually regarded as streaming data that are huge and change frequently because they are gathered continuously by numerous readers. RFID middleware filters the data a...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
165
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
115
click to vote
PVLDB
2008
14 years 8 months ago
2008
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...