Sciweavers

183 search results - page 12 / 37
» Query Processing in Tertiary Memory Databases
Sort
View
ISCI
2007
141views more  ISCI 2007»
15 years 1 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
JIPS
2008
112views more  JIPS 2008»
15 years 1 months ago
Two-Tier Storage DBMS for High-Performance Query Processing
: This paper describes the design and implementation of a two-tier DBMS for handling massive data and providing faster response time. In the present day, the main requirements of D...
Sang Hun Eo, Yan Li, Ho Seok Kim, Hae-Young Bae
IPPS
2005
IEEE
15 years 7 months ago
Evaluation of Rate-Based Adaptivity in Asynchronous Data Stream Joins
Continuous query systems are an intuitive way for users to access streaming data in large-scale scientific applications containing many hundreds of streams. A challenge in these ...
Beth Plale, Nithya N. Vijayakumar
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
15 years 7 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
16 years 3 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...