Sciweavers

5055 search results - page 625 / 1011
» Relative Timing
Sort
View
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 7 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 7 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
VLDB
2007
ACM
144views Database» more  VLDB 2007»
16 years 7 months ago
Cooperative Scans: Dynamic Bandwidth Sharing in a DBMS
This paper analyzes the performance of concurrent (index) scan operations in both record (NSM/PAX) and column (DSM) disk storage models and shows that existing scheduling policies...
Marcin Zukowski, Sándor Héman, Niels...
SIGMOD
2009
ACM
148views Database» more  SIGMOD 2009»
16 years 7 months ago
Combining keyword search and forms for ad hoc querying of databases
A common criticism of database systems is that they are hard to query for users uncomfortable with a formal query language. To address this problem, form-based interfaces and keyw...
Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 7 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...