{"id":"https://openalex.org/W7098821079","doi":null,"title":"A Data Structure for Maintaining . . .","display_name":"A Data Structure for Maintaining . . .","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W7098821079"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.3561","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.3561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~pliang/papers/hypercycle-2005.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025255782","display_name":"Percy Liang","orcid":"https://orcid.org/0000-0002-0458-6139","observed_orcids":["https://orcid.org/0000-0002-0458-6139"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Percy Liang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070613374","display_name":"Nathan Srebro","orcid":"https://orcid.org/0000-0002-0763-1740","observed_orcids":["https://orcid.org/0000-0002-0763-1740"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nathan Srebro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.55472458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5824999809265137,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5824999809265137,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.23399999737739563,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.09669999778270721,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/chordal-graphs","display_name":"chordal graphs","score":0.7580000162124634},{"id":"https://openalex.org/keywords/hypercycles","display_name":"hypercycles","score":0.7120000123977661},{"id":"https://openalex.org/keywords/hierarchical-decomposition","display_name":"hierarchical decomposition","score":0.7570000290870667},{"id":"https://openalex.org/keywords/dynamic-data-structures","display_name":"dynamic data structures","score":0.8799999952316284},{"id":"https://openalex.org/keywords/union-find","display_name":"union-find","score":0.7770000100135803},{"id":"https://openalex.org/keywords/inverse-ackermann-function","display_name":"inverse Ackermann function","score":0.7829999923706055}],"concepts":[{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.7081000208854675},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.6696000099182129},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6410999894142151},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.6116999983787537},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5932999849319458},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5849000215530396},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5740000009536743},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5559999942779541},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.534600019454956},{"id":"https://openalex.org/C2983050975","wikidata":"https://www.wikidata.org/wiki/Q88287214","display_name":"Block structure","level":3,"score":0.49630001187324524},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.47850000858306885},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.446399986743927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36970001459121704},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.3343999981880188},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.31679999828338623},{"id":"https://openalex.org/C2779954242","wikidata":"https://www.wikidata.org/wiki/Q6031227","display_name":"Information structure","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28690001368522644},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2824999988079071},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C100463513","wikidata":"https://www.wikidata.org/wiki/Q5227322","display_name":"Data model (GIS)","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C12439846","wikidata":"https://www.wikidata.org/wiki/Q4809258","display_name":"Database theory","level":3,"score":0.26269999146461487}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.3561","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.3561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~pliang/papers/hypercycle-2005.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1549608458","https://openalex.org/W1991477862","https://openalex.org/W4252143234","https://openalex.org/W2057796604","https://openalex.org/W1491471968","https://openalex.org/W3155972631","https://openalex.org/W2371534018","https://openalex.org/W2016035215","https://openalex.org/W317369104","https://openalex.org/W84161179"],"abstract_inverted_index":{"Acyclicity":[0],"is":[1],"an":[2,99,106],"important":[3],"property":[4],"of":[5,33,46,53,113,119],"hypergraphs":[6],"which":[7],"has":[8,105],"applications":[9],"in":[10,22,58,73,95],"many":[11],"areas":[12],"such":[13],"as":[14,80],"graphical":[15],"models":[16],"and":[17,49],"relational":[18],"databases.":[19],"Our":[20],"contributions":[21],"this":[23,59,120],"paper":[24],"are":[25],"two-fold:":[26],"First,":[27],"we":[28,62,123],"present":[29,63],"two":[30],"new":[31],"characterizations":[32],"a":[34,43,55,74,81],"hyperforest":[35,48],"(equivalently,":[36],"acyclic":[37],"hypergraph":[38],"or":[39],"triangulated":[40],"graph)":[41],"through":[42,50],"hierarchical":[44],"decomposition":[45],"the":[47,51,64,111,117],"lack":[52],"hypercycles,":[54],"concept":[56],"defined":[57],"paper.":[60],"Second,":[61],"first":[65],"efficient":[66],"dynamic":[67],"data":[68,77,86,121,128],"structure":[69,78,87,129],"for":[70],"maintaining":[71],"acyclicity":[72,94],"hypergraph.":[75],"The":[76],"uses":[79],"building":[82],"block":[83],"Tarjan\u2019s":[84],"Union-Find":[85],"(which":[88],"can":[89],"be":[90],"used":[91],"to":[92,97,130],"maintain":[93],"graphs)":[96],"achieve":[98],"amortized":[100],"expected":[101],"query":[102],"time":[103],"that":[104],"inverse":[107],"Ackermann":[108],"dependence":[109],"on":[110],"number":[112],"vertices.":[114],"To":[115],"demonstrate":[116],"practicality":[118],"structure,":[122],"conduct":[124],"experiments":[125],"using":[126],"our":[127],"construct":[131],"high-weight":[132],"hyperforests.":[133]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-27T00:00:00"}