Beyond the Inverted Index

08/13/2019
by   Zhi-Hong Deng, et al.
0

In this paper, a new data structure named group-list is proposed. The group-list is as simple as the inverted index. However, the group-list divides document identifiers in an inverted index into groups, which makes it more efficient when it is used to perform the intersection or union operation on document identifiers. The experimental results on a synthetic dataset show that the group-list outperforms the inverted index.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2018

On subgroups of minimal index

Let G be a group possessing a proper subgroup of finite index. We prove ...
research
10/28/2014

New similarity index based on entropy and group theory

In this work, we propose a new similarity index for images considering t...
research
10/06/2019

Citation network centrality: a scientific awards predictor?

K index is an easily computable centrality index in complex networks, su...
research
05/06/2018

Wormhole: A Fast Ordered Index for In-memory Data Management

In-memory data management systems, such as key-value store, have become ...
research
06/08/2018

List-decoding homomorphism codes with arbitrary codomains

The codewords of the homomorphism code aHom(G,H) are the affine homomorp...
research
09/19/2022

MARIA: Multiple-alignment r-index with aggregation

There now exist compact indexes that can efficiently list all the occurr...
research
02/08/2020

Index-based Solutions for Efficient Density Peaks Clustering

Density Peaks Clustering (DPC), a novel density-based clustering approac...

Please sign up or login with your details

Forgot password? Click here to reset