Techniques for inverted index compression
GE Pibiri, R Venturini - ACM Computing Surveys (CSUR), 2020 - dl.acm.org
The data structure at the core of large-scale search engines is the inverted index, which is
essentially a collection of sorted integer sequences called inverted lists. Because of the …
essentially a collection of sorted integer sequences called inverted lists. Because of the …
Decoding billions of integers per second through vectorization
In many important applications—such as search engines and relational database systems—
data are stored in the form of arrays of integers. Encoding and, most importantly, decoding of …
data are stored in the form of arrays of integers. Encoding and, most importantly, decoding of …
Semantic search on text and knowledge bases
This article provides a comprehensive overview of the broad area of semantic search on text
and knowledge bases. In a nutshell, semantic search is “search with meaning”. This …
and knowledge bases. In a nutshell, semantic search is “search with meaning”. This …
Cloud computing in e-Science: research challenges and opportunities
Abstract Service-oriented architecture (SOA), workflow, the Semantic Web, and Grid
computing are key enabling information technologies in the development of increasingly …
computing are key enabling information technologies in the development of increasingly …
Default structured search queries on online social networks
YK Lee, KL Peiris, WR Maschmeyer… - US Patent …, 2014 - Google Patents
In one embodiment, a method includes accessing a social graph that includes a plurality of
nodes and edges, identifying a nodes corresponding to a page currently accessed by a first …
nodes and edges, identifying a nodes corresponding to a page currently accessed by a first …
Dynamically generating recommendations based on social graph information
S Narayanan, S Singh, A Li - US Patent 9,223,879, 2015 - Google Patents
In one embodiment, a method includes maintaining access to information comprising nodes
and edges; receiving a request from a first user corresponding to a first user node for a …
and edges; receiving a request from a first user corresponding to a first user node for a …
Automatically generating nodes and edges in an integrated social graph
8, 112,529 8,185.558 8,239,364 8,271,471 8,271.546 8,321,364 8,364,709 8,386.465
8,407.200 8.412, 749 8,538,960 8,572,129 8,595,297 8,601,027 8,732,208 8,751,521 …
8,407.200 8.412, 749 8,538,960 8,572,129 8,595,297 8,601,027 8,732,208 8,751,521 …
Ambiguous structured search queries on online social networks
YK Lee, KL Peiris, WR Maschmeyer… - US Patent …, 2014 - Google Patents
In one embodiment, a method includes accessing a social graph that includes a plurality of
nodes and edges, receiving an unstructured text query comprising an ambiguous n-gram …
nodes and edges, receiving an unstructured text query comprising an ambiguous n-gram …
Partitioned elias-fano indexes
G Ottaviano, R Venturini - Proceedings of the 37th international ACM …, 2014 - dl.acm.org
The Elias-Fano representation of monotone sequences has been recently applied to the
compression of inverted indexes, showing excellent query performance thanks to its efficient …
compression of inverted indexes, showing excellent query performance thanks to its efficient …
[图书][B] Real-time linked dataspaces: Enabling data ecosystems for intelligent systems
E Curry - 2020 - library.oapen.org
This open access book explores the dataspace paradigm as a best-effort approach to data
management within data ecosystems. It establishes the theoretical foundations and …
management within data ecosystems. It establishes the theoretical foundations and …