Sciweavers

333 search results - page 12 / 67
» Read-Once Functions and Query Evaluation in Probabilistic Da...
Sort
View
86
Voted
MDM
2009
Springer
116views Communications» more  MDM 2009»
15 years 4 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 3 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...
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
15 years 9 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
ICDE
2007
IEEE
158views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Evaluation of Imprecise Location-Dependent Queries
In location-based services, it is common for a user to issue a query based on his/her current position. One such example is "find the available cabs within two miles of my cu...
Jinchuan Chen, Reynold Cheng
ICADL
2005
Springer
114views Education» more  ICADL 2005»
15 years 3 months ago
Scalability of Databases for Digital Libraries
Search engines of main-stream literature digital libraries such as ACM Digital Library, Google Scholar, and PubMed employ file-based systems, and provide users with a basic boolean...
John Chmura, Nattakarn Ratprasartporn, Gultekin &O...