Sciweavers

83 search results - page 8 / 17
» Factorizing Complex Predicates in Queries to Exploit Indexes
Sort
View
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
ICDT
2003
ACM
91views Database» more  ICDT 2003»
14 years 28 days ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
ICDE
2006
IEEE
152views Database» more  ICDE 2006»
14 years 9 months ago
A Complete and Efficient Algebraic Compiler for XQuery
As XQuery nears standardization, more sophisticated XQuery applications are emerging, which often exploit the entire language and are applied to non-trivial XML sources. We propos...
Christopher Re, Jérôme Siméon,...
SEBD
1996
94views Database» more  SEBD 1996»
13 years 9 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
SIGIR
2009
ACM
14 years 2 months ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel