Sciweavers

48 search results - page 3 / 10
» PBiTree Coding and Efficient Processing of Containment Joins
Sort
View
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 7 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 9 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
VLDB
1995
ACM
194views Database» more  VLDB 1995»
13 years 11 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
LCPC
2000
Springer
13 years 11 months ago
Automatic Coarse Grain Task Parallel Processing on SMP Using OpenMP
This paper proposes a simple and efficient implementation method for a hierarchical coarse grain task parallel processing scheme on a SMP machine. OSCAR multigrain parallelizing c...
Hironori Kasahara, Motoki Obata, Kazuhisa Ishizaka
WAIM
2010
Springer
13 years 5 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan