Algorithms and Data Structures for Hyperedge Queries

Author:

Bertrand Jules1ORCID,Dufossé Fanny2ORCID,Singh Somesh3ORCID,Uçar Bora4ORCID

Affiliation:

1. ENS de Lyon, Lyon, France

2. Inria Grenoble, Rhône Alpes, Montbonnot-Saint-Martin, France

3. Inria Lyon and LIP (UMR5668 Université de Lyon-ENS de Lyon-UCBL-CNRS-Inria), Lyon, France

4. CNRS and LIP (UMR5668 Université de Lyon-ENS de Lyon-UCBL-CNRS-Inria), Lyon, France

Abstract

We consider the problem of querying the existence of hyperedges in hypergraphs. More formally, given a hypergraph, we need to answer queries of the form: “Does the following set of vertices form a hyperedge in the given hypergraph?” Our aim is to set up data structures based on hashing to answer these queries as fast as possible. We propose an adaptation of a well-known perfect hashing approach for the problem at hand. We analyze the space and runtime complexity of the proposed approach and experimentally compare it with the state-of-the-art hashing-based solutions. Experiments demonstrate the efficiency of the proposed approach with respect to the state-of-the-art.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science

Reference29 articles.

1. Space/time trade-offs in hash coding with allowable errors

2. Practical perfect hashing in nearly optimal space

3. Universal classes of hash functions

4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. 2009. Introduction to Algorithms (3rd ed.). The MIT Press, Cambridge, MA.

5. The university of Florida sparse matrix collection

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3