.png){kind=icon}
返回
An Index for Set Intersection With Post-Filtering
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2023.3329145.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies how to design an index structure on a collection of sets S-1, S-2 , . . . ., S-n to answer the following queries: given distinct set ids a,b is an element of[1,n], report F(S-a boolean AND S-b) where F(.) is a filtering function. We present a solution that can support a great variety of filtering functions - range research, skyline, convex hull, nearest neighbor search, quantile (to name just a few) - with attractive performance guarantees. The guarantees are sensitive to the set collection's pseudoarboricity, a new notion for quantifying the density of {S-1,S-2,...,S-n}. Our index structures are simple to understand and implement.
Keyword:
Data structures
pseudoarboricity
set intersection
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
.png){kind=icon}
Wind energy delivery issues [transmission planning and competitive electricity market operation
PREAI
分享收藏The fermented kelp by Bacillus siamensis has antioxidant, skin-repairing and anti-wrinkle effects
PREAI
分享收藏分享收藏
查看更多内容