Abstract
| Original language | English |
|---|---|
| Place of Publication | Glasgow, UK |
| Publisher | University of Strathclyde |
| Number of pages | 13 |
| Publication status | Published - 2002 |
Fingerprint
Keywords
- xml
- extensible markup language
- programming language
Cite this
}
Compact in-memory representation of XML data : design and implementation of a compressed DOM for data-centric documents. / Neumüller, M.; Wilson, John.
Glasgow, UK : University of Strathclyde, 2002. 13 p.Research output: Book/Report › Other report
TY - BOOK
T1 - Compact in-memory representation of XML data
T2 - design and implementation of a compressed DOM for data-centric documents
AU - Neumüller, M.
AU - Wilson, John
PY - 2002
Y1 - 2002
N2 - Over recent years XML has evolved from a document exchange format to a multi-purpose data storage and retrieval solution. To make use of the full potential of XML in the domain of large, data-centric documents it is necessary to have easy and fast access to individual data elements. We describe an implementation of the Document Object Model (DOM) that is designed with these objectives in mind. It uses compression to allow large documents to be stored in the computer's main memory. Query-relevant DOM methods are optimised to work on top of the created data structure. Measurements indicate that compression up to a factor of 5 is possible without losing the ability to directly address individual elements. No prior decompression is needed to query and locate nodes.
AB - Over recent years XML has evolved from a document exchange format to a multi-purpose data storage and retrieval solution. To make use of the full potential of XML in the domain of large, data-centric documents it is necessary to have easy and fast access to individual data elements. We describe an implementation of the Document Object Model (DOM) that is designed with these objectives in mind. It uses compression to allow large documents to be stored in the computer's main memory. Query-relevant DOM methods are optimised to work on top of the created data structure. Measurements indicate that compression up to a factor of 5 is possible without losing the ability to directly address individual elements. No prior decompression is needed to query and locate nodes.
KW - xml
KW - extensible markup language
KW - programming language
M3 - Other report
BT - Compact in-memory representation of XML data
PB - University of Strathclyde
CY - Glasgow, UK
ER -