Unicorn
Authors:
Open Access
- 27 August 2013
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 6 (11) , 1150-1161
Abstract
Unicorn is an online, in-memory social graph-aware indexing system designed to search trillions of edges between tens of billions of users and entities on thousands of commodity servers. Unicorn is based on standard concepts in information retrieval, but it includes features to promote results with good social proximity. It also supports queries that require multiple round-trips to leaves in order to retrieve objects that are more than one edge away from source nodes. Unicorn is designed to answer billions of queries per day at latencies in the hundreds of milliseconds, and it serves as an infrastructural building block for Facebook's Graph Search product. In this paper, we describe the data model and query language supported by Unicorn. We also describe its evolution as it became the primary backend for Facebook's search offerings.Keywords
This publication has 12 references indexed in Scilit:
- Quasi-succinct indices2013
- Balanced label propagation for partitioning massive graphs2013
- Combining inverted indices and structured search for ad-hoc object retrieval2012
- TAO2012
- Keyword search over RDF graphs2011
- The anatomy of a large-scale social search engine2010
- The RDF-3X engine for scalable management of RDF dataThe VLDB Journal, 2009
- Scalable join processing on very large RDF graphs2009
- Knowledge sharing and yahoo answers2008
- Web search for a planet: the google cluster architectureIEEE Micro, 2003