Sciweavers

552 search results - page 46 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
15 years 12 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
APPINF
2003
15 years 1 months ago
Fast Recursive Data Processing in Graphs using Reduction
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
J. H. ter Bekke, J. A. Bakker
VLDB
2005
ACM
112views Database» more  VLDB 2005»
15 years 5 months ago
Content-Based Routing: Different Plans for Different Data
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
Pedro Bizarro, Shivnath Babu, David J. DeWitt, Jen...
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
14 years 9 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
CORR
2004
Springer
82views Education» more  CORR 2004»
14 years 11 months ago
Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams
We introduce an extension of the XQuery language, FluX, that supports event-based query processing and the conscious handling of main memory buffers. Purely event-based queries of...
Christoph Koch, Stefanie Scherzinger, Nicole Schwe...