Sciweavers

1923 search results - page 50 / 385
» Ranking in Spatial Databases
Sort
View
SSD
1989
Springer
62views Database» more  SSD 1989»
13 years 12 months ago
Hierarchical Spatial Data Structures
An overview is presented of the use of hierarchical spatial data structures such as the quadtree. They are based on the principle of recursive decomposition. The focus is on the r...
Hanan Samet
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 2 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
PVLDB
2010
158views more  PVLDB 2010»
13 years 6 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb
DBPL
1997
Springer
117views Database» more  DBPL 1997»
14 years 16 hour ago
Degrees of Monotonicity of Spatial Transformations
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...
Bart Kuijpers
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 9 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas