{"id":"https://openalex.org/W7125545373","doi":"https://doi.org/10.48550/arxiv.2601.16025","title":"EAIFD: A Fast and Scalable Algorithm for Incremental Functional Dependency Discovery","display_name":"EAIFD: A Fast and Scalable Algorithm for Incremental Functional Dependency Discovery","publication_year":2026,"publication_date":"2026-01-22","ids":{"openalex":"https://openalex.org/W7125545373","doi":"https://doi.org/10.48550/arxiv.2601.16025"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.16025","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.16025","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.16025","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123631484","display_name":"Yajuan Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xu, Yajuan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120047531","display_name":"Xixian Han","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Han, Xixian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5123691071","display_name":"Xiaolong Wan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wan, Xiaolong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5123631484"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11719","display_name":"Data Quality and Management","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11719","display_name":"Data Quality and Management","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.004600000102072954,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11106","display_name":"Data Management and Algorithms","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/scalability","display_name":"Scalability","score":0.7258999943733215},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6198999881744385},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5421000123023987},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5418000221252441},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.508400022983551},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.4106000065803528},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.3894999921321869},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.3709999918937683},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.3452000021934509}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7990000247955322},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7258999943733215},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6198999881744385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.557200014591217},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5421000123023987},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5418000221252441},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.508400022983551},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.4106000065803528},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.3894999921321869},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.3709999918937683},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.3452000021934509},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.33219999074935913},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32409998774528503},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.323199987411499},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.3174000084400177},{"id":"https://openalex.org/C26320393","wikidata":"https://www.wikidata.org/wiki/Q597053","display_name":"Functional dependency","level":3,"score":0.30809998512268066},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C88196245","wikidata":"https://www.wikidata.org/wiki/Q8034984","display_name":"Working set","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2838999927043915},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.25099998712539673},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.16025","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.16025","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.16025","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.16025","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Functional":[0],"dependencies":[1],"(FDs)":[2],"are":[3,21],"fundamental":[4],"integrity":[5],"constraints":[6],"in":[7,168],"relational":[8],"databases,":[9],"but":[10],"discovering":[11],"them":[12],"under":[13],"incremental":[14,27,48,62,188],"updates":[15],"remains":[16],"challenging.":[17],"While":[18],"static":[19],"algorithms":[20,28],"inefficient":[22],"due":[23],"to":[24,101,114,123,158,164],"full":[25,74],"re-execution,":[26],"suffer":[29],"from":[30],"severe":[31],"performance":[32],"and":[33,59,129,184],"memory":[34,97,172],"bottlenecks.":[35],"To":[36],"address":[37],"these":[38],"challenges,":[39],"this":[40],"paper":[41],"proposes":[42],"EAIFD,":[43],"a":[44,82,181],"novel":[45],"algorithm":[46],"for":[47,89,135,187],"FD":[49,63,189],"discovery.":[50,190],"EAIFD":[51,76,161],"maintains":[52],"the":[53,61,105,117,126,152],"partial":[54],"hypergraph":[55],"of":[56,93,104,138,155],"difference":[57],"sets":[58],"reframes":[60],"discovery":[64],"problem":[65],"into":[66],"minimal":[67],"hitting":[68],"set":[69],"enumeration":[70],"on":[71,148],"hypergraph,":[72],"avoiding":[73,142],"re-runs.":[75],"introduces":[77],"two":[78,176],"key":[79],"innovations.":[80],"First,":[81],"multi-attribute":[83],"hash":[84],"table":[85],"($MHT$)":[86],"is":[87,99,112],"devised":[88],"high-frequency":[90],"key-value":[91],"mappings":[92],"valid":[94],"FDs,":[95],"whose":[96],"consumption":[98],"proven":[100],"be":[102],"independent":[103],"dataset":[106],"size.":[107],"Second,":[108],"two-step":[109],"validation":[110,127,137],"strategy":[111],"developed":[113],"efficiently":[115],"validate":[116],"enumerated":[118],"candidates,":[119,140],"which":[120],"leverages":[121],"$MHT$":[122],"effectively":[124,141],"reduce":[125],"space":[128],"then":[130],"selectively":[131],"loads":[132],"data":[133],"blocks":[134],"batch":[136],"remaining":[139],"repeated":[143],"I/O":[144],"operations.":[145],"Experimental":[146],"results":[147],"real-world":[149],"datasets":[150],"demonstrate":[151],"significant":[153],"advantages":[154],"EAIFD.":[156],"Compared":[157],"existing":[159],"algorithms,":[160],"achieves":[162],"up":[163],"an":[165],"order-of-magnitude":[166],"speedup":[167],"runtime":[169],"while":[170],"reducing":[171],"usage":[173],"by":[174],"over":[175],"orders-of-magnitude,":[177],"establishing":[178],"it":[179],"as":[180],"highly":[182],"efficient":[183],"scalable":[185],"solution":[186]},"counts_by_year":[],"updated_date":"2026-01-24T23:27:35.965710","created_date":"2026-01-24T00:00:00"}