Proximity Search in Databases

9 years 4 months ago
Proximity Search in Databases
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire database for objects that are near" other relevant objects. Proximity search enables simple focusing" queries based on general relationships among objects, helpful for interactive query sessions. We view the database as a graph, withdata invertices objects and relationships indicated by edges. Proximity is dened based on shortest paths between objects. We have implemented a prototype search engine that uses this model to enable keyword searches over databases, and we have found it very e ective for quickly nding relevant information. Computing the distance between objects in a graph stored on disk can be very expensive. Hence, we show how to build compact indexes that allow us to quickly nd the distance between objects at search time. Experiments show that our algorithms are e cient and scale well.
Roy Goldman, Narayanan Shivakumar, Suresh Venkatas
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where VLDB
Authors Roy Goldman, Narayanan Shivakumar, Suresh Venkatasubramanian, Hector Garcia-Molina
Comments (0)