995 search results - page 163 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
127
Voted
SAC
2003
ACM
15 years 7 months ago
2003
ACM
Existing sequence comparison software applications lack automation, abstraction, performance, and flexibility. Users need a new way of studying and applying sequence comparisons i...
199
click to vote
PODS
2009
ACM
16 years 2 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
141
Voted
CIKM
2006
Springer
15 years 5 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...
VLDB
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
152
click to vote
EDBT
2012
ACM
13 years 4 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...