<rdf:RDF xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/burst/user/grahl/informationretrieval"><title>BibSonomy publications for /user/grahl/informationretrieval</title><link>http://www.bibsonomy.org/burst/user/grahl/informationretrieval</link><description>BibSonomy BuRST Feed for /user/grahl/informationretrieval</description><dc:date>2008-09-06T20:29:32+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24d8b4f79814691fbe6db8357d63206a1/grahl"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23c301945817681d637ee43901c016939/grahl"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2259513097151731f8ab2651c3338df35/grahl"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22259c92df0718ad8b85d1b02ac90d7aa/grahl"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/grahl"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2201304fb6db7593ccf8539fae8d316fe/grahl"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24396233a3689ea75e3cf08080abda3ef/grahl"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2dcab6910544097b0cd38f4621792b7d2/grahl"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b53893655b48140d4310a848dbf204d3/grahl"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/24d8b4f79814691fbe6db8357d63206a1/grahl"><title>FolkRank: A Ranking Algorithm for Folksonomies</title><description>Short version of http://www.bibsonomy.org/bibtex/07f061a8c294bae64831fbe92dc9ece48/stumme</description><link>http://www.bibsonomy.org/bibtex/24d8b4f79814691fbe6db8357d63206a1/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-11-17T08:46:17+01:00</dc:date><dc:subject>ranking nepomuk algorithm pagerank folkrank informationretrieval </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Andreas &lt;a href=&#034;http://www.bibsonomy.org/author/Hotho&#034;&gt;Hotho&lt;/a&gt;  und Robert &lt;a href=&#034;http://www.bibsonomy.org/author/Jäschke&#034;&gt;J&amp;#228;schke&lt;/a&gt;  und Christoph &lt;a href=&#034;http://www.bibsonomy.org/author/Schmitz&#034;&gt;Schmitz&lt;/a&gt;  und Gerd &lt;a href=&#034;http://www.bibsonomy.org/author/Stumme&#034;&gt;Stumme&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. FGIR 2006, &lt;/em&gt;&lt;em&gt;Seiteto appear. &lt;/em&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ranking"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nepomuk"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pagerank"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folkrank"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/24d8b4f79814691fbe6db8357d63206a1/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/24d8b4f79814691fbe6db8357d63206a1/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006folkrank.pdf"/><swrc:date>Fri Nov 17 08:46:17 CET 2006</swrc:date><swrc:booktitle>Proc. FGIR 2006</swrc:booktitle><swrc:pages>to appear</swrc:pages><swrc:title>FolkRank: A Ranking Algorithm for Folksonomies</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>ranking nepomuk algorithm pagerank folkrank informationretrieval </swrc:keywords><swrc:abstract> In social bookmark tools users are setting up
lightweight conceptual structures called folksonomies. Currently,
the information retrieval support is limited. We present a formal
model and a new search algorithm for folksonomies, called
FolkRank, that exploits the structure of the folksonomy. The
proposed algorithm is also applied to find communities within the
folksonomy and is used to structure search results. All findings are
demonstrated on a large scale dataset. A long version of this paper
has been published at the European Semantic Web Conference
2006.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Andreas Hotho"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Robert Jäschke"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Christoph Schmitz"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Gerd Stumme"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/23c301945817681d637ee43901c016939/grahl"><title>Information Retrieval in Folksonomies: Search and Ranking</title><link>http://www.bibsonomy.org/bibtex/23c301945817681d637ee43901c016939/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-11-17T08:46:17+01:00</dc:date><dc:subject>folksonomy nepomuk retrieval informationretrieval folkrank ranking pagerank information </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Andreas &lt;a href=&#034;http://www.bibsonomy.org/author/Hotho&#034;&gt;Hotho&lt;/a&gt;  und Robert &lt;a href=&#034;http://www.bibsonomy.org/author/Jäschke&#034;&gt;J&amp;#228;schke&lt;/a&gt;  und Christoph &lt;a href=&#034;http://www.bibsonomy.org/author/Schmitz&#034;&gt;Schmitz&lt;/a&gt;  und Gerd &lt;a href=&#034;http://www.bibsonomy.org/author/Stumme&#034;&gt;Stumme&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;The Semantic Web: Research and Applications, &lt;/em&gt;&lt;em&gt;Volume4011vonLNAI, &lt;/em&gt;&lt;em&gt;Seite411-426. &lt;/em&gt;&lt;em&gt;Heidelberg, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;&lt;em&gt;June2006. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nepomuk"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/retrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folkrank"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ranking"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pagerank"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23c301945817681d637ee43901c016939/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23c301945817681d637ee43901c016939/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006information.pdf"/><swrc:date>Fri Nov 17 08:46:17 CET 2006</swrc:date><swrc:address>Heidelberg</swrc:address><swrc:booktitle>The Semantic Web: Research and Applications</swrc:booktitle><swrc:month>June</swrc:month><swrc:pages>411-426</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>LNAI</swrc:series><swrc:title>Information Retrieval in Folksonomies: Search and Ranking</swrc:title><swrc:volume>4011</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>folksonomy nepomuk retrieval informationretrieval folkrank ranking pagerank information </swrc:keywords><swrc:abstract>Social bookmark tools are rapidly emerging on the Web. In such
systems users are setting up lightweight conceptual structures
called folksonomies. The reason for their immediate success is the
fact that no specific skills are needed for participating. At the
moment, however, the information retrieval support is limited. We
present a formal model and a new search algorithm for folksonomies,
called \emph{FolkRank}, that exploits the structure of the
folksonomy. The proposed algorithm is also applied to find
communities within the folksonomy and is used to structure search
results. All findings are demonstrated on a large scale dataset.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Andreas Hotho"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Robert Jäschke"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Christoph Schmitz"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Gerd Stumme"/></rdf:_4></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="York Sure"/></rdf:_1><rdf:_2><swrc:Person swrc:name="John Domingue"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2259513097151731f8ab2651c3338df35/grahl"><title>Topic-based Vector Space Model</title><description>bibliografica tesi</description><link>http://www.bibsonomy.org/bibtex/2259513097151731f8ab2651c3338df35/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-10-30T08:38:23+01:00</dc:date><dc:subject>informationretrieval vector-space-model </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;J. &lt;a href=&#034;http://www.bibsonomy.org/author/Becker&#034;&gt;Becker&lt;/a&gt;  und D. &lt;a href=&#034;http://www.bibsonomy.org/author/Kuropka&#034;&gt;Kuropka&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the 6th International Conference on Business Information Systems, &lt;/em&gt;&lt;em&gt;Seite7--12. &lt;/em&gt;&lt;em&gt;Colorado Springs, &lt;/em&gt;&lt;em&gt;July2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/vector-space-model"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2259513097151731f8ab2651c3338df35/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2259513097151731f8ab2651c3338df35/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://bpt.hpi.uni-potsdam.de/twiki/bin/view/Public/DominikKuropka"/><swrc:date>Mon Oct 30 08:38:23 CET 2006</swrc:date><swrc:address>Colorado Springs</swrc:address><swrc:booktitle>Proceedings of the 6th International Conference on Business Information Systems</swrc:booktitle><swrc:month>July</swrc:month><swrc:pages>7--12</swrc:pages><swrc:title>Topic-based Vector Space Model</swrc:title><swrc:year>2003</swrc:year><swrc:keywords>informationretrieval vector-space-model </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="818427" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="J. Becker"/></rdf:_1><rdf:_2><swrc:Person swrc:name="D. Kuropka"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/22259c92df0718ad8b85d1b02ac90d7aa/grahl"><title>Measuring retrieval effectiveness based on user preference of documents</title><description>bibliografica tesi</description><link>http://www.bibsonomy.org/bibtex/22259c92df0718ad8b85d1b02ac90d7aa/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-10-30T08:38:23+01:00</dc:date><dc:subject>informationretrieval </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Y. Y. &lt;a href=&#034;http://www.bibsonomy.org/author/Yao&#034;&gt;Yao&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of the American Society for Information Science&lt;/em&gt;&lt;em&gt;46(2):133--145&lt;/em&gt;(&lt;em&gt;1995&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/22259c92df0718ad8b85d1b02ac90d7aa/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/22259c92df0718ad8b85d1b02ac90d7aa/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dx.doi.org/10.1002/(SICI)1097-4571(199503)46:2&lt;133::AID-ASI6&gt;3.0.CO;2-Z"/><swrc:date>Mon Oct 30 08:38:23 CET 2006</swrc:date><swrc:address>Department of Mathematical Sciences, Lakehead University, Thunder Bay, Ontario P7B 5E1 Canada</swrc:address><swrc:journal>Journal of the American Society for Information Science</swrc:journal><swrc:number>2</swrc:number><swrc:pages>133--145</swrc:pages><swrc:title>Measuring retrieval effectiveness based on user preference of documents</swrc:title><swrc:volume>46</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>informationretrieval </swrc:keywords><swrc:abstract>The notion of user preference is adopted for the representation, interpretation, and measurement of the relevance or usefulness of documents. User judgments on documents may be formally described by a weak order (i.e., user ranking) and measured using an ordinal scale. Within this framework, a new measure of system performance is suggested based on the distance between user ranking and system ranking. It only uses the relative order of documents and therefore confirms to the valid use of an ordinal scale measuring relevance. It is also applicable to multilevel relevance judgments and ranked system output. The appropriateness of the proposed measure is demonstrated through an axiomatic approach. The inherent relationships between the new measure and many existing measures provide further supporting evidence. © 1995 John Wiley \&amp; Sons, Inc.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="818388" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1002/(SICI)1097-4571(199503)46:2&lt;133::AID-ASI6&gt;3.0.CO;2-Z" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Y. Y. Yao"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/grahl"><title>Modeling the Internet and the Web: Probabilistic Methods and Algorithms</title><description>bibliografia tesi</description><link>http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-10-30T08:38:23+01:00</dc:date><dc:subject>informationretrieval tf-idf data-mining </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Pierre &lt;a href=&#034;http://www.bibsonomy.org/author/Baldi&#034;&gt;Baldi&lt;/a&gt;  und Paolo &lt;a href=&#034;http://www.bibsonomy.org/author/Frasconi&#034;&gt;Frasconi&lt;/a&gt;  und Padhraic &lt;a href=&#034;http://www.bibsonomy.org/author/Smyth&#034;&gt;Smyth&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;chapter 4, &lt;/em&gt;&lt;em&gt;Wiley, &lt;/em&gt;&lt;em&gt;April2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tf-idf"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data-mining"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23e4e2899e7d6988218d02a264bcfe24a/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InBook"/><owl:sameAs rdf:resource="http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470849061.html"/><swrc:date>Mon Oct 30 08:38:23 CET 2006</swrc:date><swrc:booktitle>Modeling the Internet and the Web: Probabilistic Methods and Algorithms</swrc:booktitle><swrc:chapter>4</swrc:chapter><swrc:month>April</swrc:month><swrc:publisher><swrc:Organization swrc:name="Wiley"/></swrc:publisher><swrc:title>Modeling the Internet and the Web: Probabilistic Methods and Algorithms</swrc:title><swrc:year>2003</swrc:year><swrc:keywords>informationretrieval tf-idf data-mining </swrc:keywords><swrc:abstract>Modeling the Internet and the Web covers the most important aspects of modeling the Web using a modern mathematical and probabilistic treatment. It focuses on the information and application layers, as well as some of the emerging properties of the Internet.  Provides a comprehensive introduction to the modeling of the Internet and the Web at the information level.  Takes a modern approach based on mathematical, probabilistic, and graphical modeling.  Provides an integrated presentation of theory, examples, exercises and applications.  Covers key topics such as text analysis, link analysis, crawling techniques, human behaviour, and commerce on the Web. Interdisciplinary in nature, Modeling the Internet and the Web will be of interest to students and researchers from a variety of disciplines including computer science, machine learning, engineering, statistics, economics, business, and the social sciences.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="822915" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Pierre Baldi"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Paolo Frasconi"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Padhraic Smyth"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2201304fb6db7593ccf8539fae8d316fe/grahl"><title>A vector space model for automatic indexing</title><description>bibliografia tesi</description><link>http://www.bibsonomy.org/bibtex/2201304fb6db7593ccf8539fae8d316fe/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-10-30T08:38:23+01:00</dc:date><dc:subject>tf-idf informationretrieval vector-space-model </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;G. &lt;a href=&#034;http://www.bibsonomy.org/author/Salton&#034;&gt;Salton&lt;/a&gt;  und A. &lt;a href=&#034;http://www.bibsonomy.org/author/Wong&#034;&gt;Wong&lt;/a&gt;  und C. S. &lt;a href=&#034;http://www.bibsonomy.org/author/Yang&#034;&gt;Yang&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Commun. ACM&lt;/em&gt;&lt;em&gt;18(11):613--620&lt;/em&gt;&lt;em&gt;November1975. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tf-idf"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/vector-space-model"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2201304fb6db7593ccf8539fae8d316fe/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2201304fb6db7593ccf8539fae8d316fe/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dx.doi.org/10.1145/361219.361220"/><swrc:date>Mon Oct 30 08:38:23 CET 2006</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:journal>Commun. ACM</swrc:journal><swrc:month>November</swrc:month><swrc:number>11</swrc:number><swrc:pages>613--620</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM Press"/></swrc:publisher><swrc:title>A vector space model for automatic indexing</swrc:title><swrc:volume>18</swrc:volume><swrc:year>1975</swrc:year><swrc:keywords>tf-idf informationretrieval vector-space-model </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="G. Salton"/></rdf:_1><rdf:_2><swrc:Person swrc:name="A. Wong"/></rdf:_2><rdf:_3><swrc:Person swrc:name="C. S. Yang"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/24396233a3689ea75e3cf08080abda3ef/grahl"><title>Managing Large Multidimensional Datasets Inside A Database System</title><description>Managing Large Multidimensional Datasets Inside A Database System (ResearchIndex)</description><link>http://www.bibsonomy.org/bibtex/24396233a3689ea75e3cf08080abda3ef/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-10-30T08:38:23+01:00</dc:date><dc:subject>database informationretrieval </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Kaushik &lt;a href=&#034;http://www.bibsonomy.org/author/Chakrabarti&#034;&gt;Chakrabarti&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/database"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/24396233a3689ea75e3cf08080abda3ef/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/24396233a3689ea75e3cf08080abda3ef/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://citeseer.ist.psu.edu/chakrabarti01managing.html"/><swrc:date>Mon Oct 30 08:38:23 CET 2006</swrc:date><swrc:title>Managing Large Multidimensional Datasets Inside A Database System</swrc:title><swrc:year>2001</swrc:year><swrc:keywords>database informationretrieval </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Kaushik Chakrabarti"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2dcab6910544097b0cd38f4621792b7d2/grahl"><title>Quasi-cubes: A space-efficient way to support approximate multidimensional databases</title><link>http://www.bibsonomy.org/bibtex/2dcab6910544097b0cd38f4621792b7d2/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-10-30T08:38:23+01:00</dc:date><dc:subject>mathematics informationretrieval </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;D. &lt;a href=&#034;http://www.bibsonomy.org/author/Barbara&#034;&gt;Barbara&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mathematics"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2dcab6910544097b0cd38f4621792b7d2/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2dcab6910544097b0cd38f4621792b7d2/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://citeseer.ist.psu.edu/barbara98quasicubes.html"/><swrc:date>Mon Oct 30 08:38:23 CET 2006</swrc:date><swrc:title>Quasi-cubes: A space-efficient way to support approximate multidimensional databases</swrc:title><swrc:year>1998</swrc:year><swrc:keywords>mathematics informationretrieval </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="D. Barbara"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b53893655b48140d4310a848dbf204d3/grahl"><title>Information retrieval</title><link>http://www.bibsonomy.org/bibtex/2b53893655b48140d4310a848dbf204d3/grahl</link><dc:creator>grahl</dc:creator><dc:date>2006-10-23T17:25:28+02:00</dc:date><dc:subject>AI informationretrieval </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;C. J. &lt;a href=&#034;http://www.bibsonomy.org/author/van Rijsbergen&#034;&gt;van Rijsbergen&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Butterworths, &lt;/em&gt;&lt;em&gt;London, &lt;/em&gt;&lt;em&gt;2 Edition, &lt;/em&gt;(&lt;em&gt;1979&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/AI"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationretrieval"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b53893655b48140d4310a848dbf204d3/grahl"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b53893655b48140d4310a848dbf204d3/grahl"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><owl:sameAs rdf:resource="http://www.dcs.glasgow.ac.uk/Keith/Preface.html"/><swrc:date>Mon Oct 23 17:25:28 CEST 2006</swrc:date><swrc:address>London</swrc:address><swrc:edition>2</swrc:edition><swrc:publisher><swrc:Organization swrc:name="Butterworths"/></swrc:publisher><swrc:title>Information retrieval</swrc:title><swrc:year>1979</swrc:year><swrc:keywords>AI informationretrieval </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="C. J. van Rijsbergen"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>