Sciweavers

559 search results - page 38 / 112
» XML design for relational storage
Sort
View
DCC
1995
IEEE
13 years 11 months ago
Constrained-Storage Vector Quantization with a Universal Codebook
— Many image compression techniques require the quantization of multiple vector sources with significantly different distributions. With vector quantization (VQ), these sources ...
Sangeeta Ramakrishnan, Kenneth Rose, Allen Gersho
PVLDB
2008
128views more  PVLDB 2008»
13 years 7 months ago
Implementing filesystems by tree-aware DBMSs
With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learn...
Alexander Holupirek, Marc H. Scholl
WWW
2006
ACM
14 years 8 months ago
Symmetrically exploiting XML
Path expressions are the principal means of locating data in a hierarchical model. But path expressions are brittle because they often depend on the structure of data and break if...
Shuohao Zhang, Curtis E. Dyreson
BNCOD
2007
137views Database» more  BNCOD 2007»
13 years 9 months ago
Isolating Order Semantics in Order-Sensitive XQuery-to-SQL Translation
Order is essential for XML query processing. Efficient XML processing with order consideration over relational storage is non-trivial, especially for complex nested XQuery expressi...
Song Wang, Ling Wang, Elke A. Rundensteiner
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