Sciweavers

303 search results - page 28 / 61
» Using a compact tree to index and query XML data
Sort
View
CIKM
2006
Springer
13 years 9 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 7 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
ICNP
2006
IEEE
14 years 1 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
ICDE
2005
IEEE
126views Database» more  ICDE 2005»
14 years 9 months ago
A Probabilistic XML Approach to Data Integration
In mobile and ambient environments, devices need to become autonomous, managing and resolving problems without interference from a user. The database of a (mobile) device can be s...
Maurice van Keulen, Ander de Keijzer, Wouter Alink
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 15 days ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...