Sciweavers

11991 search results - page 2006 / 2399
» Data Structure Fusion
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 8 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
OSDI
2004
ACM
16 years 8 months ago
Boxwood: Abstractions as the Foundation for Storage Infrastructure
Abstractions as the Foundation for Storage Infrastructure John MacCormick, Nick Murphy, Marc Najork, Chandramohan A. Thekkath, and Lidong Zhou Microsoft Research Silicon Valley Wr...
John MacCormick, Nick Murphy, Marc Najork, Chandra...
VLDB
2007
ACM
161views Database» more  VLDB 2007»
16 years 8 months ago
Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
Feifei Li, Ke Yi, Marios Hadjieleftheriou, George ...
VLDB
2008
ACM
196views Database» more  VLDB 2008»
16 years 8 months ago
Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes
This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...
Thomas Rölleke, Hengzhi Wu, Jun Wang, Hany Azzam
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
16 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
« Prev « First page 2006 / 2399 Last » Next »