Issue No. 12 - December (2010 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.127
Vagelis Hristidis , Florida International University, Miami
Yannis Papakonstantinou , University of California-San Diego, La Jolla
Ramakrishna Varadarajan , University of Wisconsin-Madison
Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the web to relational and XML databases. These two ranking factors have been used and studied separately in the past. In addition to their semantic differences, a key advantage of proximity search is the existence of efficient execution algorithms. In contrast, due to the complexity of calculating the authority flow, current systems only use precomputed authority flows in runtime. This limitation prohibits authority flow to be used more effectively as a ranking factor. In this paper, we present a comparative analysis of the two ranking factors. We present an efficient approximation of authority flow based on proximity search. We analytically estimate the approximation error and how this affects the ranking of the results of a query.
Database searching, approximation methods, algorithms.
V. Hristidis, Y. Papakonstantinou and R. Varadarajan, "Using Proximity Search to Estimate Authority Flow," in IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 1803-1808, 2010.