Mechanisms for searching enterprise data graphs
作者： Ravi Murthy , Aman Naimat , Nikhil Raghavan
DOI:
关键词:
摘要: Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For term, identifies a candidate set objects mapped to term. The calculates priority scores based at least in part on one or more of: link analysis graph; an metadata describing structural constraints upon Based graph, result subgraphs, comprising object sets. looks subgraphs order that is may terminate its early, because prioritizing increases likelihood receiving first.
lens.org 参考文章(30)
Eric C. Anderson, John Y. Wang, Manchuen Dino Tang, System and method for displaying and manipulating image data sets ,(1996)
Jack J. Letourneau, Method and apparatus for the generation, manipulation and display of data structures ,(1995)
Naomi Inoue, Keiichirou Hoashi, Kazuo Hashimoto, Kazunori Matsumoto, Scheme for filtering documents on network using relevant and non-relevant profiles ,(2001)
Clemens A. Szyperski, Joshua R. Williams, Jeffrey S. Pinkston, Quetzalcoatl Bradley, Donald F. Box, Martin J. Gudgin, Christopher L. Anderson, Accessing different application data via a common data structure ,(2008)
Craig Nevill-Manning, John Alexander Komoroske, Daniel Loreto, Andrew William Hogue, Randolph G. Brown, Daniel N. Quine, Yohann R. Coppel, Identifying a group of related instances ,(2009)
Charles W. Bachman, Data processing system utilizing data field descriptors for processing data files ,(1973)
Kevin W. Hall, Relational data base system for conveniently constructing graphical images ,(1992)
Shamim A. Alpha, Method and system for response time optimization of data query rankings and retrieval ,(2001)
Brian Robert Muras, Paul Reuben Day, Method applying transitive closure to group by and order by clauses ,(2004)
Jeffrey Scott Eder, Search ranking system ,(2005)