Adding Relevance to XML
Identifieur interne : 001785 ( Istex/Corpus ); précédent : 001784; suivant : 001786Adding Relevance to XML
Auteurs : Anja Theobald ; Gerhard WeikumSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
English descriptors
- Teeft :
- Arbitrary string, Automaton, Baritone saxophone, Bass saxophone, Bibliographic data, Binary operator, Boolean retrieval, Broader terms, Concatenated path, Current leaf, Data graph, Database, Dewey redman, Document collection, Element attributes, Element contents, Element name, Element names, Element variables, Elementary condition, Elementary conditions, Elementary similarity comparisons, Entire paths, Example scenario, Finite state automata, Finite state automaton, First case, First state, Future work, Greedy traversal, Information retrieval, Intermedia, Intermedia yields, Irrelevant documents, Keith jarrett, Kleene star, Large databases, Logical conjunction, Native intermedia, Node, Oracle, Oracle database, Oracle intermedia, Oracle8i intermedia, Other hand, Outgoing edges, Path concatenation, Path expression, Path expressions, Preliminary experiments, Priority queue, Production rules, Prototype, Prototype implementation, Query, Query graph, Query language, Query languages, Query representation, Reed instruments, Regular path expressions, Relevance, Relevance probabilities, Relevance probability, Result graph, Retrieval, Roscoe mitchell, Saxophone, Search algorithm, Search arguments, Search conditions, Search engine, Search engines, Search language, Search patterns, Search results, Second case, Semantic similarity, Semistructured data, Sigmod, Sigmod record, Similarity, Similarity comparisons, Similarity conditions, Similarity operator, Similarity score, Similarity scores, Similarity search, Soprano saxophone, Subgraph, Subgraphs, Tenor saxophone, Terminal symbols, Text data, Text retrieval system, Text search engine, Theobald, Thesaurus, Thesaurus lookup, Traversal, Unary operator, Weikum.
Abstract
Abstract: XML query languages proposed so far are limited to Boolean retrieval in the sense that query results are sets of qualifying XML elements or subgraphs. This search paradigm is intriguing for “closed” collections of XML documents such as e-commerce catalogs, but we argue that it is inadequate for searching the Web where we would prefer ranked lists of results based on relevance estimation. IR-style Web search engines, on the other hand, are incapable of exploiting the additional information made explicit in the structure, element names, and attributes of XML documents. In this paper we present a compact query language, coined XXL for “flexible XML search language”, that reconciles both search paradigms by combining XML graph pattern matching with relevance estimations and producing ranked lists of XML subgraphs as search results. The paper describes the language design, sketches implementation issues, and presents preliminary experimental results.
Url:
DOI: 10.1007/3-540-45271-0_7
Links to Exploration step
ISTEX:E572A0466DEB0CCADDDDE876216E5668A52FA69FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Adding Relevance to XML</title><author><name sortKey="Theobald, Anja" sort="Theobald, Anja" uniqKey="Theobald A" first="Anja" last="Theobald">Anja Theobald</name><affiliation><mods:affiliation>Department of Computer Science, University of the Saarland, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: theobald@cs.uni-sb.de</mods:affiliation></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation><mods:affiliation>Department of Computer Science, University of the Saarland, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: weikum@cs.uni-sb.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E572A0466DEB0CCADDDDE876216E5668A52FA69F</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-45271-0_7</idno><idno type="url">https://api.istex.fr/document/E572A0466DEB0CCADDDDE876216E5668A52FA69F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001785</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001785</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Adding Relevance to XML</title><author><name sortKey="Theobald, Anja" sort="Theobald, Anja" uniqKey="Theobald A" first="Anja" last="Theobald">Anja Theobald</name><affiliation><mods:affiliation>Department of Computer Science, University of the Saarland, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: theobald@cs.uni-sb.de</mods:affiliation></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation><mods:affiliation>Department of Computer Science, University of the Saarland, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: weikum@cs.uni-sb.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2001</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Arbitrary string</term><term>Automaton</term><term>Baritone saxophone</term><term>Bass saxophone</term><term>Bibliographic data</term><term>Binary operator</term><term>Boolean retrieval</term><term>Broader terms</term><term>Concatenated path</term><term>Current leaf</term><term>Data graph</term><term>Database</term><term>Dewey redman</term><term>Document collection</term><term>Element attributes</term><term>Element contents</term><term>Element name</term><term>Element names</term><term>Element variables</term><term>Elementary condition</term><term>Elementary conditions</term><term>Elementary similarity comparisons</term><term>Entire paths</term><term>Example scenario</term><term>Finite state automata</term><term>Finite state automaton</term><term>First case</term><term>First state</term><term>Future work</term><term>Greedy traversal</term><term>Information retrieval</term><term>Intermedia</term><term>Intermedia yields</term><term>Irrelevant documents</term><term>Keith jarrett</term><term>Kleene star</term><term>Large databases</term><term>Logical conjunction</term><term>Native intermedia</term><term>Node</term><term>Oracle</term><term>Oracle database</term><term>Oracle intermedia</term><term>Oracle8i intermedia</term><term>Other hand</term><term>Outgoing edges</term><term>Path concatenation</term><term>Path expression</term><term>Path expressions</term><term>Preliminary experiments</term><term>Priority queue</term><term>Production rules</term><term>Prototype</term><term>Prototype implementation</term><term>Query</term><term>Query graph</term><term>Query language</term><term>Query languages</term><term>Query representation</term><term>Reed instruments</term><term>Regular path expressions</term><term>Relevance</term><term>Relevance probabilities</term><term>Relevance probability</term><term>Result graph</term><term>Retrieval</term><term>Roscoe mitchell</term><term>Saxophone</term><term>Search algorithm</term><term>Search arguments</term><term>Search conditions</term><term>Search engine</term><term>Search engines</term><term>Search language</term><term>Search patterns</term><term>Search results</term><term>Second case</term><term>Semantic similarity</term><term>Semistructured data</term><term>Sigmod</term><term>Sigmod record</term><term>Similarity</term><term>Similarity comparisons</term><term>Similarity conditions</term><term>Similarity operator</term><term>Similarity score</term><term>Similarity scores</term><term>Similarity search</term><term>Soprano saxophone</term><term>Subgraph</term><term>Subgraphs</term><term>Tenor saxophone</term><term>Terminal symbols</term><term>Text data</term><term>Text retrieval system</term><term>Text search engine</term><term>Theobald</term><term>Thesaurus</term><term>Thesaurus lookup</term><term>Traversal</term><term>Unary operator</term><term>Weikum</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: XML query languages proposed so far are limited to Boolean retrieval in the sense that query results are sets of qualifying XML elements or subgraphs. This search paradigm is intriguing for “closed” collections of XML documents such as e-commerce catalogs, but we argue that it is inadequate for searching the Web where we would prefer ranked lists of results based on relevance estimation. IR-style Web search engines, on the other hand, are incapable of exploiting the additional information made explicit in the structure, element names, and attributes of XML documents. In this paper we present a compact query language, coined XXL for “flexible XML search language”, that reconciles both search paradigms by combining XML graph pattern matching with relevance estimations and producing ranked lists of XML subgraphs as search results. The paper describes the language design, sketches implementation issues, and presents preliminary experimental results.</div></front></TEI><istex><corpusName>springer</corpusName><keywords><teeft><json:string>query</json:string><json:string>intermedia</json:string><json:string>node</json:string><json:string>elementary conditions</json:string><json:string>data graph</json:string><json:string>theobald</json:string><json:string>relevance probability</json:string><json:string>subgraphs</json:string><json:string>search engine</json:string><json:string>result graph</json:string><json:string>subgraph</json:string><json:string>weikum</json:string><json:string>retrieval</json:string><json:string>bass saxophone</json:string><json:string>database</json:string><json:string>relevance probabilities</json:string><json:string>query languages</json:string><json:string>sigmod</json:string><json:string>path expressions</json:string><json:string>traversal</json:string><json:string>search language</json:string><json:string>element names</json:string><json:string>automaton</json:string><json:string>elementary condition</json:string><json:string>path expression</json:string><json:string>keith jarrett</json:string><json:string>oracle8i intermedia</json:string><json:string>native intermedia</json:string><json:string>search results</json:string><json:string>roscoe mitchell</json:string><json:string>thesaurus</json:string><json:string>similarity score</json:string><json:string>similarity conditions</json:string><json:string>other hand</json:string><json:string>similarity scores</json:string><json:string>baritone saxophone</json:string><json:string>element variables</json:string><json:string>text search engine</json:string><json:string>prototype implementation</json:string><json:string>soprano saxophone</json:string><json:string>semantic similarity</json:string><json:string>dewey redman</json:string><json:string>intermedia yields</json:string><json:string>similarity operator</json:string><json:string>future work</json:string><json:string>search conditions</json:string><json:string>similarity comparisons</json:string><json:string>kleene star</json:string><json:string>regular path expressions</json:string><json:string>example scenario</json:string><json:string>query language</json:string><json:string>query graph</json:string><json:string>oracle</json:string><json:string>saxophone</json:string><json:string>relevance</json:string><json:string>similarity</json:string><json:string>unary operator</json:string><json:string>text data</json:string><json:string>document collection</json:string><json:string>information retrieval</json:string><json:string>terminal symbols</json:string><json:string>search engines</json:string><json:string>logical conjunction</json:string><json:string>tenor saxophone</json:string><json:string>concatenated path</json:string><json:string>first case</json:string><json:string>second case</json:string><json:string>text retrieval system</json:string><json:string>elementary similarity comparisons</json:string><json:string>boolean retrieval</json:string><json:string>production rules</json:string><json:string>oracle database</json:string><json:string>similarity search</json:string><json:string>thesaurus lookup</json:string><json:string>broader terms</json:string><json:string>search algorithm</json:string><json:string>entire paths</json:string><json:string>element contents</json:string><json:string>finite state automaton</json:string><json:string>finite state automata</json:string><json:string>query representation</json:string><json:string>first state</json:string><json:string>element attributes</json:string><json:string>path concatenation</json:string><json:string>outgoing edges</json:string><json:string>arbitrary string</json:string><json:string>oracle intermedia</json:string><json:string>current leaf</json:string><json:string>priority queue</json:string><json:string>greedy traversal</json:string><json:string>preliminary experiments</json:string><json:string>bibliographic data</json:string><json:string>search patterns</json:string><json:string>sigmod record</json:string><json:string>search arguments</json:string><json:string>reed instruments</json:string><json:string>binary operator</json:string><json:string>irrelevant documents</json:string><json:string>semistructured data</json:string><json:string>large databases</json:string><json:string>element name</json:string><json:string>prototype</json:string></teeft></keywords><author><json:item><name>Anja Theobald</name><affiliations><json:string>Department of Computer Science, University of the Saarland, Germany</json:string><json:string>E-mail: theobald@cs.uni-sb.de</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Department of Computer Science, University of the Saarland, Germany</json:string><json:string>E-mail: weikum@cs.uni-sb.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: XML query languages proposed so far are limited to Boolean retrieval in the sense that query results are sets of qualifying XML elements or subgraphs. This search paradigm is intriguing for “closed” collections of XML documents such as e-commerce catalogs, but we argue that it is inadequate for searching the Web where we would prefer ranked lists of results based on relevance estimation. IR-style Web search engines, on the other hand, are incapable of exploiting the additional information made explicit in the structure, element names, and attributes of XML documents. In this paper we present a compact query language, coined XXL for “flexible XML search language”, that reconciles both search paradigms by combining XML graph pattern matching with relevance estimations and producing ranked lists of XML subgraphs as search results. The paper describes the language design, sketches implementation issues, and presents preliminary experimental results.</abstract><qualityIndicators><score>6.74</score><pdfWordCount>6622</pdfWordCount><pdfCharCount>40394</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>20</pdfPageCount><pdfPageSize>648 x 864 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>145</abstractWordCount><abstractCharCount>969</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Adding Relevance to XML</title><chapterId><json:string>7</json:string><json:string>Chap7</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2001</copyrightDate><issn><json:string>0302-9743</json:string></issn></serie><host><title>The World Wide Web and Databases</title><language><json:string>unknown</json:string></language><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-45271-0</json:string></doi><issn><json:string>0302-9743</json:string></issn><eisbn><json:string>978-3-540-45271-3</json:string></eisbn><bookId><json:string>3-540-45271-0</json:string></bookId><isbn><json:string>978-3-540-41826-9</json:string></isbn><volume>1997</volume><pages><first>105</first><last>124</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Universität Münster, Wirtschaftsinformatik Steinfurter Str.109, 48149, Münster, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Dan Suciu</name><affiliations><json:string>Utrecht University, The Netherlands</json:string><json:string>E-mail: suciu@cs.washington.edu</json:string></affiliations></json:item><json:item><name>Gottfried Vossen</name><affiliations><json:string>Computer Science and Engineering, University ofWashington, WA 98195-2350, Seattle, USA</json:string><json:string>E-mail: vossen@helios.uni-muenster.de</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Business Information Systems</value></json:item></subject></host><categories><inist><json:string>sciences humaines et sociales</json:string></inist></categories><publicationDate>2001</publicationDate><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-45271-0_7</json:string></doi><id>E572A0466DEB0CCADDDDE876216E5668A52FA69F</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/E572A0466DEB0CCADDDDE876216E5668A52FA69F/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/E572A0466DEB0CCADDDDE876216E5668A52FA69F/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/E572A0466DEB0CCADDDDE876216E5668A52FA69F/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Adding Relevance to XML</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2001</p></availability><date>2001</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Adding Relevance to XML</title><author xml:id="author-0000"><persName><forename type="first">Anja</forename><surname>Theobald</surname></persName><email>theobald@cs.uni-sb.de</email><affiliation>Department of Computer Science, University of the Saarland, Germany</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><email>weikum@cs.uni-sb.de</email><affiliation>Department of Computer Science, University of the Saarland, Germany</affiliation></author><idno type="istex">E572A0466DEB0CCADDDDE876216E5668A52FA69F</idno><idno type="DOI">10.1007/3-540-45271-0_7</idno><idno type="ChapterID">7</idno><idno type="ChapterID">Chap7</idno></analytic><monogr><title level="m">The World Wide Web and Databases</title><title level="m" type="sub">Third International Workshop WebDB 2000 Dallas, TX, USA, May 18–19,2000 Selected Papers</title><idno type="DOI">10.1007/3-540-45271-0</idno><idno type="pISBN">978-3-540-41826-9</idno><idno type="eISBN">978-3-540-45271-3</idno><idno type="pISSN">0302-9743</idno><idno type="book-title-ID">66977</idno><idno type="book-ID">3-540-45271-0</idno><idno type="book-chapter-count">17</idno><idno type="book-volume-number">1997</idno><idno type="book-sequence-number">1997</idno><idno type="PartChapterCount">3</idno><editor xml:id="book-author-0000"><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation>Universität Münster, Wirtschaftsinformatik Steinfurter Str.109, 48149, Münster, Germany</affiliation></editor><editor xml:id="book-author-0001"><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation>Karlsruhe University, Germany</affiliation></editor><editor xml:id="book-author-0002"><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName><affiliation>Cornell University, NY, USA</affiliation></editor><editor xml:id="book-author-0003"><persName><forename type="first">Dan</forename><surname>Suciu</surname></persName><email>suciu@cs.washington.edu</email><affiliation>Utrecht University, The Netherlands</affiliation></editor><editor xml:id="book-author-0004"><persName><forename type="first">Gottfried</forename><surname>Vossen</surname></persName><email>vossen@helios.uni-muenster.de</email><affiliation>Computer Science and Engineering, University ofWashington, WA 98195-2350, Seattle, USA</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2001-06-22"></date><biblScope unit="volume">1997</biblScope><biblScope unit="page" from="105">105</biblScope><biblScope unit="page" to="124">124</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><biblScope><date>2001</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="series-Id">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2001</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: XML query languages proposed so far are limited to Boolean retrieval in the sense that query results are sets of qualifying XML elements or subgraphs. This search paradigm is intriguing for “closed” collections of XML documents such as e-commerce catalogs, but we argue that it is inadequate for searching the Web where we would prefer ranked lists of results based on relevance estimation. IR-style Web search engines, on the other hand, are incapable of exploiting the additional information made explicit in the structure, element names, and attributes of XML documents. In this paper we present a compact query language, coined XXL for “flexible XML search language”, that reconciles both search paradigms by combining XML graph pattern matching with relevance estimations and producing ranked lists of XML subgraphs as search results. The paper describes the language design, sketches implementation issues, and presents preliminary experimental results.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><item><term>Computer Science</term></item><label>I18040</label><item><term>Information Systems Applications (incl.Internet)</term></item><label>I18032</label><item><term>Information Storage and Retrieval</term></item><label>I18024</label><item><term>Database Management</term></item><label>I13022</label><item><term>Computer Communication Networks</term></item><label>W26007</label><item><term>Business Information Systems</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2001-06-22">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/E572A0466DEB0CCADDDDE876216E5668A52FA69F/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><Book Language="En"><BookInfo BookProductType="Proceedings" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45271-0</BookID><BookTitle>The World Wide Web and Databases</BookTitle><BookSubTitle>Third International Workshop WebDB 2000 Dallas, TX, USA, May 18–19,2000 Selected Papers</BookSubTitle><BookVolumeNumber>1997</BookVolumeNumber><BookSequenceNumber>1997</BookSequenceNumber><BookDOI>10.1007/3-540-45271-0</BookDOI><BookTitleID>66977</BookTitleID><BookPrintISBN>978-3-540-41826-9</BookPrintISBN><BookElectronicISBN>978-3-540-45271-3</BookElectronicISBN><BookChapterCount>17</BookChapterCount><BookHistory><OnlineDate><Year>2001</Year><Month>6</Month><Day>22</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I18040" Priority="1" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I18032" Priority="2" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I18024" Priority="3" Type="Secondary">Database Management</BookSubject><BookSubject Code="I13022" Priority="4" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="W26007" Priority="5" Type="Secondary">Business Information Systems</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Dan</GivenName><FamilyName>Suciu</FamilyName></EditorName><Contact><Email>suciu@cs.washington.edu</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Gottfried</GivenName><FamilyName>Vossen</FamilyName></EditorName><Contact><Email>vossen@helios.uni-muenster.de</Email></Contact></Editor><Affiliation ID="Aff1"><OrgName>Universität Münster</OrgName><OrgAddress><Street>Wirtschaftsinformatik Steinfurter Str.109</Street><Postcode>48149</Postcode><City>Münster</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Cornell University</OrgName><OrgAddress><City>NY</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgDivision>Computer Science and Engineering</OrgDivision><OrgName>University ofWashington</OrgName><OrgAddress><Postcode>WA 98195-2350</Postcode><City>Seattle</City><Country>USA</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part4"><PartInfo TocLevels="0"><PartID>4</PartID><PartSequenceNumber>4</PartSequenceNumber><PartTitle>Querying XML</PartTitle><PartChapterCount>3</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookID>3-540-45271-0</BookID><BookTitle>The World Wide Web and Databases</BookTitle></PartContext></PartInfo><Chapter ID="Chap7" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>7</ChapterID><ChapterDOI>10.1007/3-540-45271-0_7</ChapterDOI><ChapterSequenceNumber>7</ChapterSequenceNumber><ChapterTitle Language="En">Adding Relevance to XML</ChapterTitle><ChapterFirstPage>105</ChapterFirstPage><ChapterLastPage>124</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2001</Year><Month>6</Month><Day>21</Day></RegistrationDate><OnlineDate><Year>2001</Year><Month>6</Month><Day>22</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>4</PartID><BookID>3-540-45271-0</BookID><BookTitle>The World Wide Web and Databases</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Anja</GivenName><FamilyName>Theobald</FamilyName></AuthorName><Contact><Email>theobald@cs.uni-sb.de</Email></Contact></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></AuthorName><Contact><Email>weikum@cs.uni-sb.de</Email><URL>http://www-dbs.cs.uni-sb.de</URL></Contact></Author><Affiliation ID="Aff6"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of the Saarland</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>XML query languages proposed so far are limited to Boolean retrieval in the sense that query results are sets of qualifying XML elements or subgraphs. This search paradigm is intriguing for “closed” collections of XML documents such as e-commerce catalogs, but we argue that it is inadequate for searching the Web where we would prefer ranked lists of results based on relevance estimation. IR-style Web search engines, on the other hand, are incapable of exploiting the additional information made explicit in the structure, element names, and attributes of XML documents. In this paper we present a compact query language, coined XXL for “flexible XML search language”, that reconciles both search paradigms by combining XML graph pattern matching with relevance estimations and producing ranked lists of XML subgraphs as search results. The paper describes the language design, sketches implementation issues, and presents preliminary experimental results.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Adding Relevance to XML</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Adding Relevance to XML</title></titleInfo><name type="personal"><namePart type="given">Anja</namePart><namePart type="family">Theobald</namePart><affiliation>Department of Computer Science, University of the Saarland, Germany</affiliation><affiliation>E-mail: theobald@cs.uni-sb.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Department of Computer Science, University of the Saarland, Germany</affiliation><affiliation>E-mail: weikum@cs.uni-sb.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2001-06-22</dateIssued><copyrightDate encoding="w3cdtf">2001</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: XML query languages proposed so far are limited to Boolean retrieval in the sense that query results are sets of qualifying XML elements or subgraphs. This search paradigm is intriguing for “closed” collections of XML documents such as e-commerce catalogs, but we argue that it is inadequate for searching the Web where we would prefer ranked lists of results based on relevance estimation. IR-style Web search engines, on the other hand, are incapable of exploiting the additional information made explicit in the structure, element names, and attributes of XML documents. In this paper we present a compact query language, coined XXL for “flexible XML search language”, that reconciles both search paradigms by combining XML graph pattern matching with relevance estimations and producing ranked lists of XML subgraphs as search results. The paper describes the language design, sketches implementation issues, and presents preliminary experimental results.</abstract><relatedItem type="host"><titleInfo><title>The World Wide Web and Databases</title><subTitle>Third International Workshop WebDB 2000 Dallas, TX, USA, May 18–19,2000 Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Universität Münster, Wirtschaftsinformatik Steinfurter Str.109, 48149, Münster, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Dan</namePart><namePart type="family">Suciu</namePart><affiliation>Utrecht University, The Netherlands</affiliation><affiliation>E-mail: suciu@cs.washington.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gottfried</namePart><namePart type="family">Vossen</namePart><affiliation>Computer Science and Engineering, University ofWashington, WA 98195-2350, Seattle, USA</affiliation><affiliation>E-mail: vossen@helios.uni-muenster.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="W26007">Business Information Systems</topic></subject><identifier type="DOI">10.1007/3-540-45271-0</identifier><identifier type="ISBN">978-3-540-41826-9</identifier><identifier type="eISBN">978-3-540-45271-3</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">66977</identifier><identifier type="BookID">3-540-45271-0</identifier><identifier type="BookChapterCount">17</identifier><identifier type="BookVolumeNumber">1997</identifier><identifier type="BookSequenceNumber">1997</identifier><identifier type="PartChapterCount">3</identifier><part><date>2001</date><detail type="part"><title>Querying XML</title></detail><detail type="volume"><number>1997</number><caption>vol.</caption></detail><extent unit="pages"><start>105</start><end>124</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><identifier type="istex">E572A0466DEB0CCADDDDE876216E5668A52FA69F</identifier><identifier type="DOI">10.1007/3-540-45271-0_7</identifier><identifier type="ChapterID">7</identifier><identifier type="ChapterID">Chap7</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001785 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001785 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:E572A0466DEB0CCADDDDE876216E5668A52FA69F
|texte= Adding Relevance to XML
}}
| This area was generated with Dilib version V0.6.33. |  |