{"id":"https://openalex.org/W2012714839","doi":"https://doi.org/10.1137/s009753970240481x","title":"Optimal External Memory Interval Management","display_name":"Optimal External Memory Interval Management","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2012714839","doi":"https://doi.org/10.1137/s009753970240481x","mag":"2012714839"},"language":"en","primary_location":{"id":"doi:10.1137/s009753970240481x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970240481x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1808/13800","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084056010","display_name":"Lars Arge","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lars Arge","raw_affiliation_strings":["Duke University"],"affiliations":[{"raw_affiliation_string":"Duke University","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Scott Vitter","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN 47907"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN 47907","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084056010"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":3.5566,"has_fulltext":false,"cited_by_count":137,"citation_normalized_percentile":{"value":0.93611006,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"32","issue":"6","first_page":"1488","last_page":"1508"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9995999932289124,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.996399998664856,"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/interval","display_name":"Interval (graph theory)","score":0.6918914914131165},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.6359955072402954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6313836574554443},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.555942177772522},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5435963869094849},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4776288866996765},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4694361686706543},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3927609324455261},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3874569535255432},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37244322896003723},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.34668365120887756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31319141387939453},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12495002150535583},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08449912071228027}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6918914914131165},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.6359955072402954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6313836574554443},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.555942177772522},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5435963869094849},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4776288866996765},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4694361686706543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3927609324455261},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3874569535255432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37244322896003723},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.34668365120887756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31319141387939453},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12495002150535583},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08449912071228027},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/s009753970240481x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970240481x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1004.5396","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1004.5396","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://kuscholarworks.ku.edu/bitstream/handle/1808/13800/vitter.pdf%3Bjsessionid%3D46EA7F7755E3C244600DB9D0729B0A63?sequence%3D3","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.7081","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.7081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~jsv/Papers/ArV02.interval_management.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.3257","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.3257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.daimi.au.dk/~large/Papers/intervalsicomp.pdf","raw_type":"text"},{"id":"pmh:oai:kuscholarworks.ku.edu:1808/13800","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/13800","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:kuscholarworks.ku.edu:1808/18954","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/18954","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:kuscholarworks.ku.edu:1808/7175","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/7175","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:publications/b3213ab0-b5bd-11df-b4b4-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/b3213ab0-b5bd-11df-b4b4-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L A & Vitter, J S 2003, 'Optimal External Memory Interval Management', S I A M Journal on Computing, vol. 32, Issue 6, pp. 1488-1508. https://doi.org/10.1137/S009753970240481X","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:kuscholarworks.ku.edu:1808/13800","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/13800","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W16477014","https://openalex.org/W25426087","https://openalex.org/W155342555","https://openalex.org/W1480905303","https://openalex.org/W1539221976","https://openalex.org/W1557687109","https://openalex.org/W1577072106","https://openalex.org/W1580652745","https://openalex.org/W1593675831","https://openalex.org/W1594991445","https://openalex.org/W1596887828","https://openalex.org/W1600795850","https://openalex.org/W1977937331","https://openalex.org/W1979207937","https://openalex.org/W1979630448","https://openalex.org/W1994101999","https://openalex.org/W1999644473","https://openalex.org/W2017602223","https://openalex.org/W2026166434","https://openalex.org/W2038142281","https://openalex.org/W2041762692","https://openalex.org/W2043148321","https://openalex.org/W2046441184","https://openalex.org/W2050252966","https://openalex.org/W2068587771","https://openalex.org/W2077180154","https://openalex.org/W2085088576","https://openalex.org/W2088116875","https://openalex.org/W2097224604","https://openalex.org/W2098130516","https://openalex.org/W2106642566","https://openalex.org/W2114123275","https://openalex.org/W2133520229","https://openalex.org/W2142753649","https://openalex.org/W2161694911","https://openalex.org/W2164944647","https://openalex.org/W2179904348","https://openalex.org/W2250334391","https://openalex.org/W2539955899","https://openalex.org/W2901608006","https://openalex.org/W3144437408"],"related_works":["https://openalex.org/W2359095153","https://openalex.org/W2227684440","https://openalex.org/W2042649304","https://openalex.org/W1507617351","https://openalex.org/W2964010605","https://openalex.org/W1979994068","https://openalex.org/W2567477113","https://openalex.org/W2227630426","https://openalex.org/W2549663625","https://openalex.org/W1566044635"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"the":[5,38,60],"external":[6,11,27,79,97],"interval":[7,28,40,80],"tree,":[8,81],"an":[9,34],"optimal":[10,35],"memory":[12],"data":[13,98],"structure":[14,61],"for":[15,48,54,66],"answering":[16],"stabbing":[17],"queries":[18],"on":[19],"a":[20,45,63],"set":[21],"of":[22,59,70,75],"dynamically":[23],"maintained":[24],"intervals.":[25],"The":[26,78],"tree":[29],"can":[30],"be":[31],"used":[32,92],"in":[33],"solution":[36],"to":[37,93],"dynamic":[39],"management":[41],"problem,":[42],"which":[43,73],"is":[44,74],"central":[46],"problem":[47],"object-oriented":[49],"and":[50,53],"temporal":[51],"databases":[52],"constraint":[55],"logic":[56],"programming.":[57],"Part":[58],"uses":[62],"weight-balancing":[64],"technique":[65],"efficient":[67,96],"worst-case":[68],"manipulation":[69],"balanced":[71],"trees,":[72],"independent":[76],"interest.":[77],"as":[82,84],"well":[83],"our":[85],"new":[86],"balancing":[87],"technique,":[88],"have":[89],"recently":[90],"been":[91],"develop":[94],"several":[95],"structures.":[99]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}