Sciweavers

PODS
2010
ACM
206views Database» more  PODS 2010»
13 years 9 months ago
Cache-oblivious hashing
The hash table, especially its external memory version, is one of the most important index structures in large databases. Assuming a truly random hash function, it is known that i...
Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang
PODS
2010
ACM
306views Database» more  PODS 2010»
13 years 9 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
PODS
2010
ACM
167views Database» more  PODS 2010»
13 years 9 months ago
Transducing Markov sequences
Benny Kimelfeld, Christopher Ré
PODS
2010
ACM
187views Database» more  PODS 2010»
13 years 9 months ago
Incremental query evaluation in a ring of databases
This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a quer...
Christoph Koch
PODS
2010
ACM
213views Database» more  PODS 2010»
13 years 9 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
PODS
2010
ACM
242views Database» more  PODS 2010»
13 years 9 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
PODS
2010
ACM
170views Database» more  PODS 2010»
13 years 9 months ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...
PODS
2010
ACM
170views Database» more  PODS 2010»
13 years 9 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
PODS
2010
ACM
184views Database» more  PODS 2010»
13 years 9 months ago
Universally optimal privacy mechanisms for minimax agents
A scheme that publishes aggregate information about sensitive data must resolve the trade-off between utility to information consumers and privacy of the database participants. D...
Mangesh Gupte, Mukund Sundararajan
PODS
2010
ACM
205views Database» more  PODS 2010»
13 years 9 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu