294 search results - page 35 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
EDBT
2010
ACM
15 years 25 days ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
DASFAA
2009
IEEE
15 years 1 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
183
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
155
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...