Sciweavers

552 search results - page 55 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
16 years 3 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
WIDM
2004
ACM
15 years 8 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
WWW
2007
ACM
16 years 3 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
118
Voted
DKE
2010
101views more  DKE 2010»
15 years 2 months ago
Effective pruning for XML structural match queries
Extensible Markup Language (XML) is becoming the de facto standard for exchanging information over the Internet, which results in the proliferation of XML documents. This has led ...
Yefei Xin, Zhen He, Jinli Cao
SIGMOD
2007
ACM
150views Database» more  SIGMOD 2007»
16 years 3 months ago
System design issues in sensor databases
In-network sensor query processing systems (ISQPs), or sensor databases, have been developed to acquire, process and aggregate data from wireless sensor networks (WSNs). Because W...
Qiong Luo, Hejun Wu