Sciweavers

9477 search results - page 1796 / 1896
» Design is as Easy as Optimization
Sort
View
OSDI
2006
ACM
16 years 6 months ago
HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas t...
James A. Cowling, Daniel S. Myers, Barbara Liskov,...
VLDB
2002
ACM
141views Database» more  VLDB 2002»
16 years 6 months ago
Data page layouts for relational databases on deep memory hierarchies
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill
VLDB
2005
ACM
149views Database» more  VLDB 2005»
16 years 6 months ago
Selectivity estimators for multidimensional range queries over real attributes
Estimating the selectivity of multidimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. In this p...
Dimitrios Gunopulos, George Kollios, Vassilis J. T...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 6 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 6 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
« Prev « First page 1796 / 1896 Last » Next »