Sciweavers

2889 search results - page 498 / 578
» Querying Structured Hyperdocuments
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 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
ICALP
2009
Springer
14 years 8 months ago
Testing Fourier Dimensionality and Sparsity
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...
VLDB
2001
ACM
119views Database» more  VLDB 2001»
14 years 8 months ago
PicoDBMS: Scaling down database techniques for the smartcard
Smartcards are the most secure portable computing device today. They have been used successfully in applications involving money, proprietary and personal data (such as banking, h...
Philippe Pucheral, Luc Bouganim, Patrick Valduriez...
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 8 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
VLDB
2004
ACM
144views Database» more  VLDB 2004»
14 years 8 months ago
Preserving mapping consistency under schema changes
Abstract. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities.When a mapping is ...
Yannis Velegrakis, Renée J. Miller, Lucian Popa