Sciweavers

198 search results - page 23 / 40
» Selectively Storing XML Data in Relations
Sort
View
79
Voted
ICDE
2006
IEEE
148views Database» more  ICDE 2006»
15 years 3 months ago
Estimating XML Structural Join Size Quickly and Economically
XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structu...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yan, Ch...
TIME
2005
IEEE
15 years 3 months ago
Version Management and Historical Queries in Digital Libraries
Historical information can be effectively preserved using XML and searched through powerful historical queries written in XQuery. Indeed, by storing the successive versions of a d...
Fusheng Wang, Carlo Zaniolo, Xin Zhou, Hyun J. Moo...
LICS
2002
IEEE
15 years 2 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
15 years 2 months ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...
ICICS
2007
Springer
15 years 1 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia