Sciweavers

525 search results - page 27 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
ICDE
2006
IEEE
189views Database» more  ICDE 2006»
16 years 29 days ago
Algebraic Optimization of Nested XPath Expressions
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
Matthias Brantner, Carl-Christian Kanne, Guido Moe...
ICDE
2000
IEEE
116views Database» more  ICDE 2000»
16 years 28 days ago
Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering
Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database appl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 6 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
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
SSD
2005
Springer
175views Database» more  SSD 2005»
15 years 5 months ago
Probabilistic Spatial Queries on Existentially Uncertain Data
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...
Xiangyuan Dai, Man Lung Yiu, Nikos Mamoulis, Yufei...