Filters








21 Hits in 1.1 sec

ProTDB [chapter]

Andrew Nierman, H.V. Jagadish
2002 VLDB '02: Proceedings of the 28th International Conference on Very Large Databases  
storage size in the database exceeded available RAM) Outline XML Constructs Probabilistic Model Probabilistic Query Evaluation Efficiency Related Work Efficiency 28th International  ...  Compare against the non-probabilistic version of the queries Machine specs and data characteristics: Pentium 4 @ 1.5 GHz with 256 MB RAM XML file was approximately 200 MB and had over 3,000,000 nodes (  ... 
doi:10.1016/b978-155860869-6/50063-9 dblp:conf/vldb/NiermanJ02 fatcat:5k256fn525cxxaofcxerkabzaq

Query ranking in probabilistic XML data

Lijun Chang, Jeffrey Xu Yu, Lu Qin
2009 Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09  
In this paper, we study PXML-RANK query, (Q, k), which is to rank top-k probabilities of the answers of a twig query Q in probabilistic XML (PXML) data.  ...  Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data.  ...  [16] first introduce a simple probabilistic XML model, ProTDB, which is a probabilistic tree database. Hung et al.  ... 
doi:10.1145/1516360.1516380 dblp:conf/edbt/ChangYQ09 fatcat:4d22glgqsbbwpleria5wtcjbqq

On the Connections between Relational and XML Probabilistic Data Models [chapter]

Antoine Amarilli, Pierre Senellart
2013 Lecture Notes in Computer Science  
interesting open issues about the connections between relational and XML probabilistic data models.  ...  In probabilistic XML models, XML trees are augmented with nodes that specify probability distributions over their children.  ...  The encodings will be given in the probabilistic XML data models of Section 2.2.  ... 
doi:10.1007/978-3-642-39467-6_13 fatcat:z4ynzhkrp5cshgie2ew4kgbhdm

Probabilistic XML: Models and Complexity [chapter]

Benny Kimelfeld, Pierre Senellart
2013 Studies in Fuzziness and Soft Computing  
Beyond representation, probabilistic XML systems are expected to support data management in a way that properly reflects the uncertainty.  ...  In essence, a probabilistic XML document is a compact representation of a probability distribution over ordinary XML documents.  ...  ., frequent items, correlations, summaries of data values, etc.) in probabilistic XML documents.  ... 
doi:10.1007/978-3-642-37509-5_3 fatcat:lcoqkx7euvfb3dietqvb6v3qva

PEPX

Te Li, Qihong Shao, Yi Chen
2006 Proceedings of the 15th ACM international conference on Information and knowledge management - CIKM '06  
In contrast, previous work on probabilistic XML data requires accessing all the nodes in a pattern match.  ...  In this paper, we argue that physical models are needed in addition to the existing conceptual models for probabilistic XML data in order to achieve query evaluation efficiency.  ... 
doi:10.1145/1183614.1183761 dblp:conf/cikm/LiSC06 fatcat:2mjodpu4fnc5nmscrugwl2n6ey

IMPrECISE: Good-is-good-enough data integration

Ander de Keijzer, Maurice van Keulen
2008 2008 IEEE 24th International Conference on Data Engineering  
IMPrECISE is an XQuery module that adds probabilistic XML functionality to an existing XML DBMS, in our case MonetDBlXQuery.  ...  We demonstrate probabilistic XML and data integration functionality of IMPrECISE.  ...  A formal definition of the probabilistic XML data model is given in [2] .  ... 
doi:10.1109/icde.2008.4497618 dblp:conf/icde/KeijzerK08 fatcat:ojgy7vqthvg3xgq4ensssq3sqm

ELCA Evaluation for Keyword Search on Probabilistic XML Data [article]

Rui Zhou, Chengfei Liu, Jianxin Li, Jeffrey Xu Yu
2011 arXiv   pre-print
XML data.  ...  In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents.  ...  In the XML context, the first probabilistic XML model is ProTDB [2] . In ProTDB, two new types of nodes are added into a plain XML document.  ... 
arXiv:1110.2890v1 fatcat:ljlfekkrnjclroky7e6ctuurta

ELCA evaluation for keyword search on probabilistic XML data

