PODS 2009 - PDF Preprint Papers

PODS 2009 Symposium on Principles of Database Systems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODS-2009 Paper

111

click to vote

PODS
2009
ACM

229views Database» more PODS 2009»

Computing all skyline probabilities for uncertain data

15 years 29 days ago

Download www.cs.purdue.edu

Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...

Mikhail J. Atallah, Yinian Qi

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	229	Computing all skyline probabilities for uncertain data	claim
2	185	Consensus answers for queries over probabilistic databases	claim
3	171	XML schema mappings	claim
4	170	A general datalog-based framework for tractable query answering over ontologies	claim
5	136	Distributed XML design	claim
6	134	An efficient rigorous approach for identifying statistically significant frequent itemsets	claim
7	134	Equivalence of nested queries with mixed semantics	claim
8	134	Relationship privacy: output perturbation for queries with joins	claim
9	130	The finite model theory toolbox of a database theoretician	claim
10	130	Secondary indexing in one dimension: beyond b-trees and bitmap indexes	claim
11	124	Indexing uncertain data	claim
12	122	Satisfiability of downward XPath with data equality tests	claim
13	119	Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes	claim
14	119	Exceeding expectations and clustering uncertain data	claim
15	118	Size and treewidth bounds for conjunctive queries	claim
16	113	Relative information completeness	claim
17	112	Optimal sampling from sliding windows	claim
18	110	Optimal tracking of distributed heavy hitters and quantiles	claim
19	101	XML with incomplete information: models, properties, and query answering	claim
20	100	Space-optimal heavy hitters with strong error bounds	claim
21	98	XPath evaluation in linear time with polynomial combined complexity	claim
22	92	Similarity caching	claim
23	91	A web of concepts	claim
24	86	Reverse data exchange: coping with nulls	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers