Sciweavers

418 search results - page 38 / 84
» Optimizing Large Join Queries in Mediation Systems
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 8 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
ICDE
2001
IEEE
146views Database» more  ICDE 2001»
14 years 9 months ago
The Skyline Operator
We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is intere...
Stephan Börzsönyi, Donald Kossmann, Konr...
DASFAA
2005
IEEE
256views Database» more  DASFAA 2005»
14 years 1 months ago
CoCache: Query Processing Based on Collaborative Caching in P2P Systems
Peer-to-peer (P2P) computing is gaining more and more significance due to its widespread use currently and potential deployments in future applications. In this paper, we propose ...
Weining Qian, Linhao Xu, Shuigeng Zhou, Aoying Zho...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 months ago
Statistical Learning Techniques for Costing XML Queries
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
14 years 7 months ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos