Sciweavers

799 search results - page 39 / 160
» Query Brokers for Distributed and Flexible Query Evaluation
Sort
View
MDM
2009
Springer
116views Communications» more  MDM 2009»
15 years 6 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 15 days ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
CIKM
2008
Springer
15 years 1 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
CCGRID
2004
IEEE
15 years 3 months ago
Serving queries to multi-resolution datasets on disk-based storage clusters
This paper is concerned with efficient querying of very large multi-resolution datasets on storage and compute clusters. We present a suite of services that support storage, index...
Xi Zhang, Tony Pan, Ümit V. Çataly&uum...
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
15 years 5 months ago
Best Effort Query Processing in DHT-based P2P Systems
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
Philipp Rösch, Kai-Uwe Sattler, Christian von...