Sciweavers

3341 search results - page 77 / 669
» On Bounded Queries and Approximation
Sort
View
CIDR
2003
163views Algorithms» more  CIDR 2003»
14 years 11 months ago
Query Processing, Approximation, and Resource Management in a Data Stream Management System
This paper describes our ongoing work developing the Stanford Stream Data Manager (STREAM), a system for executing continuous queries over multiple continuous data streams. The ST...
Rajeev Motwani, Jennifer Widom, Arvind Arasu, Bria...
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
15 years 11 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
CSE
2009
IEEE
15 years 2 months ago
Processing Approximate Moving Range Queries in Mobile Sensor Environments
— The ubiquity of mobile devices has led to a rising demand for location-based services and applications. A major part of these services is based on the location-detection capabi...
Antoniya Petkova, Kien A. Hua, Alexander J. Aved
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
MICAI
2004
Springer
15 years 3 months ago
Graduated Errors in Approximate Queries Using Hierarchies and Ordered Sets
Abstract. Often, qualitative values have an ordering, such as (veryshort, short, medium-height, tall) or a hierarchical level, such as (TheWorld, Europe, Spain, Madrid), which are ...
Adolfo Guzmán-Arenas, Serguei Levachkine