902 search results - page 68 / 181 » Efficient and Extensible Algorithms for Multi Query Optimiza... |
160
click to vote
VLDB
1987
ACM
15 years 10 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
276
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Abstract-- We present COLR-Tree, an abstraction layer designed to support efficient spatio-temporal queries on live data gathered from a large collection of sensors. We use COLR-Tr...
206
click to vote
SIGMOD
2010
ACM
15 years 4 months 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...
302
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
193
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...