PODS 2003 - PDF Preprint Papers

PODS 2003 Symposium on Principles of Database Systems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODS-2003 Paper

click to vote

PODS
2003
ACM

158views Database» more PODS 2003»

Computing full disjunctions

15 years 26 days ago

Download www.vldb.org

Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...

Yaron Kanza, Yehoshua Sagiv

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	158	Computing full disjunctions	claim
2	157	Algorithms for data migration with cloning	claim
3	156	Limiting privacy breaches in privacy preserving data mining	claim
4	151	Feasible itemset distributions in data mining: theory and application	claim
5	148	On the decidability and complexity of query answering over inconsistent and incomplete databases	claim
6	143	Maintaining variance and k-medians over data stream windows	claim
7	142	Query containment and rewriting using views for regular path queries under constraints	claim
8	135	Query-preserving watermarking of relational databases and XML documents	claim
9	132	The view selection problem for XML content based routing	claim
10	119	On producing join results early	claim
11	118	Numerical document queries	claim
12	116	On nearest neighbor indexing of nonlinear trajectories	claim
13	116	Revealing information while preserving privacy	claim
14	116	The complexity of XPath query evaluation	claim
15	114	An information-theoretic approach to normal forms for relational and XML data	claim
16	114	Soft stratification for magic set based query evaluation in deductive databases	claim
17	113	Materializing views with minimal size to answer queries	claim
18	112	Concise descriptions of subsets of structured sets	claim
19	111	Correlating XML data streams using tree-edit distance embeddings	claim
20	107	E-services: a look behind the curtain	claim
21	104	Maintaining time-decaying stream aggregates	claim
22	100	Data exchange: getting to the core	claim
23	98	View-based query containment	claim
24	85	What's hot and what's not: tracking most frequent items dynamically	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers