Sciweavers

PODS
2008
ACM
152views Database» more  PODS 2008»
15 years 17 days ago
Towards a theory of schema-mapping optimization
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...
PODS
2008
ACM
120views Database» more  PODS 2008»
15 years 17 days ago
Effective characterizations of tree logics
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
Mikolaj Bojanzyk
PODS
2008
ACM
109views Database» more  PODS 2008»
15 years 17 days ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
PODS
2008
ACM
204views Database» more  PODS 2008»
15 years 17 days ago
Annotated XML: queries and provenance
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...
J. Nathan Foster, Todd J. Green, Val Tannen
PODS
2008
ACM
174views Database» more  PODS 2008»
15 years 17 days ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
PODS
2008
ACM
128views Database» more  PODS 2008»
15 years 17 days ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
PODS
2008
ACM
141views Database» more  PODS 2008»
15 years 17 days ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
PODS
2008
ACM
153views Database» more  PODS 2008»
15 years 17 days ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
PODS
2008
ACM
120views Database» more  PODS 2008»
15 years 17 days ago
Query evaluation with soft-key constraints
Abhay Jha, Vibhor Rastogi, Dan Suciu
PODS
2008
ACM
143views Database» more  PODS 2008»
15 years 17 days ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin