{"id":"https://openalex.org/W7169209439","doi":"https://doi.org/10.48550/arxiv.2607.13875","title":"Lexicographic Direct Access with Functional Dependencies","display_name":"Lexicographic Direct Access with Functional Dependencies","publication_year":2026,"publication_date":"2026-07-15","ids":{"openalex":"https://openalex.org/W7169209439","doi":"https://doi.org/10.48550/arxiv.2607.13875"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.13875","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.13875","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.13875","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018990877","display_name":"Florent Capelli","orcid":"https://orcid.org/0000-0002-2842-8223"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Capelli, Florent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030337488","display_name":"Nofar Carmeli","orcid":"https://orcid.org/0000-0003-0673-5510"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carmeli, Nofar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140984586","display_name":"Stefan Mengel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mengel, Stefan","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":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/T10317","display_name":"Advanced Database Systems and Queries","score":0.6521000266075134,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.6521000266075134,"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/T11719","display_name":"Data Quality and Management","score":0.09669999778270721,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.05490000173449516,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.8769000172615051},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7620000243186951},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.595300018787384},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.54830002784729},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5252000093460083},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4325000047683716},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.375},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.35339999198913574}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.8769000172615051},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7620000243186951},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.595300018787384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5494999885559082},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.54830002784729},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5252000093460083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46639999747276306},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4325000047683716},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4088999927043915},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37279999256134033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36309999227523804},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C26320393","wikidata":"https://www.wikidata.org/wiki/Q597053","display_name":"Functional dependency","level":3,"score":0.3495999872684479},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.336899995803833},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C40683218","wikidata":"https://www.wikidata.org/wiki/Q5260625","display_name":"Dependency theory (database theory)","level":4,"score":0.2793999910354614},{"id":"https://openalex.org/C70000936","wikidata":"https://www.wikidata.org/wiki/Q4672467","display_name":"Access method","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2768999934196472},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.13875","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.13875","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.13875","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.13875","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,38,66,83],"study":[1],"the":[2,29,42,52,55,62,101,107,114,124,132,140,143,184],"complexity":[3],"of":[4,45,109,161],"lexicographic":[5,162],"direct":[6,115,163],"access":[7,36,116,164],"to":[8,33,113,177],"join":[9],"query":[10,56,94],"answers":[11,95],"over":[12],"databases":[13],"that":[14,68,99,123,155],"satisfy":[15],"functional":[16],"dependencies":[17],"(FDs).":[18],"More":[19],"precisely,":[20],"we":[21,121,153],"give":[22],"fine-grained":[23],"lower":[24,147,170],"and":[25,57,59,146,181],"upper":[26,145],"bounds":[27,74,92,148,171],"on":[28,183],"preprocessing":[30,167],"time":[31],"required":[32],"achieve":[34],"polylogarithmic":[35],"time.":[37,168],"start":[39],"by":[40,90],"considering":[41],"simple":[43,70],"approach":[44,71,137],"a":[46,86,110,158],"reordered":[47],"extension,":[48],"which":[49],"first":[50],"incorporates":[51],"FDs":[53,63,77,102],"in":[54,134,172],"order,":[58],"then":[60,84],"ignores":[61],"during":[64],"evaluation.":[65],"show":[67,122,154],"this":[69,135,173],"gives":[72],"tight":[73],"for":[75,80,93,138],"unary":[76],"but":[78],"fails":[79],"general":[81],"FDs.":[82],"consider":[85],"second":[87,136],"approach,":[88],"inspired":[89],"size":[91],"using":[96],"information":[97],"theory,":[98],"takes":[100],"into":[103],"account":[104],"while":[105,130],"materializing":[106],"bags":[108],"decomposition":[111,133],"tailored":[112],"task":[117],"at":[118],"hand.":[119],"Interestingly,":[120],"same":[125],"reordering":[126],"is":[127],"also":[128],"useful":[129],"constructing":[131],"reducing":[139],"complexity.":[141],"While":[142],"obtained":[144],"are":[149],"generally":[150],"not":[151],"tight,":[152],"they":[156],"yield":[157],"complete":[159],"characterization":[160],"with":[165],"linear":[166],"All":[169],"paper":[174],"apply":[175],"only":[176],"queries":[178],"without":[179],"self-joins":[180],"rely":[182],"Zero-Clique":[185],"Conjecture.":[186]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-17T00:00:00"}