Sciweavers

2124 search results - page 290 / 425
» Aggregating time partitions
Sort
View
ICDE
2009
IEEE
115views Database» more  ICDE 2009»
16 years 8 months ago
Efficient Evaluation of Multiple Preference Queries
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
268
Voted
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
16 years 7 months ago
COLR-Tree: Communication-Efficient Spatio-Temporal Indexing for a Sensor Data Web Portal
Abstract-- We present COLR-Tree, an abstraction layer designed to support efficient spatio-temporal queries on live data gathered from a large collection of sensors. We use COLR-Tr...
Yanif Ahmad, Suman Nath
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
16 years 7 months ago
XStream: a Signal-Oriented Data Stream Management System
Sensors capable of sensing phenomena at high data rates on the order of tens to hundreds of thousands of samples per second are now widely deployed in many industrial, civil engine...
Lewis Girod, Yuan Mei, Ryan Newton, Stanislav Rost...
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 7 months ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
16 years 7 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...