Rui Zhou, Chengfei Liu, Jianxin Li, Jeffrey Xu Yu
2012 World wide web (Bussum)  
XML data.  ...  In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents.  ...  In the XML context, the first probabilistic XML model is ProTDB [2] . In ProTDB, two new types of nodes are added into a plain XML document.  ... 
doi:10.1007/s11280-012-0166-4 fatcat:ncbwzqdra5b6nhwopjichibxwq

Modeling and querying probabilistic XML data

Benny Kimelfeld, Yehoshua Sagiv
2009 SIGMOD record  
Introduction We survey recent results on modeling and querying probabilistic XML data.  ...  In [2, 24] , various aspects of managing probabilistic XML are studied.  ... 
doi:10.1145/1519103.1519115 fatcat:erad6bgntzdehaogswfv7cfm2y

A Hybrid Algorithm for Finding Top-k Twig Answers in Probabilistic XML [chapter]

Bo Ning, Chengfei Liu
2011 Lecture Notes in Computer Science  
Preliminaries Probabilistic XML Model Nierman et al. proposed the Probabilistic Tree Data Base(ProTDB) [4] to manage uncertain data represented in XML.  ...  Conclusions In this paper, we addressed the problem of finding top-k matching of a twig pattern against probabilistic XML data.  ... 
doi:10.1007/978-3-642-20149-3_38 fatcat:kwitzu2vina6bnucbdvreluaym

A Framework for Management of Semistructured Probabilistic Data

Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith
2005 Journal of Intelligent Information Systems  
Subrahmanian for helpful comments and the students working in the Bayesian Advisor group for their input at various stages, and their fabulous energy.  ...  ProTDB [16] extends the XML data model by associating a probability to each element with the modification of regular non-probabilistic DTDs.  ...  There are two approaches to semistructured probabilistic data management that are closely related to ours: the ProTDB [16] and the PIXml [12] frameworks.  ... 
doi:10.1007/s10844-005-0197-8 fatcat:phcwbqonqbcyrhfy56ijslnypi

Top-k keyword search over probabilistic XML data

Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
2011 2011 IEEE 27th International Conference on Data Engineering  
Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data.  ...  In this paper, we firstly define the new problem of studying top-k keyword search over probabilistic XML data, which is to retrieve k SLCA results with the k highest probabilities of existence.  ...  [2] first introduced a probabilistic XML model, ProTDB, with the probabilistic types IND -independant and MUX -mutuallyexclusive. Hung et al.  ... 
doi:10.1109/icde.2011.5767875 dblp:conf/icde/LiLZW11 fatcat:yielg2b3pbcydbyi32b6nrdiri

Probabilistic interval XML

Edward Hung, Lise Getoor, V. S. Subrahmanian
2007 ACM Transactions on Computational Logic  
We propose the Probabilistic Interval XML (PIXml for short) data model in this paper. Using this data model, users can express probabilistic information within XML markups.  ...  Interest in XML databases has been growing over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases.  ...  Such programs usually return probabilistic information. If a company wanted to export this data into an XML format, they would need methods to store probabilistic data in XML.  ... 
doi:10.1145/1276920.1276926 fatcat:qz5wqex6efg2rjuxd5noujf6oq

Probabilistic Interval XML [chapter]

Edward Hung, Lise Getoor, V. S. Subrahmanian
2002 Lecture Notes in Computer Science  
We propose the Probabilistic Interval XML (PIXml for short) data model in this paper. Using this data model, users can express probabilistic information within XML markups.  ...  Interest in XML databases has been growing over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases.  ...  Such programs usually return probabilistic information. If a company wanted to export this data into an XML format, they would need methods to store probabilistic data in XML.  ... 
doi:10.1007/3-540-36285-1_24 fatcat:gcszpnmevfdhjem3v7vzr7gqhi

Quasi-SLCA based Keyword Query Processing over Probabilistic XML Data [article]

Jianxin Li, Chengfei Liu, Rui Zhou, Jeffrey Xu Yu
2013 arXiv   pre-print
In this paper, we investigate probabilistic threshold keyword queries (PrTKQ) over XML data, which is not studied before.  ...  The probabilistic threshold query is one of the most common queries in uncertain databases, where a result satisfying the query must be also with probability meeting the threshold requirement.  ...  [7] first introduced a probabilistic XML model, ProTDB, with the probabilistic types INDindependent and MUXmutually-exclusive. Hung et al.  ... 
arXiv:1301.2362v1 fatcat:fpmgvejcdbcqrhcx2ak6oqknwq
« Previous Showing results 1 — 15 out of 21 results