785 search results - page 127 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
153
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
163
click to vote
EUROPAR
2008
Springer
15 years 7 months ago
2008
Springer
We present a distributed index data structure and algorithms devised to support parallel query processing of multimedia content in search engines. We present a comparative study wi...
174
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
158
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
SQL in the IBM® DB2® Universal Database™ for Linux®, UNIX®, and Windows® (DB2 UDB) database management product has been extended to support nested INSERT, UPDATE, and DELET...
168
click to vote
SSDBM
2003
IEEE
15 years 11 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...