Sciweavers

363 search results - page 28 / 73
» Analyzing Plan Diagrams of Database Query Optimizers
Sort
View
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
14 years 2 months ago
A Cost-Space Approach to Distributed Query Optimization in Stream Based Overlays
Abstract— Distributed stream-based applications, such as continuous query systems, have network scale and time characteristics that challenge traditional distributed query optimi...
Jeffrey Shneidman, Peter R. Pietzuch, Matt Welsh, ...
EDBT
2002
ACM
141views Database» more  EDBT 2002»
14 years 9 months ago
Efficient OLAP Query Processing in Distributed Data Warehouses
Abstract. The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing networ...
Michael O. Akinde, Michael H. Böhlen, Theodor...
PPAM
2005
Springer
14 years 2 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
ICDE
2012
IEEE
196views Database» more  ICDE 2012»
11 years 11 months ago
Scalable Multi-query Optimization for SPARQL
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
Wangchao Le, Anastasios Kementsietsidis, Songyun D...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 3 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar