Sciweavers

806 search results - page 42 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
WWW
2005
ACM
14 years 9 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 9 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
INTERNET
2010
283views more  INTERNET 2010»
13 years 7 months ago
Querying the Data Web: The MashQL Approach
 We propose a query formulation language, called MashQL for querying and mashing up structured data on the web. The novelty of  MashQL is that it does not requireÂ...
Mustafa Jarrar, Marios D. Dikaiakos
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 9 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 10 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum