Sciweavers

138 search results - page 3 / 28
» Efficient top-k querying over social-tagging networks
Sort
View
PVLDB
2008
174views more  PVLDB 2008»
13 years 4 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
FOCS
2009
IEEE
13 years 8 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ICDE
2008
IEEE
188views Database» more  ICDE 2008»
14 years 6 months ago
Efficient Aggregate Computation over Data Streams
Abstract-- Cisco's NetFlow Collector (NFC) is a powerful example of a real-world product that supports multiple aggregate queries over a continuous stream of IP flow records. ...
Kanthi Nagaraj, K. V. M. Naidu, Rajeev Rastogi, Sc...
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 2 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
ICDCS
2007
IEEE
13 years 8 months ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal