Sciweavers

333 search results - page 63 / 67
» Read-Once Functions and Query Evaluation in Probabilistic Da...
Sort
View
ICDE
2004
IEEE
121views Database» more  ICDE 2004»
15 years 11 months ago
Online Amnesic Approximation of Streaming Time Series
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...
Themistoklis Palpanas, Michail Vlachos, Eamonn J. ...
MOBISYS
2008
ACM
15 years 9 months ago
Cascadia: a system for specifying, detecting, and managing rfid events
Cascadia is a system that provides RFID-based pervasive computing applications with an infrastructure for specifying, extracting and managing meaningful high-level events from raw...
Evan Welbourne, Nodira Khoussainova, Julie Letchne...
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
15 years 1 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 1 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
86
Voted
DEXA
2010
Springer
213views Database» more  DEXA 2010»
14 years 10 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...