1142 search results - page 88 / 229 » On Supporting Containment Queries in Relational Database Man... |
150
Voted
SSDBM
2003
IEEE
15 years 9 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...
180
click to vote
DEBS
2011
ACM
14 years 7 months ago
2011
ACM
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
241
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
169
click to vote
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
155
click to vote
DASFAA
2004
IEEE
15 years 7 months ago
2004
IEEE
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...