Algorithms and programming models for efficient representation of XML for Internet applications

Algorithms and programming models for efficient representation of XML for Internet applications (2001)

Cached

Download Links

[www.www10.org]
[www10.org]

Other Repositories/Bibliography

DBLP

by Neel Sundaresan

Venue:	In Proc. of
Citations:	21 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Algorithms and programming models for efficient representation of XML for Internet applications	INFERENCE
AUTHOR NAME	Neel Sundaresan	SVM HeaderParse 0.2
AUTHOR AFFIL	NehaNet Corp.	SVM HeaderParse 0.2
AUTHOR ADDR	2355 Paragon Drive Suite F; San Jose, CA 95131	SVM HeaderParse 0.2
ABSTRACT	XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number of applications running on diverse devices. Efficient storage and transportation of such data is an important issue. We have designed a system called Millau and a series of algorithms for efficient encoding and representation of XML structures. In this paper we describe some of the newer algorithms and APIs in our system for compression of XML structures and data. Our compression algorithms, in addition to separating structure and text for compression, take advantage of the associated schema (if available) in compressing the structure. We also quantify XML documents and their schema with the purpose of defining a decision logic to apply the appropriate compression algorithm for a document or a set of documents following a particular schema. Our system also defines a programming model corresponding to XML DOM and SAX for XML APIs for XML streams and documents in compressed form. Our experiments have shown significant performance gains of our algorithms and APIs. We describe some of these results in this paper. We also describe some web applications based on our system. Categories and Subject Descriptors E.4. [Coding and Information Theory]: Data compression and compaction. H.1.1[Systems and Information Theory]: Information theory.	SVM HeaderParse 0.2
YEAR	2001	INFERENCE
VENUE	In Proc. of	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	366--375	INFERENCE
VOLUME	39	INFERENCE
CITATIONS	19 found	ParsCit 1.0