Sciweavers

651 search results - page 70 / 131
» Algebraic Query Optimization for Distributed Top-k Queries
Sort
View
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...
ICLP
2009
Springer
14 years 9 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
RTCSA
2008
IEEE
14 years 3 months ago
Efficient Query Processing for Tracing RFID Tags by Reordering Location Identifiers
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
Sungwoo Ahn, Bonghee Hong
ADHOC
2005
143views more  ADHOC 2005»
13 years 9 months ago
Active query forwarding in sensor networks
While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mech...
Narayanan Sadagopan, Bhaskar Krishnamachari, Ahmed...
CLOUD
2010
ACM
14 years 2 months ago
Comet: batched stream processing for data intensive distributed computing
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, B...