PODS 2008 - PDF Preprint Papers

PODS 2008 Symposium on Principles of Database Systems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODS-2008 Paper

click to vote

PODS
2008
ACM

250views Database» more PODS 2008»

Approximating predicates and expressive queries on probabilistic databases

15 years 17 days ago

Download www.cs.cornell.edu

We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...

Christoph Koch

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	250	Approximating predicates and expressive queries on probabilistic databases	claim
2	221	A generic flow algorithm for shared filter ordering problems	claim
3	211	The power of two min-hashes for similarity search among hierarchical data objects	claim
4	204	Annotated XML: queries and provenance	claim
5	178	The chase revisited	claim
6	174	Epistemic privacy	claim
7	170	Answering aggregate queries in data exchange	claim
8	165	Data exchange and schema mappings in open and closed worlds	claim
9	159	Approximation algorithms for clustering uncertain data	claim
10	158	Local Hoare reasoning about DOM	claim
11	155	The recovery of a schema mapping: bringing exchanged data back	claim
12	153	Approximation algorithms for co-clustering	claim
13	152	Towards a theory of schema-mapping optimization	claim
14	143	XPath, transitive closure logic, and nested tree walking automata	claim
15	141	On the complexity of deriving schema mappings from database instances	claim
16	129	Tree-width and functional dependencies in databases	claim
17	128	Shape sensitive geometric monitoring	claim
18	123	Evaluating rank joins with optimal cost	claim
19	120	Query evaluation with soft-key constraints	claim
20	120	Effective characterizations of tree logics	claim
21	114	Estimating PageRank on graph streams	claim
22	113	On searching compressed string collections cache-obliviously	claim
23	110	Static analysis of active XML systems	claim
24	109	Time-decaying aggregates in out-of-order streams	claim
25	108	Complexity and composition of synthesized web services	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers