PODS
2007
ACM
14 years 11 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
PODS
2006
ACM
14 years 11 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
PODS
2006
ACM
14 years 11 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
PODS
2006
ACM
14 years 11 months ago
2006
ACM
PODS
2006
ACM
14 years 11 months ago
2006
ACM
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
PODS
2006
ACM
14 years 11 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
PODS
2006
ACM
14 years 11 months ago
2006
ACM
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
PODS
2006
ACM
14 years 11 months ago
2006
ACM
PODS
2006
ACM
14 years 11 months ago
2006
ACM
A recently introduced information-theoretic approach to analyzing redundancies in database design was used to justify normal forms like BCNF that completely eliminate redundancies...
PODS
2006
ACM
14 years 11 months ago
2006
ACM
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...