Efficient retrieval of the top-k most relevant spatial web objects
Citations
339 citations
Cites background from "Efficient retrieval of the top-k mo..."
...Another example is that the outcome can be combined with the socalled location-aware keyword query [6]....
[...]
323 citations
Cites background or methods from "Efficient retrieval of the top-k mo..."
...IR2-Tree [9] IR2 R-Tree bitmaps tightly combined √ △ IR-Tree [7, 20] IR R-Tree inverted file tightly combined △ √ △ IR-Tree [16] IRLi R-Tree inverted file tightly combined √...
[...]
...The construction of the CDIR-tree involves two parameters....
[...]
...The DIRtree [7, 20] takes both spatial and textual information into account during the tree construction by optimizing for a combination of minimizing the areas of MBRs and maximizing the text similarities between the objects of the enclosing rectangles....
[...]
...To distinguish it from the IR-tree in references [7,20], we refer to it as the IRLi-tree....
[...]
...Several variants of the IR-tree exist, which optimize the IR-tree, including the DIR-tree, the CIR-tree, and the CDIR-tree....
[...]
320 citations
Cites background or methods from "Efficient retrieval of the top-k mo..."
...The IR-tree [8] is essentially an R-tree [12] extended with inverted files [16]....
[...]
...This development gives prominence to spatial keyword queries [5, 6, 8, 10]....
[...]
...This algorithm utilizes a spatial-keyword index such as the IRtree [8] to prune the search space....
[...]
...Several recently proposed hybrid indexes [5, 8, 10, 14, 15] that tightly integrate spatial indexing (e....
[...]
...We use the IR-tree [8], covered in Section 3....
[...]
246 citations
175 citations
Cites background or methods from "Efficient retrieval of the top-k mo..."
...We extend the IR-tree [8] index structure to organize spatial objects and capture the pre-computed information needed for upper bound estimation....
[...]
...Specifically, we organize the spatial objects by extending the external memory IR-tree [8]....
[...]
...Recent studies [7, 8, 10, 21, 22] on geographical retrieval address the problem of spatial keyword search....
[...]
...We follow existing work [8,20] and use a linear combination of the normalized factors for ranking an object o with respect to a query Q:...
[...]
...The extended IR-tree used in this paper and the original IRtree [8] share a similar data structure....
[...]
References
42,654 citations
40,020 citations
9,923 citations
7,336 citations
"Efficient retrieval of the top-k mo..." refers background or methods in this paper
...The IRtree is constructed by means of an insert operation that is adapted from the corresponding R-tree operation [13]....
[...]
...In this solution, an R-tree [13] indexes the points, potential nearest neighbors are maintained in a priority queue, and the tree is traversed according to a number of heuristics....
[...]
...It uses a standard implementation of the R-tree [13] with operations ChooseLeaf and Split....
[...]
...We incorporate document similarity into the standard Quadratic Split algorithm [13]....
[...]
...The R-tree [13] is arguably the dominant index for spatial queries, and the inverted file is the most efficient index for text information retrieval [33]....
[...]
4,686 citations
"Efficient retrieval of the top-k mo..." refers methods in this paper
...The best approach according to their experiments is to build an R*-tree for each distinct keyword on the web pages containing the keyword....
[...]
...Hjaltason and Samet [15] propose an incremental nearest neighbor algorithm based on an R*-tree [4]....
[...]
...As a result, queries with multiple keywords need to access multiple R*-trees and to intersect the results....
[...]
...The R*-tree: an efficient and robust access method for points and rectangles....
[...]
...Another hybrid indexing structure [31] combines the R*-tree and bitmap indexing to process the m-closest keyword query that returns the spatially closest objects matching m keywords....
[...]