574 search results - page 32 / 115 » Distributed Queries and Query Optimization in Schema-Based P... |
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
140
click to vote
SIGMOD
2010
ACM
15 years 8 days ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
109
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
146
Voted
JIDM
2010
14 years 8 months ago
2010
The increasing volume of data stored as XML documents makes fragmentation techniques an alternative to the performance issues in query processing. Fragmented databases are feasible...
142
Voted
SIGMOD
1995
ACM
15 years 5 months ago
1995
ACM
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...