Sciweavers

205 search results - page 21 / 41
» Optimizing Multiple Top-K Queries over Joins
Sort
View
PVLDB
2008
148views more  PVLDB 2008»
13 years 7 months ago
StreamTX: extracting tuples from streaming XML data
We study the problem of extracting flattened tuple data from streaming, hierarchical XML data. Tuple-extraction queries are essentially XML pattern queries with multiple extractio...
Wook-Shin Han, Haifeng Jiang, Howard Ho, Quanzhong...
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SIGMOD
2003
ACM
193views Database» more  SIGMOD 2003»
14 years 7 months ago
Chain : Operator Scheduling for Memory Minimization in Data Stream Systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or real-time query responses in ...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
FOCS
2009
IEEE
13 years 11 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
123views Database» more  ICDE 2008»
14 years 9 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham