Sciweavers

315 search results - page 48 / 63
» An Overview of Query Optimization in Relational Systems
Sort
View
PODS
2010
ACM
207views Database» more  PODS 2010»
14 years 17 days ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
CIKM
2011
Springer
12 years 7 months ago
Estimating selectivity for joined RDF triple patterns
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
Hai Huang 0003, Chengfei Liu
DASFAA
2006
IEEE
111views Database» more  DASFAA 2006»
14 years 1 months ago
Holistic Schema Mappings for XML-on-RDBMS
When hosting XML information on relational backends, a mapping has to be established between the schemas of the information source and the target storage repositories. A rich body ...
Priti Patil, Jayant R. Haritsa
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
14 years 7 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 22 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen