An efficient method to evaluate intersections on big data sets

DOI10.1016/J.TCS.2016.07.018zbMATH Open1350.68091OpenAlexW2495876702MaRDI QIDQ306702FDOQ306702

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

Recommendations

• Finding and enumerating large intersections
• Computing and Combinatorics
• Efficient non-intersection queries on aggregated geometric data
• Fast dynamic intersection searching in a set of isothetic line segments
• Efficient matching for column intersection graphs
• scientific article; zbMATH DE number 1696526
• Segment intersection searching problems in general settings

zbMATH Keywords

big datainterval sequencesinverted filessearch enginesset intersection

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fast set intersection and two-patterns matching
• Title not available (Why is that?)
• Combinatorial Pattern Matching
• Signature-based structures for objects with set-valued attributes
• Improved methods for signature-tree construction
• Title not available (Why is that?)
• Alternation and redundancy analysis of the intersection problem
• Intersection in Integer Inverted Indices
• Compressed Inverted Indexes for In-Memory Search Engines
• Fast Evaluation of Union-Intersection Expressions
• An experimental investigation of set intersection algorithms for text searching
• Title not available (Why is that?)
• Run-length encodings (Corresp.)

Cited In (2)

• Adaptive succinctness
• Adaptive succinctness

Uses Software

• Stony Brook
• Lucene

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306702)