6746 search results - page 303 / 1350 » Multimodal Database Query |
112
click to vote
WEBDB
2004
Springer
15 years 9 months ago
2004
Springer
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.
188
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Mashup Feeds is a system that supports integrated web service feeds as continuous queries. We introduce collectionbased stream processing semantics to enable information extractio...
102
click to vote
BTW
2003
Springer
15 years 9 months ago
2003
Springer
: A recent article introduced partitioned B-trees, in which partitions are defined not in the catalogs but by distinct values in an artificial leading key column. As there usually ...
117
click to vote
PODS
1991
ACM
15 years 7 months ago
1991
ACM
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
255
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...