Dagstuhl Seminar Proceedings, Volume 8111



Publication Details

  • published at: 2008-06-24
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
08111 Abstracts Collection – Ranked XML Querying

Authors: Sihem Amer-Yahia, Divesh Srivastava, and Gerhard Weikum


Abstract
From 09.03. to 14.03.08, the Dagstuhl Seminar 08111 ``Ranked XML Querying'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Sihem Amer-Yahia, Divesh Srivastava, and Gerhard Weikum. 08111 Abstracts Collection – Ranked XML Querying. In Ranked XML Querying. Dagstuhl Seminar Proceedings, Volume 8111, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{ameryahia_et_al:DagSemProc.08111.1,
  author =	{Amer-Yahia, Sihem and Srivastava, Divesh and Weikum, Gerhard},
  title =	{{08111 Abstracts Collection – Ranked XML Querying}},
  booktitle =	{Ranked XML Querying},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8111},
  editor =	{Sihem Amer-Yahia and Divesh Srivastava and Gerhard Weikum},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08111.1},
  URN =		{urn:nbn:de:0030-drops-15361},
  doi =		{10.4230/DagSemProc.08111.1},
  annote =	{Keywords: Scoring methods for XML, Ranking approximate XML answers, Top-K query processing, Querying structured and unstructured data, XML Full-Text Querying, Querying heterogeneous XML, Extracting structure from unstructured data, Text mining, XML data integration}
}
Document
08111 Report – Ranked XML Querying

Authors: Sihem Amer-Yahia, Djoerd Hiemstra, Thomas Roelleke, Divesh Srivastava, and Gerhard Weikum


Abstract
This paper is based on a five-day workshop on "Ranked XML Querying" that took place in Schloss Dagstuhl in Germany in March 2008 and was attended by 27 people from three different research communities: database systems (DB), information retrieval (IR), and Web. The seminar title was interpreted in an IR-style "andish" sense (it covered also subsets of {Ranking, XML, Querying}, with larger sets being favored) rather than the DB-style strictly conjunctive manner. So in essence, the seminar really addressed the integration of DB and IR technologies with Web 2.0 being an important target area.

Cite as

Sihem Amer-Yahia, Djoerd Hiemstra, Thomas Roelleke, Divesh Srivastava, and Gerhard Weikum. 08111 Report – Ranked XML Querying. In Ranked XML Querying. Dagstuhl Seminar Proceedings, Volume 8111, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{ameryahia_et_al:DagSemProc.08111.2,
  author =	{Amer-Yahia, Sihem and Hiemstra, Djoerd and Roelleke, Thomas and Srivastava, Divesh and Weikum, Gerhard},
  title =	{{08111 Report – Ranked XML Querying}},
  booktitle =	{Ranked XML Querying},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8111},
  editor =	{Sihem Amer-Yahia and Divesh Srivastava and Gerhard Weikum},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08111.2},
  URN =		{urn:nbn:de:0030-drops-15354},
  doi =		{10.4230/DagSemProc.08111.2},
  annote =	{Keywords: Scoring methods for XML, Ranking approximate XML answers, Top-K query processing, Querying structured and unstructured data, XML Full-Text Querying, Querying heterogeneous XML, Extracting structure from unstructured data, Text mining, XML data integration}
}
Document
Personalizing XML Full Text Search in PIMENTO

Authors: Irini Fundulaki, Sihem Amer-Yahia, and Lakshmanan Laks


Abstract
In PIMENTO we advocate a novel approach to XML search that leverages user information to return more relevant query answers. This approach is based on formalizing {em user profiles} in terms of {em scoping rules} which are used to rewrite an input query, and of {em ordering rules} which are combined with query scoring to customize the ranking of query answers to specific users.

Cite as

Irini Fundulaki, Sihem Amer-Yahia, and Lakshmanan Laks. Personalizing XML Full Text Search in PIMENTO. In Ranked XML Querying. Dagstuhl Seminar Proceedings, Volume 8111, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{fundulaki_et_al:DagSemProc.08111.3,
  author =	{Fundulaki, Irini and Amer-Yahia, Sihem and Laks, Lakshmanan},
  title =	{{Personalizing XML Full Text Search in PIMENTO}},
  booktitle =	{Ranked XML Querying},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8111},
  editor =	{Sihem Amer-Yahia and Divesh Srivastava and Gerhard Weikum},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08111.3},
  URN =		{urn:nbn:de:0030-drops-15340},
  doi =		{10.4230/DagSemProc.08111.3},
  annote =	{Keywords: XML Full Text Search, Personalization}
}
Document
Sound ranking algorithms for XML search in PF/Tijah

Authors: Djoerd Hiemstra, Stefan Klinger, Henning Rode, Jan Flokstra, and Peter Apers


Abstract
We argue that ranking algorithms for XML should reflect the actual combined content and structure constraints of queries, while at the same time producing equal rankings for queries that are semantically equal. Ranking algorithms that produce different rankings for queries that are semantically equal are easily detected by tests on large databases: We call such algorithms {em not sound}. We report the behaviour of different approaches to ranking content-and-structure que-ries on pairs of queries for which we expect equal ranking results from the query semantics. We show that most of these approaches are not sound. Of the remaining approaches, only 3 adhere to the W3C XQuery Full-Text standard.

Cite as

Djoerd Hiemstra, Stefan Klinger, Henning Rode, Jan Flokstra, and Peter Apers. Sound ranking algorithms for XML search in PF/Tijah. In Ranked XML Querying. Dagstuhl Seminar Proceedings, Volume 8111, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{hiemstra_et_al:DagSemProc.08111.4,
  author =	{Hiemstra, Djoerd and Klinger, Stefan and Rode, Henning and Flokstra, Jan and Apers, Peter},
  title =	{{Sound ranking algorithms for XML search in PF/Tijah}},
  booktitle =	{Ranked XML Querying},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8111},
  editor =	{Sihem Amer-Yahia and Divesh Srivastava and Gerhard Weikum},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08111.4},
  URN =		{urn:nbn:de:0030-drops-15334},
  doi =		{10.4230/DagSemProc.08111.4},
  annote =	{Keywords: XML Information Retrieval, XQuery Full-Text}
}

Filters