Sciweavers

55 search results - page 4 / 11
» Evaluating rank joins with optimal cost
Sort
View
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
14 years 7 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
BROADNETS
2005
IEEE
13 years 11 months ago
Network selection using fuzzy logic
—The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterize...
Shubha Kher, Arun K. Somani, Rohit Gupta
ICDE
2001
IEEE
121views Database» more  ICDE 2001»
14 years 7 months ago
Integrating Semi-Join-Reducers into State of the Art Query Processors
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 6 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
GIS
2007
ACM
13 years 10 months ago
Pipelined spatial join processing for quadtree-based indexes
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
Walid G. Aref