Proceedings of the 2002 ACM symposium on Document engineering
Generalizing operational transformation to the standard general markup language
CSCW '02 Proceedings of the 2002 ACM conference on Computer supported cooperative work
Pro Apache XML (Pro)
A document object modeling method to retrieve data from a very large XML document
Proceedings of the 2007 ACM symposium on Document engineering
Virtual DOM: An Efficient Virtual Memory Representation for Large XML Documents
DEXA '08 Proceedings of the 2008 19th International Conference on Database and Expert Systems Application
A Parallel Approach to XML Parsing
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
DFRS: a domain-based framework for representing semi-structured data
Proceedings of the CUBE International Information Technology Conference
| Hi-index | 0.00 |
Through the recent decades, XML became the most standard method for representing and exchanging information on the Web environments due to its flexibility in textual visualization, information modeling, information retrieval, document exchange, document management, and data mining. XML can provide hierarchal arrangement of data through some major techniques available for accessing and manipulating the XML documents. DOM is a widely used data model for memory representation of the documents, but had shown some shortage in parsing and representing large or very large documents. Wasting resources and processing time overhead are results of applying large XML documents to the DOM parser. SGML is the XML parent. It was using GROVE (Graph Representation of Property Value) as its abstract data model to solve the problems that encountered into the SGML family and as a standardized data model that represents the information contained within the SGML document. Grove is defined formally by a data modeling language called property set. In this paper, the grove idea is popularized as a data model that might solve DOM's problems. The grove is being built by a grove builder. Using Grove will provide addressing and enable the messages between sites to specify which nodes are to be affected. Groves also will bring acceptable results of the memory overhead and the time required for processing an xml file.