Sciweavers

SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
14 years 7 months ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 7 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 7 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
SIGMOD
2004
ACM
120views Database» more  SIGMOD 2004»
14 years 7 months ago
Prediction and Indexing of Moving Objects with Unknown Motion Patterns
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...
Yufei Tao, Christos Faloutsos, Dimitris Papadias, ...
SIGMOD
2004
ACM
151views Database» more  SIGMOD 2004»
14 years 7 months ago
Highly-Available, Fault-Tolerant, Parallel Dataflows
We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to im...
Mehul A. Shah, Joseph M. Hellerstein, Eric A. Brew...
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
14 years 7 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
14 years 7 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
SIGMOD
2004
ACM
125views Database» more  SIGMOD 2004»
14 years 7 months ago
STRIPES: An Efficient Index for Predicted Trajectories
Jignesh M. Patel, Yun Chen, V. Prasad Chakka
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
14 years 7 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 7 months ago
Constraint-Based XML Query Rewriting For Data Integration
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Cong Yu, Lucian Popa