[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-345491-105":59,"doc-detail-345491-en":131},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":124,"head_meta":126,"extra_data":128,"updated_unix":130},105,"en","structure-and-content-scoring-for-xml","Structure and Content Scoring for XML","","XML repositories are commonly queried using both structure and content, yet structural heterogeneity causes approximate interpretation and score-based ranking. Existing approaches inspired by tf*idf do not fully unify structural correlations with content scoring, nor do they consistently incorporate query relaxation. This work introduces new XML scoring methods combining structure and content, using twig scoring as reference and path scoring as an efficient approximation. Experiments show high precision and improved score computation time, supported by optimized data structures for ranked processing and effective top-k pruning.",{"@graph":69,"@context":123},[70,84,106],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/structure-and-content-scoring-for-xml/345491/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/structure-and-content-scoring-for-xml/345491.png","ImageObject",300,407,{"name":92,"@type":93},"Guten tag","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-07","2026-09-22",true,{"@type":102,"interactionType":103,"userInteractionCount":105},"InteractionCounter",{"@type":104},"ViewAction",12,{"@type":107,"mainEntity":108},"FAQPage",[109,115,119],{"name":110,"@type":111,"acceptedAnswer":112},"Why are XML query answers usually returned using approximate ranking scores?","Question",{"text":113,"@type":114},"XML structural heterogeneity leads queries to be interpreted approximately, with answers ranked by relevance using computed scores.","Answer",{"name":116,"@type":111,"acceptedAnswer":117},"What problem do existing XML scoring proposals fail to address?",{"text":118,"@type":114},"They do not fully capture both structural and content correlations and do not adequately combine these aspects with query relaxation in scoring.",{"name":120,"@type":111,"acceptedAnswer":121},"How does path scoring relate to twig scoring and improve efficiency?",{"text":122,"@type":114},"Path scoring approximates twig scoring by decomposing the twig into paths, loosening correlations between query nodes, computing each path score under independence, and then combining them to reduce time for ranked processing.","https://schema.org",{"og:url":83,"og:type":125,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":127,"canonical":83},"index,follow",{"doc_id":129,"site_id":62},345491,1790654673,{"code":4,"msg":5,"data":132},{"doc_id":129,"user_id":133,"nickname":92,"user_avatar":134,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":135,"file_id":136,"file_url":137,"file_type":138,"file_size":139,"view_count":105,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":105,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":41,"preview_page_count":19,"preview_urls":145},687212321768,"https://ap-avatar.wpscdn.com/avatar/a0010bdbe886d2fe77?x-image-process=image/resize,m_fixed,w_180,h_180&k=1789897067658708522","Structure and Content Scoring for XML  \nSihem Amer-Yahia AT&T Labs􀂖Research [sihem@research.att.com](sihem@research.att.com)  \nNick Koudas University of Toronto [koudas@cs.toronto.edu](koudas@cs.toronto.edu)  \nAmlie Marian Columbia University [amelie@cs.columbia.edu](amelie@cs.columbia.edu)  \nDivesh Srivastava AT&T Labs􀂖Research [divesh@research.att.com](divesh@research.att.com)  \nDavid Toman University of Waterloo [david@uwaterloo.ca](david@uwaterloo.ca)  \nAbstract  \nXML repositories are usually queried both on structure and content. Due to structural heterogeneity of XML, queries are often interpreted approximately and their answers are returned ranked by scores. Computing answer scores in XML isan active area of research that oscillates between pure content scoring such as the well-known tf*idf and taking structure into account. However, none of the existing proposals fully accounts for structure and combines it with content to score query answers. We propose novel XML scoring methods that are inspired by tf*idf and that account for both structure and content while considering query relaxations. Twig scoring, accounts for the most structure and content and is thus used as our reference method. Path scoring is an approximation that loosens correlations between query nodes hence reducing the amount of time required to manipulate scores during top-􀀀 query processing. We propose ef􀀂cient data structures in order to speedup ranked query processing. We run extensive experiments that validate our scoring methods and that show that path scoring provides very high precision while improving score computation time.  \n1 Introduction  \nXML data is now available in different forms ranging from persistent repositories such as the INEX and the US Library of Congress collections to streaming data such as stock quotes and news [16] . Such data is often queried on both structure and content [3, 6, 14, 18, 19] . Due to  \nPermission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires afee and/or special permission from the Endowment.  \nProceedings of the 31st VLDB Conference, Trondheim, Norway, 2005  \nthe structural heterogeneity of XML data, queries are usually interpreted approximately [1, 4, 5, 11, 15] and top-􀀀 answers are returned ranked by their relevance to the query. The term frequency (tf) and inverse document frequency (idf) measures, proposed in Information Retrieval (IR) [13], are widely used to score keyword queries, i.e., queries on content. However, although some recent proposals [3, 6, 11, 15] attempted to propose scoring methods that account for structure for ranking answers to XML queries, none of them fully captures both structure and content and uses query relaxation in computing answer scores.  \nIn this paper, we propose scoring methods inspired by tf*idf to capture scoring and ranking queries both on structure and content. These methods rely on query relaxation techniques applied to structural predicates, i.e., XPath axes, such as in [1] . We de􀀂ne twig scoring as our method of reference as it accounts for all structural and content correlations in the query. However, it is time and space consuming because it requires computation of the scores of all relaxed versions of a query. Therefore, we propose path scoring as an approximation of twig scoring that loosens correlations between query nodes when computing scores, thereby reducing the amount of time required to compute and access scores during top-􀀀 query processing. The key idea in path scoring is to decompose the twig query into paths, compute the score of each path assuming independence between paths, and combine these scores into an answer score. This is in the sam","cbCairg9DcfLBaxj","https://ap.wps.com/l/cbCairg9DcfLBaxj","pdf",709171,"English","# Abstract\n# Introduction\n## Background and Motivation\n## Proposed Scoring Methods\n## Efficient Top-k Processing and Data Structures\n## Contributions","[{\"question\":\"Why are XML query answers usually returned using approximate ranking scores?\",\"answer\":\"XML structural heterogeneity leads queries to be interpreted approximately, with answers ranked by relevance using computed scores.\"},{\"question\":\"What problem do existing XML scoring proposals fail to address?\",\"answer\":\"They do not fully capture both structural and content correlations and do not adequately combine these aspects with query relaxation in scoring.\"},{\"question\":\"How does path scoring relate to twig scoring and improve efficiency?\",\"answer\":\"Path scoring approximates twig scoring by decomposing the twig into paths, loosening correlations between query nodes, computing each path score under independence, and then combining them to reduce time for ranked processing.\"}]","Structure and Content Scoring for XML | PDF",1790057832,[146,150,154,158],{"page_no":8,"url":147,"width":148,"height":149},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/3c67b2306af0aa62b9fd35c07b3ffb45.webp",983,1272,{"page_no":14,"url":151,"width":152,"height":153},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/5bae09990cc76f7a7a69c13e4f63e8a8.webp",982,1270,{"page_no":81,"url":155,"width":156,"height":157},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/5bfabe75066b53ffb0419503366ad674.webp",981,1269,{"page_no":19,"url":159,"width":160,"height":161},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/c98015eb343e551e557b9b88905e9de1.webp",980,1268]