792 search results - page 87 / 159 » Computing Iceberg Queries Efficiently |
336
Voted
SIGMOD
2006
ACM
16 years 2 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...
242
Voted
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
-- In the database outsourcing paradigm, a data owner (DO) delegates its DBMS administration to a specialized service provider (SP) that receives and processes queries from clients...
138
Voted
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...
101
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
144
Voted
WWW
2008
ACM
15 years 2 months ago
2008
ACM
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...