Sciweavers

1890 search results - page 165 / 378
» Querying Big Data by Accessing Small Data
Sort
View
ECOOP
1999
Springer
15 years 10 months ago
Dynamic Query-Based Debugging
Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debu...
Raimondas Lencevicius, Urs Hölzle, Ambuj K. S...
INFOCOM
2011
IEEE
14 years 10 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
16 years 8 months ago
SAO: A Stream Index for Answering Linear Optimization Queries
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
Gang Luo, Kun-Lung Wu, Philip S. Yu
WAIM
2010
Springer
15 years 4 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
VLDB
2007
ACM
105views Database» more  VLDB 2007»
16 years 6 months ago
Using a distributed quadtree index in peer-to-peer networks
Abstract Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries a...
Egemen Tanin, Aaron Harwood, Hanan Samet