Sciweavers

56 search results - page 4 / 12
» Top-k keyword search over probabilistic XML data
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 8 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
WWW
2006
ACM
14 years 6 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 5 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
KES
2005
Springer
13 years 11 months ago
Data Integration Hub for a Hybrid Paper Search
In this paper we describe the design of a hybrid search that combines simple metadata search with a traditional keyword search over unstructured context data. This paradigm provide...
Jungkee Kim, Geoffrey Fox, Seong Joon Yoo
SIGMOD
2009
ACM
143views Database» more  SIGMOD 2009»
14 years 6 months ago
Building search applications with Marklogic Server
Keyword search is recognized as an important technique to unlocking the information found in both structured and semistructured information. With XML as the data model and XQuery ...
Ron Avnur