Sciweavers

1821 search results - page 289 / 365
» U-DBMS: A Database System for Managing Constantly-Evolving D...
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 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
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
14 years 7 months ago
EaseDB: a cache-oblivious in-memory query processor
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang
SIGMOD
2007
ACM
172views Database» more  SIGMOD 2007»
14 years 7 months ago
Auditing disclosure by relevance ranking
Numerous widely publicized cases of theft and misuse of private information underscore the need for audit technology to identify the sources of unauthorized disclosure. We present...
Rakesh Agrawal, Alexandre V. Evfimievski, Jerry Ki...
PODS
2010
ACM
207views Database» more  PODS 2010»
14 years 23 days ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
CIKM
2008
Springer
13 years 9 months ago
Transaction reordering with application to synchronized scans
Traditional workload management methods mainly focus on the current system status while information about the interaction between queued and running transactions is largely ignore...
Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Mi...