Sciweavers

6974 search results - page 106 / 1395
» Querying Semi-Structured Data
Sort
View
ICDE
2007
IEEE
155views Database» more  ICDE 2007»
14 years 2 months ago
Query-Aware Sampling for Data Streams
Data Stream Management Systems are useful when large volumes of data need to be processed in real time. Examples include monitoring network traffic, monitoring financial transacti...
Theodore Johnson, S. Muthukrishnan, Vladislav Shka...
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 9 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
ISCIS
2005
Springer
14 years 1 months ago
Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
Margarida Mamede
SIGMOD
2008
ACM
115views Database» more  SIGMOD 2008»
14 years 8 months ago
Query answering techniques on uncertain and probabilistic data: tutorial summary
Uncertain data are inherent in some important applications, such as environmental surveillance, market analysis, and quantitative economics research. Due to the importance of thos...
Jian Pei, Ming Hua, Yufei Tao, Xuemin Lin
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
14 years 9 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik