785 search results - page 113 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
256
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
247
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and applicatio...
386
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
276
Voted
ICDE
1998
IEEE
16 years 7 months ago
1998
IEEE
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
187
click to vote
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we propose the Hybrid-Layer Index (simply, the HL-index) that is designed to answer top-k queries efficiently when the queries are expressed on any arbitrary subset ...