{"id":"https://openalex.org/W2122353940","doi":"https://doi.org/10.1109/dasfaa.2003.1192389","title":"A fast and versatile path index for querying semi-structured data","display_name":"A fast and versatile path index for querying semi-structured data","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2122353940","doi":"https://doi.org/10.1109/dasfaa.2003.1192389","mag":"2122353940"},"language":"en","primary_location":{"id":"doi:10.1109/dasfaa.2003.1192389","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dasfaa.2003.1192389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings.","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/A5044521891","display_name":"Michael Barg","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"M. Barg","raw_affiliation_strings":["School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia","Sch. of Comput. Sci. & Eng., New South Wales Univ., Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]},{"raw_affiliation_string":"Sch. of Comput. Sci. & Eng., New South Wales Univ., Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015158455","display_name":"Raymond K. Wong","orcid":"https://orcid.org/0000-0002-9814-6029"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"R.K. Wong","raw_affiliation_strings":["School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia","Sch. of Comput. Sci. & Eng., New South Wales Univ., Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]},{"raw_affiliation_string":"Sch. of Comput. Sci. & Eng., New South Wales Univ., Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044521891"],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":1.7778,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86254004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"256"},"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.9998000264167786,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9958999752998352,"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/path-expression","display_name":"Path expression","score":0.7881944179534912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7686371803283691},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7297415733337402},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.522529125213623},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48767244815826416},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4335263669490814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38965630531311035},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2745599150657654},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.21352577209472656}],"concepts":[{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.7881944179534912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7686371803283691},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7297415733337402},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.522529125213623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48767244815826416},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4335263669490814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38965630531311035},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2745599150657654},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.21352577209472656},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/dasfaa.2003.1192389","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dasfaa.2003.1192389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.5791","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.5791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cse.unsw.edu.au/pub/doc/papers/UNSW/0209.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W22830412","https://openalex.org/W300032410","https://openalex.org/W1507976212","https://openalex.org/W1508914815","https://openalex.org/W1535992660","https://openalex.org/W1568367777","https://openalex.org/W1749554492","https://openalex.org/W1912713675","https://openalex.org/W1978012600","https://openalex.org/W1995213245","https://openalex.org/W2061884758","https://openalex.org/W2072881690","https://openalex.org/W2081052629","https://openalex.org/W2090103641","https://openalex.org/W2100674109","https://openalex.org/W2108014443","https://openalex.org/W2110459974","https://openalex.org/W2122353940","https://openalex.org/W2123645388","https://openalex.org/W2134356404","https://openalex.org/W2136016195","https://openalex.org/W2139475358","https://openalex.org/W2143100570","https://openalex.org/W2144606308","https://openalex.org/W2149532506","https://openalex.org/W2151768590","https://openalex.org/W2161728285","https://openalex.org/W2165286227","https://openalex.org/W4232842818","https://openalex.org/W4255338640","https://openalex.org/W6631858281","https://openalex.org/W6676678128","https://openalex.org/W6678276715","https://openalex.org/W6679759574","https://openalex.org/W6680718584","https://openalex.org/W6681520551","https://openalex.org/W6684721968"],"related_works":["https://openalex.org/W1759713541","https://openalex.org/W1489208005","https://openalex.org/W2384974102","https://openalex.org/W2373437113","https://openalex.org/W2371125232","https://openalex.org/W2113886942","https://openalex.org/W2122353940","https://openalex.org/W2354605212","https://openalex.org/W2110372316","https://openalex.org/W2116949673"],"abstract_inverted_index":{"The":[0],"richness":[1],"of":[2,7,42,50,69,114,117,143],"semi-structured":[3],"data":[4,6,20],"allows":[5],"varied":[8],"and":[9,27,63,100,151],"inconsistent":[10],"structures":[11],"to":[12,60,87,111,140],"be":[13,22,30,112],"stored":[14],"in":[15,119],"a":[16,25,47,55],"single":[17],"database.":[18],"Such":[19],"can":[21,29],"represented":[23],"as":[24,93],"graph,":[26],"queries":[28,103],"constructed":[31],"using":[32],"path":[33,51,67,96,105,121],"expressions,":[34,52],"which":[35,57,83],"describe":[36],"traversals":[37],"through":[38],"the":[39,115,120],"graph.":[40],"Instead":[41],"providing":[43],"optimal":[44],"performance":[45,65],"for":[46,66,145],"limited":[48],"range":[49],"we":[53],"propose":[54],"mechanism":[56],"is":[58,109,133,149],"shown":[59,110],"have":[61],"consistent":[62],"high":[64],"expressions":[68,97],"any":[70],"complexity,":[71],"including":[72],"those":[73],"with":[74],"descendant":[75],"operators":[76],"(path":[77],"wildcards).":[78],"We":[79],"further":[80],"detail":[81],"mechanisms":[82],"employ":[84],"our":[85,131],"index":[86,132],"perform":[88],"more":[89],"complex":[90],"processing,":[91],"such":[92],"evaluating":[94],"both":[95],"containing":[98,104],"links":[99],"entire":[101],"(sub)":[102],"based":[106],"predicates.":[107],"Performance":[108],"independent":[113],"number":[116],"terms":[118],"expression,":[122],"even":[123],"where":[124],"these":[125],"contain":[126],"wildcards.":[127],"Experiments":[128],"show":[129],"that":[130],"faster":[134],"than":[135],"conventional":[136],"methods":[137],"by":[138],"up":[139],"two":[141],"orders":[142],"magnitude":[144],"certain":[146],"query":[147],"types,":[148],"small,":[150],"scales":[152],"well.":[153]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
