Sciweavers

964 search results - page 32 / 193
» Efficiently Ordering Query Plans for Data Integration
Sort
View
CIKM
2008
Springer
15 years 6 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 4 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
ICDE
2005
IEEE
123views Database» more  ICDE 2005»
15 years 10 months ago
Load and Network Aware Query Routing for Information Integration
Current federated systems deploy cost-based query optimization mechanisms; i.e., the optimizer selects a global query plan with the lowest cost to execute. Thus, cost functions in...
Wen-Syan Li, Vishal S. Batra, Vijayshankar Raman, ...
TKDE
2010
274views more  TKDE 2010»
15 years 2 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
GEOINFO
2003
15 years 5 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...