{"id":"https://openalex.org/W1994081385","doi":"https://doi.org/10.1145/1326554.1326556","title":"On the minimization of XPath queries","display_name":"On the minimization of XPath queries","publication_year":2008,"publication_date":"2008-02-01","ids":{"openalex":"https://openalex.org/W1994081385","doi":"https://doi.org/10.1145/1326554.1326556","mag":"1994081385"},"language":"en","primary_location":{"id":"doi:10.1145/1326554.1326556","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1326554.1326556","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-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/A5002811447","display_name":"Sergio Flesca","orcid":"https://orcid.org/0000-0002-4164-940X"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"S. Flesca","raw_affiliation_strings":["DEIS\u2014Universit\u00e0 della Calabria, Rende, Italy","DEIS-Universita della Calabria, Rende, Italy"],"affiliations":[{"raw_affiliation_string":"DEIS\u2014Universit\u00e0 della Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"DEIS-Universita della Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050801592","display_name":"Filippo Furfaro","orcid":"https://orcid.org/0000-0001-5145-1301"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Furfaro","raw_affiliation_strings":["DEIS\u2014Universit\u00e0 della Calabria, Rende, Italy","DEIS-Universita della Calabria, Rende, Italy"],"affiliations":[{"raw_affiliation_string":"DEIS\u2014Universit\u00e0 della Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"DEIS-Universita della Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005904043","display_name":"Elio Masciari","orcid":"https://orcid.org/0000-0002-1778-5321"},"institutions":[{"id":"https://openalex.org/I3005160176","display_name":"Institute for High Performance Computing and Networking","ror":"https://ror.org/04r5fge26","country_code":"IT","type":"facility","lineage":["https://openalex.org/I3005160176","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"E. Masciari","raw_affiliation_strings":["ICAR\u2014CNR, Rende, Italy","ICAR-CNR, RENDE, Italy"],"affiliations":[{"raw_affiliation_string":"ICAR\u2014CNR, Rende, Italy","institution_ids":["https://openalex.org/I3005160176"]},{"raw_affiliation_string":"ICAR-CNR, RENDE, Italy","institution_ids":["https://openalex.org/I3005160176"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002811447"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":4.9557,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.95231254,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"55","issue":"1","first_page":"1","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.998199999332428,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9959999918937683,"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/xpath","display_name":"XPath","score":0.9963955879211426},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.7288297414779663},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7287240028381348},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.726940393447876},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5640079379081726},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.5561027526855469},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.5277034640312195},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48045629262924194},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.45680397748947144},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4431421756744385},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.419921338558197},{"id":"https://openalex.org/keywords/xml-database","display_name":"XML database","score":0.325208842754364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3046756982803345},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3044561445713043},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.27750930190086365}],"concepts":[{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.9963955879211426},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.7288297414779663},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7287240028381348},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.726940393447876},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5640079379081726},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.5561027526855469},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.5277034640312195},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48045629262924194},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.45680397748947144},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4431421756744385},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.419921338558197},{"id":"https://openalex.org/C183068750","wikidata":"https://www.wikidata.org/wiki/Q357393","display_name":"XML database","level":3,"score":0.325208842754364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3046756982803345},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3044561445713043},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.27750930190086365},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1326554.1326556","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1326554.1326556","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.4172","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.4172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwinfo.deis.unical.it/~furfaro/OnTheMinimizationOfXPathQueries_VLDB03.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/W52840101","https://openalex.org/W203985604","https://openalex.org/W1515993376","https://openalex.org/W1540516609","https://openalex.org/W1544585257","https://openalex.org/W1547760610","https://openalex.org/W1573972396","https://openalex.org/W1591926286","https://openalex.org/W1969312099","https://openalex.org/W1971729277","https://openalex.org/W1979514837","https://openalex.org/W1983914494","https://openalex.org/W1984218983","https://openalex.org/W2026745535","https://openalex.org/W2029970296","https://openalex.org/W2033176822","https://openalex.org/W2051192787","https://openalex.org/W2056660085","https://openalex.org/W2068157134","https://openalex.org/W2081973669","https://openalex.org/W2117194933","https://openalex.org/W2119422073","https://openalex.org/W2124581454","https://openalex.org/W2133278242","https://openalex.org/W2134483537","https://openalex.org/W2169602474","https://openalex.org/W2616076417","https://openalex.org/W2737168042","https://openalex.org/W4254380579","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1534104849","https://openalex.org/W2136834295","https://openalex.org/W2124793519","https://openalex.org/W2097396510","https://openalex.org/W2146310406","https://openalex.org/W2068852373","https://openalex.org/W2390156225","https://openalex.org/W2146200818","https://openalex.org/W1550385823","https://openalex.org/W99069069"],"abstract_inverted_index":{"XPath":[0,44,63,70,97,192,236],"expressions":[1,71,127,237],"define":[2],"navigational":[3],"queries":[4,45,144],"on":[5,11,66],"XML":[6,12,37],"data":[7],"and":[8,35,114,150],"are":[9,140,171,177,238],"issued":[10],"documents":[13],"to":[14,21,158,185,205],"select":[15],"sets":[16],"of":[17,25,41,57,61,96,106,126,148,156,189,200,216,235],"element":[18],"nodes.":[19],"Due":[20],"the":[22,39,51,55,59,76,89,104,107,135,146,169,187,201,214,217,226,229],"wide":[23,94],"use":[24,105],"XPath,":[26],"which":[27,128,240],"is":[28,79,116,183,220,225],"embedded":[29],"into":[30],"several":[31],"languages":[32],"for":[33,92,209],"querying":[34],"manipulating":[36],"data,":[38],"problem":[40,91,219],"efficiently":[42],"answering":[43],"has":[46],"received":[47],"increasing":[48],"attention":[49],"from":[50],"research":[52],"community.":[53],"As":[54],"efficiency":[56],"computing":[58],"answer":[60],"an":[62,153],"query":[64],"depends":[65],"its":[67],"size,":[68],"replacing":[69],"with":[72,118,165],"equivalent":[73],"ones":[74,167],"having":[75,204],"smallest":[77],"size":[78],"a":[80,93,190],"crucial":[81],"issue":[82],"in":[83,134,244],"this":[84],"direction.":[85],"This":[86],"article":[87],"investigates":[88],"minimization":[90,188,218],"fragment":[95,124],"(namely":[98],"X":[99],"P":[100],"[\u2736]":[101],"),":[102],"where":[103],"most":[108],"common":[109],"operators":[110],"(child,":[111],"descendant,":[112],"wildcard":[113],"branching)":[115],"allowed":[117],"some":[119],"syntactic":[120],"restrictions.":[121],"The":[122,179],"examined":[123],"consists":[125],"have":[129],"not":[130],"been":[131],"specifically":[132],"studied":[133],"relational":[136],"setting":[137],"before:":[138],"neither":[139],"they":[141,163],"mere":[142],"conjunctive":[143],"(as":[145,168,208],"combination":[147],"\u201c//\u201d":[149],"\u201c*\u201d":[151],"enables":[152],"implicit":[154],"form":[155],"disjunction":[157],"be":[159,195,242],"expressed)":[160],"nor":[161],"do":[162],"coincide":[164],"disjunctive":[166,211],"latter":[170],"more":[172],"expressive).":[173],"Three":[174],"main":[175],"contributions":[176],"provided.":[178],"\u201cglobal":[180],"minimality\u201d":[181],"property":[182],"shown":[184],"hold:":[186],"given":[191],"expression":[193],"can":[194,241],"accomplished":[196],"by":[197],"removing":[198],"pieces":[199],"expression,":[202],"without":[203],"re-formulate":[206],"it":[207,224],"\u201cgeneral\u201d":[210],"queries).":[212],"Then,":[213],"complexity":[215],"characterized,":[221],"showing":[222],"that":[223],"same":[227],"as":[228],"containment":[230],"problem.":[231],"Finally,":[232],"specific":[233],"forms":[234],"identified,":[239],"minimized":[243],"polynomial":[245],"time.":[246]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}