{"id":"https://openalex.org/W2081160903","doi":"https://doi.org/10.1145/1559795.1559805","title":"XPath evaluation in linear time with polynomial combined complexity","display_name":"XPath evaluation in linear time with polynomial combined complexity","publication_year":2009,"publication_date":"2009-06-29","ids":{"openalex":"https://openalex.org/W2081160903","doi":"https://doi.org/10.1145/1559795.1559805","mag":"2081160903"},"language":"en","primary_location":{"id":"doi:10.1145/1559795.1559805","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559795.1559805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5085631393","display_name":"Pawe\u0142 Parys","orcid":"https://orcid.org/0000-0001-7247-1408"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Pawel Parys","raw_affiliation_strings":["Warsaw University, Warsaw, Poland","(Warsaw University, Warsaw, Poland)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Warsaw University, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"(Warsaw University, Warsaw, Poland)","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085631393"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"55","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/unary-operation","display_name":"Unary operation","score":0.9327853322029114},{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.8542188405990601},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.8365234136581421},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7446340322494507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.597538411617279},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5637708306312561},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5597246289253235},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.4265674650669098},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42481228709220886},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4213695228099823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39385461807250977},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36841702461242676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33044928312301636},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.25780048966407776},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.22727283835411072},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.1616418957710266},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.1437641680240631},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.13010632991790771},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.11780890822410583}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.9327853322029114},{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.8542188405990601},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.8365234136581421},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7446340322494507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.597538411617279},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5637708306312561},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5597246289253235},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.4265674650669098},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42481228709220886},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4213695228099823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39385461807250977},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36841702461242676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33044928312301636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25780048966407776},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.22727283835411072},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.1616418957710266},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.1437641680240631},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.13010632991790771},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.11780890822410583},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C55348073","wikidata":"https://www.wikidata.org/wiki/Q595926","display_name":"XML validation","level":3,"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.1145/1559795.1559805","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559795.1559805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.170.7263","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.7263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fox7.eu/wp-content/uploads/newXPath.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":10,"referenced_works":["https://openalex.org/W2011999472","https://openalex.org/W2040509999","https://openalex.org/W2070386554","https://openalex.org/W2130564474","https://openalex.org/W2134826526","https://openalex.org/W2137120608","https://openalex.org/W2148154295","https://openalex.org/W2492526546","https://openalex.org/W2611888112","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2040509999","https://openalex.org/W2006459955","https://openalex.org/W2955368753","https://openalex.org/W3125756434","https://openalex.org/W2184296057","https://openalex.org/W203907944","https://openalex.org/W4386051213","https://openalex.org/W2096359267","https://openalex.org/W3164787465","https://openalex.org/W2992414350"],"abstract_inverted_index":{"We":[0,15],"consider":[1],"a":[2],"fragment":[3,56],"of":[4,27,48],"XPath":[5],"1.0,":[6],"where":[7],"attribute":[8],"and":[9,43],"text":[10],"values":[11],"may":[12],"be":[13,34],"compared.":[14],"show":[16],"that":[17,29],"for":[18,54],"any":[19],"unary":[20],"query":[21,32,67],"in":[22,36,39,45,65],"this":[23,55],"fragment,":[24],"the":[25,31,40,46,49,66],"set":[26],"nodes":[28],"satisfy":[30],"can":[33],"calculated":[35],"time":[37],"linear":[38,59],"document":[41],"size":[42,47],"polynomial":[44],"query.":[50],"The":[51],"previous":[52],"algorithm":[53],"also":[57],"had":[58],"data":[60],"complexity":[61,64],"but":[62],"exponential":[63],"size.":[68]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}