Sciweavers

792 search results - page 87 / 159
» Computing Iceberg Queries Efficiently
Sort
View
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
14 years 10 months ago
Continuous monitoring of top-k queries over sliding windows
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...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
ICDE
2009
IEEE
147views Database» more  ICDE 2009»
14 years 12 months ago
Separating Authentication from Query Execution in Outsourced Databases
-- 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...
Stavros Papadopoulos, Dimitris Papadias, Weiwei Ch...
VLDB
2007
ACM
182views Database» more  VLDB 2007»
14 years 4 months ago
Continuous Queries in Oracle
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...
Sankar Subramanian, Srikanth Bellamkonda, Hua-Gang...
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 10 months ago
Succinct Geometric Indexes Supporting Point Location Queries
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...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...
WWW
2008
ACM
13 years 10 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
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...
Wilfred Ng, Ho Lam Lau, Aoying Zhou