Sciweavers

3678 search results - page 389 / 736
» Personalization of Queries in Database Systems
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
CINQ
2004
Springer
180views Database» more  CINQ 2004»
15 years 10 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
EDBT
2012
ACM
308views Database» more  EDBT 2012»
13 years 9 months ago
Transactional stream processing
Many stream processing applications require access to a multitude of streaming as well as stored data sources. Yet there is no clear semantics for correct continuous query executi...
Irina Botan, Peter M. Fischer, Donald Kossmann, Ne...
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
16 years 1 months ago
Restricted Queries over an Encrypted Index with Applications to Regulatory Compliance
Compliance storage is an increasingly important area for businesses faced with a myriad of new document retention regulations. Today, businesses have turned to Write-One Read Many ...
Nikita Borisov, Soumyadeb Mitra
SIGMOD
2010
ACM
199views Database» more  SIGMOD 2010»
15 years 4 months ago
Keyword search across databases and documents
Given the continuous growth of databases and the abundance of diverse files in modern IT environments, there is a pressing need to integrate keyword search on heterogeneous inform...
Carlos Garcia-Alvarado, Carlos Ordonez