Sciweavers

508 search results - page 6 / 102
» Bringing Order to Query Optimization
Sort
View
SIGMOD
1992
ACM
160views Database» more  SIGMOD 1992»
15 years 1 months ago
Extensible/Rule Based Query Rewrite Optimization in Starburst
This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starb...
Hamid Pirahesh, Joseph M. Hellerstein, Waqar Hasan
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
15 years 1 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
FOCS
2006
IEEE
15 years 3 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
IPTPS
2003
Springer
15 years 2 months ago
On the Feasibility of Peer-to-Peer Web Indexing and Search
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, ...
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
15 years 3 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...