Sciweavers

785 search results - page 14 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
DAGSTUHL
1997
13 years 9 months ago
Querying the Uncertain Position of Moving Objects
In this paper we propose a data model for representing moving objects with uncertain positions in database systems. It is called the Moving Objects Spatio-Temporal (MOST) data mod...
A. Prasad Sistla, Ouri Wolfson, Sam Chamberlain, S...
ICDE
2008
IEEE
146views Database» more  ICDE 2008»
14 years 9 months ago
Handling Uncertain Data in Array Database Systems
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
Tingjian Ge, Stanley B. Zdonik
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 7 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
ICDE
2008
IEEE
563views Database» more  ICDE 2008»
15 years 7 months ago
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...
Reynold Cheng, Jinchuan Chen, Mohamed F. Mokbel, C...
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 2 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...