Sciweavers

238 search results - page 28 / 48
» The Data Cyclotron query processing scheme
Sort
View
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
14 years 7 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
14 years 11 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 9 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
VLDB
2007
ACM
138views Database» more  VLDB 2007»
14 years 10 months ago
CADS: Continuous Authentication on Data Streams
We study processing and authentication of long-running queries on outsourced data streams. In this scenario, a data owner (DO) constantly transmits its data to a service provider ...
Stavros Papadopoulos, Yin Yang, Dimitris Papadias
DOLAP
2005
ACM
13 years 11 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea