Sciweavers

958 search results - page 29 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
TKDE
2002
148views more  TKDE 2002»
13 years 7 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
EDBT
2000
ACM
13 years 11 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
CORR
2004
Springer
82views Education» more  CORR 2004»
13 years 7 months ago
Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams
We introduce an extension of the XQuery language, FluX, that supports event-based query processing and the conscious handling of main memory buffers. Purely event-based queries of...
Christoph Koch, Stefanie Scherzinger, Nicole Schwe...
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 5 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
WWW
2008
ACM
14 years 8 months ago
Efficient evaluation of generalized path pattern queries on XML data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patt...
Xiaoying Wu, Stefanos Souldatos, Dimitri Theodorat...