Sciweavers

443 search results - page 23 / 89
» Updating probabilistic XML
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 4 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
IPM
2010
174views more  IPM 2010»
14 years 11 months ago
Managing structured queries in probabilistic XML retrieval systems
Focusing on the context of XML retrieval, in this paper we propose a general methodology for managing structured queries (involving both content and structure) within any given st...
Luis M. de Campos, Juan M. Fernández-Luna, ...
125
Voted
TKDE
2010
189views more  TKDE 2010»
15 years 7 days ago
Projective Distribution of XQuery with Updates
—We investigate techniques to automatically decompose any XQuery query—including updating queries specified by the XQuery Update Facility (XQUF)—into subqueries, that can be ...
Ying Zhang, Nan Tang, Peter A. Boncz
DASFAA
2009
IEEE
253views Database» more  DASFAA 2009»
15 years 5 months ago
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
Sebastian Bächle, Theo Härder, Michael P...
83
Voted
XSYM
2007
Springer
119views Database» more  XSYM 2007»
15 years 8 months ago
SXDGL: Snapshot Based Concurrency Control Protocol for XML Data
Nowadays, concurrency control for XML data is a big research problem. There are a number of researchers working on this problem, but most of the proposed methods are based on the ...
Peter Pleshachkov, Sergei Kuznetcov