Sciweavers

1429 search results - page 61 / 286
» Efficient processing of XPath queries using indexes
Sort
View
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
14 years 10 months ago
ProVeR: Probabilistic Video Retrieval using the Gauss-Tree
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
13 years 10 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
EDBT
2009
ACM
113views Database» more  EDBT 2009»
14 years 3 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin
MDBIS
2003
132views Database» more  MDBIS 2003»
13 years 10 months ago
Cache-supported Processing of Queries in Mobile DBS
: The usage of mobile equipment like PDAs, mobile phones, Tablet PCs or laptops is already common in our current information society. Typically, mobile information systems work in ...
Hagen Höpfner, Kai-Uwe Sattler
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...