{"id":"https://openalex.org/W2119677080","doi":"https://doi.org/10.1109/icde.2004.1320037","title":"Multiresolution indexing of XML for frequent queries","display_name":"Multiresolution indexing of XML for frequent queries","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W2119677080","doi":"https://doi.org/10.1109/icde.2004.1320037","mag":"2119677080"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2004.1320037","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2004.1320037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 20th International Conference on Data Engineering","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5021279939","display_name":"Hao He","orcid":"https://orcid.org/0000-0001-8311-6559"},"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":"Hao He","raw_affiliation_strings":["Dept. of Comput. Sci., Duke Univ., Durham, NC, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Duke Univ., Durham, NC, USA#TAB#","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100695453","display_name":"Jun Yang","orcid":"https://orcid.org/0000-0002-3365-4989"},"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":false,"raw_author_name":"Jun Yang","raw_affiliation_strings":["Dept. of Comput. Sci., Duke Univ., Durham, NC, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Duke Univ., Durham, NC, USA#TAB#","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021279939"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":9.9627,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.98197909,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"683","last_page":"694"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.762232780456543},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7253119945526123},{"id":"https://openalex.org/keywords/inverted-index","display_name":"Inverted index","score":0.6337069272994995},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.6244572401046753},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.5282168388366699},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5208533406257629},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5103747248649597},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4984772205352783},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4893054664134979},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4832390248775482},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46756964921951294},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.20675402879714966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18870988488197327},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13432621955871582},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13011324405670166}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.762232780456543},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7253119945526123},{"id":"https://openalex.org/C130590232","wikidata":"https://www.wikidata.org/wiki/Q1671754","display_name":"Inverted index","level":3,"score":0.6337069272994995},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.6244572401046753},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.5282168388366699},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5208533406257629},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5103747248649597},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4984772205352783},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4893054664134979},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4832390248775482},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46756964921951294},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.20675402879714966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18870988488197327},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13432621955871582},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13011324405670166},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icde.2004.1320037","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2004.1320037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 20th International Conference on Data Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.125.3572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.3572","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/dbgroup/papers/2003-hy-mkidx.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.1411","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1411","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/dbgroup/papers/2004-ICDE-hy-mkidx.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W172857819","https://openalex.org/W270849871","https://openalex.org/W1508914815","https://openalex.org/W1515993376","https://openalex.org/W1535992660","https://openalex.org/W1983604014","https://openalex.org/W1994694191","https://openalex.org/W2025695428","https://openalex.org/W2068361557","https://openalex.org/W2087060113","https://openalex.org/W2100674109","https://openalex.org/W2110372316","https://openalex.org/W2110459974","https://openalex.org/W2119677080","https://openalex.org/W2134356404","https://openalex.org/W2134585533","https://openalex.org/W2139475358","https://openalex.org/W2143100570","https://openalex.org/W2152175785","https://openalex.org/W2161728285","https://openalex.org/W4248054357","https://openalex.org/W6607036282","https://openalex.org/W6631136146","https://openalex.org/W6631858281","https://openalex.org/W6672147481","https://openalex.org/W6676678128","https://openalex.org/W6677829259","https://openalex.org/W6679759574","https://openalex.org/W6680718584","https://openalex.org/W6682307788"],"related_works":["https://openalex.org/W2058987221","https://openalex.org/W1895366714","https://openalex.org/W2145657320","https://openalex.org/W2102493899","https://openalex.org/W2388346754","https://openalex.org/W4282568653","https://openalex.org/W2187610212","https://openalex.org/W2399928914","https://openalex.org/W2123678380","https://openalex.org/W180545237"],"abstract_inverted_index":{"XML":[0],"and":[1,31,50,86,141,178,267],"other":[2],"types":[3],"of":[4,26,62,72,107,117,124,169,205,225,228,264],"semi-structured":[5],"data":[6,45,126,171,199],"are":[7,232,256],"typically":[8],"represented":[9],"by":[10,39,174,184],"a":[11,24,111,226,235],"labeled":[12],"directed":[13],"graph.":[14],"To":[15,134,213],"speed":[16],"up":[17,74],"path":[18,70,115,176,186],"expression":[19],"queries":[20],"over":[21],"the":[22,41,44,60,81,97,108,125,149,170,202,220,246],"graph,":[23],"variety":[25],"indexes,":[27],"e.g.,":[28],"1-index,":[29],"A(k)-index,":[30],"D(k)-index,":[32,152],"have":[33,96,129,159],"been":[34],"proposed.":[35],"They":[36],"usually":[37],"work":[38],"partitioning":[40,166,180,241,248],"nodes":[42,93,157,231],"in":[43,94,234,262],"graph":[46,127,172],"into":[47],"equivalence":[48,53],"classes":[49,54],"storing":[51],"these":[52,136],"as":[55],"index":[56,84,92,156,197,265],"nodes.":[57,200],"A(k)-index":[58,95],"introduces":[59],"concept":[61],"local":[63,99,131,161],"bisimilarity":[64],"for":[65,167,181,195],"partitioning.":[66],"It":[67],"accurately":[68],"supports":[69],"expressions":[71,116],"length":[73],"to":[75,158,210,243,258],"some":[76],"tunable":[77],"constant":[78],"k,":[79,102],"allowing":[80,238],"trade-off":[82],"between":[83],"size":[85,266],"query":[87,268],"answering":[88],"power.":[89],"However,":[90,201],"all":[91],"same":[98],"similarity":[100,132,162],"value":[101],"which":[103],"cannot":[104],"take":[105],"advantage":[106],"fact":[109],"that":[110,121,253],"workload":[112],"may":[113,128],"contain":[114],"different":[118,122,130,155,160],"lengths,":[119],"or":[120,198],"parts":[123,168],"requirements.":[133],"overcome":[135],"limitations,":[137],"we":[138,217],"propose":[139,219],"M(k)-":[140],"M*(k)-indexes.":[142],"The":[143],"basic":[144],"M(k)-index":[145,191,206],"is":[146,192],"workload-aware:":[147],"Like":[148],"previously":[150,259],"proposed":[151,260],"it":[153],"allows":[154],"requirements,":[163],"providing":[164],"finer":[165],"targeted":[173,183],"longer":[175],"expressions,":[177],"coarser":[179,240],"those":[182],"shorter":[185],"expressions.":[187],"Unlike":[188],"D(k)index,":[189],"however,":[190],"never":[193],"over-refined":[194],"irrelevant":[196],"workload-aware":[203],"feature":[204],"incurs":[207],"overrefinement":[208],"due":[209],"overqualified":[211],"ancestors.":[212],"solve":[214],"this":[215],"problem,":[216],"further":[218],"M*(k)-index.":[221],"An":[222],"M*(k)-index":[223],"consists":[224],"collection":[227],"indexes":[229,255,261],"whose":[230],"organized":[233],"partition":[236],"hierarchy,":[237],"successively":[239],"information":[242,249],"co-exist":[244],"with":[245],"finest":[247],"required.":[250],"Experiments":[251],"show":[252],"our":[254],"superior":[257],"terms":[263],"performance.":[269]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}