Sciweavers

508 search results - page 31 / 102
» Bringing Order to Query Optimization
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
14 years 9 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 9 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
SIGMOD
2004
ACM
122views Database» more  SIGMOD 2004»
14 years 7 months ago
Adapting to Source Properties in Processing Data Integration Queries
An effective query optimizer finds a query plan that exploits the characteristics of the source data. In data integration, little is known in advance about sources' propertie...
Zachary G. Ives, Alon Y. Halevy, Daniel S. Weld
ODBIS
2007
Springer
150views Database» more  ODBIS 2007»
14 years 1 months ago
An Effective SPARQL Support over Relational Databases
Supporting SPARQL queries over relational databases becomes an active topic recently. However, it has not received enough consideration when SPARQL queries include restrictions on...
Jing Lu, Feng Cao, Li Ma, Yong Yu, Yue Pan