Sciweavers

649 search results - page 11 / 130
» Improved and Optimized Partitioning Techniques in Database Q...
Sort
View
DATESO
2009
119views Database» more  DATESO 2009»
14 years 9 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
15 years 12 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
CVDB
2005
ACM
15 years 1 months ago
Optimizing progressive query-by-example over pre-clustered large image databases
The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar imag...
Anicet Kouomou Choupo, Laure Berti-Equille, Annie ...
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
15 years 4 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 3 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim