An efficient method to evaluate intersections on big data sets

DOI10.1016/j.tcs.2016.07.018zbMath1350.68091OpenAlexW2495876702MaRDI QIDQ306702

Yangjun Chen, Weixin Shen

Publication date: 1 September 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.018

zbMATH Keywords

search enginesset intersectionbig datainterval sequencesinverted files

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Information storage and retrieval of data (68P20)

Related Items (1)

Adaptive succinctness

Uses Software

• Stony Brook
• Lucene

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast set intersection and two-patterns matching
• Signature-based structures for objects with set-valued attributes
• Improved Methods for Signature-Tree Construction
• Alternation and redundancy analysis of the intersection problem
• Intersection in Integer Inverted Indices
• Compressed Inverted Indexes for In-Memory Search Engines
• Combinatorial Pattern Matching
• Fast Evaluation of Union-Intersection Expressions
• An experimental investigation of set intersection algorithms for text searching
• Run-length encodings (Corresp.)

This page was built for publication: An efficient method to evaluate intersections on big data sets