PODS 2002 - PDF Preprint Papers

PODS 2002 Symposium on Principles of Database Systems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODS-2002 Paper

click to vote

PODS
2002
ACM

168views Database» more PODS 2002»

Conjunctive Selection Conditions in Main Memory

14 years 11 months ago

Download www.cs.columbia.edu

We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...

Kenneth A. Ross

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	168	Conjunctive Selection Conditions in Main Memory	claim
2	167	OLAP Dimension Constraints	claim
3	164	Characterizing Memory Requirements for Queries over Continuous Data Streams	claim
4	154	How to Evaluate Multiple Range-Sum Queries Progressively	claim
5	138	Fast Algorithms For Hierarchical Range Histogram Construction	claim
6	136	Models and Issues in Data Stream Systems	claim
7	133	Data Integration: A Theoretical Perspective	claim
8	132	Distributed Computation of Web Queries Using Automata	claim
9	130	Algorithmics and Applications of Tree and Graph Searching	claim
10	125	Answering Queries Using Views with Arithmetic Comparisons	claim
11	117	Monadic Datalog and the Expressive Power of Languages for Web Information Extraction	claim
12	112	From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries	claim
13	111	Labeling Dynamic XML Trees	claim
14	110	On Moving Object Queries	claim
15	106	A Normal Form for XML Documents	claim
16	98	On Propagation of Deletions and Annotations Through Views	claim
17	98	Containment and Equivalence for an XPath Fragment	claim
18	95	On Verifying Consistency of XML Specifications	claim
19	89	Lossless Regular Views	claim
20	89	On the Computation of Relational View Complements	claim
21	89	Efficient Aggregation over Objects with Extent	claim
22	88	Knowledge Compilation = Query Rewriting + View Synthesis	claim
23	78	Least Expected Cost Query Optimization: What Can We Expect?	claim
24	70	The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers