XML retrieval: Difference between revisions

Revision as of 13:34, 11 December 2012

Latest revision as of 04:38, 26 May 2025

(43 intermediate revisions by 28 users not shown)

Line 1:

{{Short description|Content-based retrieval of XML documents}}

{{Multiple issues| COI = February 2009

'''XML retrieval''', or '''XML information retrieval''', is the content-based retrieval of documents structured with [[XML]] (eXtensible Markup Language). As such it is used for computing [[Relevance (information retrieval)|relevance]] of XML documents.<ref>{{Cite web |last=Lalmas |first=Mounia |date=2009 |title=XML Retrieval |url=https://fi.wikipedia.org/wiki/XML-tiedonhaku#L%C3%A4hteet |publisher=Morgan & Claypool}}</ref>

| expert = Computer science

|date=February 2009}}

'''XML Retrieval''', or XML Information Retrieval,<ref>{{cite journal |

author=Luk, R.W.P.| coauthors= H.V. Leong, T.S. Dillon, Alvin T. S. Chan, W. B. Croft and J. Allan | year=2002|

title=A survey in indexing and searching XML documents | journal = Journal of the American Society for Information Science and Technology | volume = 53 | issue =6 | pages = 415–437| doi = 10.1002/asi.10056}}</ref> is the content-based retrieval of documents structured with [[XML]] (eXtensible Markup Language). As such it is used for computing [[Relevance (information retrieval)|relevance]] of XML documents.<ref>{{Cite web|url=ftp://ftp.tm.informatik.uni-frankfurt.de/pub/papers/ir/An%20Architecture%20for%20XML%20Information%20Retrieval%20in%20a%20Peer-to-Peer%20Environment_2007.pdf|title=An Architecture for XML Information Retrieval in a Peer-to-Peer Environment|last=Winter|first=Judith|coauthors=Drobnik, Oswald|date=November 9, 2007|publisher=ACM|accessdate=2009-02-10}}</ref>

==Queries==

Line 14 ⟶ 9:

==Ranking==

Ranking in XML-Retrieval can incorporate both content relevance and structural similarity, which is the resemblance between the structure given in the query and the structure of the document. Also, the retrieval units resulting from an XML query may not always be entire documents, but can be any deeply nested XML elements, i.e. dynamic documents. The aim is to find the smallest retrieval unit that is highly relevant. Relevance can be defined according to the notion of specificity, which is the extent to which a retrieval unit focuses on the topic of request.<ref name="INEX2006">{{Cite web|url=http://www.cs.otago.ac.nz/homepages/andrew/2006-10.pdf |title=Overview of INEX 2006 |last=Malik |first=Saadia |coauthorsauthor2=Trotman, Andrew; |author3=Lalmas, Mounia; |author4=Fuhr, Norbert |year=2007 |work=Proceedings of the Fifth Workshop of the INitiative for the Evaluation of XML Retrieval |accessdateaccess-date=2009-02-10 |archive-url=https://web.archive.org/web/20081016101202/http://www.cs.otago.ac.nz/homepages/andrew/2006-10.pdf |archive-date=October 16, 2008 }}</ref>

==Existing XML search engines==

An overview of two potential approaches is available.<ref>{{Cite webjournal|url=http://www.sigmod.org/record/issues/0612/p16-article-yahia.pdf|title=XML Search: Languages, INEX and Scoring|last=Amer-Yahia|first=Sihem|coauthorsauthor2=Lalmas, Mounia |year=2006|publisherjournal=SIGMOD Rec. Vol. |volume=35, No. |issue=4|accessdateaccess-date=2009-02-10|doi=10.1145/1228268.1228271|s2cid=17300151}} {{Dead link|date=October 2010|bot=H3llBot}}</ref><ref>{{Cite webCiteSeerX |urlciteseerx =http://66.102.1.104/scholar?q=cache:R6ZYFNoTRrUJ:citeseerx.ist.psu.edu/viewdoc/download%3Fdoi%3D10 10.1.1.109.5986%26rep%3Drep1%26type%3Dpdf|title=XML Retrieval: A Survey|last=Pal|first=Sukomal|date=June 30, 2006|publisher=Technical Report, CVPR|accessdate=2009-02-10}}</ref> The INitiative for the Evaluation of XML-Retrieval (''INEX'') was founded in 2002 and provides a platform for evaluating such [[algorithm]]s.<ref name="INEX2006" /> Three different areas influence XML-Retrieval:<ref name="INEX2002">{{Cite web|url=http://www.is.informatik.uni-duisburg.de/bib/pdf/ir/Fuhr_etal:02a.pdf |title=INEX: Initiative for the Evaluation of XML Retrieval |last=Fuhr |first=Norbert |coauthorsauthor2=Gövert, N.; |author3=Kazai, Gabriella; |author4=Lalmas, Mounia |year=2003 |work=Proceedings of the First INEX Workshop, Dagstuhl, Germany, 2002 |publisher=ERCIM Workshop Proceedings, France |accessdateaccess-date=2009-02-10 |archive-url=https://web.archive.org/web/20081121135758/http://www.is.informatik.uni-duisburg.de/bib/pdf/ir/Fuhr_etal:02a.pdf |archive-date=November 21, 2008 }}</ref>

===Traditional XML query languages===

[[Query language]]s such as the [[W3C]] standard [[XQuery]]<ref>{{Cite web|url=http://www.w3.org/TR/2007/REC-xquery-20070123/|title=XQuery 1.0: An XML Query Language|last=Boag|first=Scott|coauthorsauthor2=Chamberlin, Don; |author3=Fernández, Mary F.; |author4=Florescu, Daniela; |author5=Robie, Jonathan; |author6= Siméon, Jérôme |date=23 January 2007|work=W3C Recommendation|publisher=World Wide Web Consortium|accessdateaccess-date=2009-02-10}}</ref> supply complex queries, but only look for exact matches. Therefore, they need to be extended to allow for vague search with relevance computing. Most XML-centered approaches imply a quite exact knowledge of the documents' [[Database schema|schemas]].<ref name="Schlieder2002">{{Cite journal|url=http://google.com/search?q=cache:KHBo9BRjO7QJ:www.cis.uni-muenchen.de/people/Meuss/Pub/JASIS02.ps.gz |title=Querying and Ranking XML Documents |last=Schlieder |first=Torsten |coauthorsauthor2=Meuss, Holger |year=2002 |workjournal= Journal of the American Society for Information Science and Technology, Vol. |volume=53, No. |issue=6 |accessdatepages=489–503 |access-date=2009-02-10 |archive-url=https://web.archive.org/web/20070610002349/http://www.cis.uni-muenchen.de/people/Meuss/Pub/JASIS02.ps.gz |archive-date=June 10, 2007 |doi=10.1002/asi.10060 |url-access=subscription }}</ref>

===Databases===

Line 26 ⟶ 21:

===Information retrieval===

Classic information retrieval models such as the [[vector space model]] provide relevance ranking, but do not include document structure; only flat queries are supported. Also, they apply a static document concept, so retrieval units usually are entire documents.<ref name="Schlieder2002"/> They can be extended to consider structural information and dynamic document retrieval. Examples for approaches extending the vector space models are available: they use document [[subtree]]s (index terms plus structure) as dimensions of the vector space.<ref>{{Cite web|url=http://www.cobase.cs.ucla.edu/tech-docs/sliu/SIGIR04.pdf|title=Configurable Indexing and Ranking for XML Information Retrieval|last=Liu|first=Shaorong|coauthorsauthor2=Zou, Qinghua; |author3=Chu, Wesley W. |year=2004|work=SIGIR'04|publisher=ACM|accessdateaccess-date=2009-02-10}}</ref>

== Data-centric XML datasets ==

For data-centric XML datasets, the unique and distinct keyword search method, namely, XDMA<ref>{{Cite journal|last1=Selvaganesan|first1=S.|last2=Haw|first2=Su-Cheng|last3=Soon|first3=Lay-Ki|title=XDMA: A Dual Indexing and Mutual Summation Based Keyword Search Algorithm for XML Databases|journal=International Journal of Software Engineering and Knowledge Engineering|language=en-US|volume=24|issue=4|pages=591–615|doi=10.1142/s0218194014500223|year=2014}}</ref> for XML databases is designed and developed based on dual indexing and mutual summation.

==See also==

Line 37 ⟶ 35:

{{DEFAULTSORT:Xml-Retrieval}}

[[Category:XML]]

[[Category:Information retrieval genres]]

[[de:XML-Retrieval]]

[[fi:XML-tiedonhaku]]