“It has been my privilege to have worked with Upendra at Barclays. He is the one who’s not only interested in the company’s bottom line, but also in his teammates professional growth. His technical expertise and research skills has proven invaluable as well as his general readiness to contribute and work with the team. His calming personality makes you feel completely comfortable, even when you’re making mistakes. As a team member or a leader, Upendra earns my highest recommendation.”
About
CEO @ Mukta Labs
Patented solutions in Cyber Security
Patents: US…
Services
Experience
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
Education
-
Devi Ahilya Vishwavidyalaya
-
Currently pursuing
-
-
Activities and Societies: PATENT PUBLICATION : MULTIPARTY BINARY ACCESS CONTROLS, Application No.201821020478 A, The Patent Office Journal No. 25/2018 Dated 22/06/2018
-
-
Activities and Societies: Java/J2EE, C/C++, Unix
-
-
Publications
-
Index Based XML Parser
This work aims at creating an efficient DOM parser for XML documents. The main attraction for IBXP is significant reduction of processing and storage overheads by using the power of indexing mechanism and lighter data structures.
Existing DOM parsers break the input XML string (character sequence) into many small sub- strings (tokens) and then create a tree of objects (the DOM) in the memory. Apart from this, heavy data-structures like Maps and Lists are used to store attributes and…This work aims at creating an efficient DOM parser for XML documents. The main attraction for IBXP is significant reduction of processing and storage overheads by using the power of indexing mechanism and lighter data structures.
Existing DOM parsers break the input XML string (character sequence) into many small sub- strings (tokens) and then create a tree of objects (the DOM) in the memory. Apart from this, heavy data-structures like Maps and Lists are used to store attributes and child nodes respectively. This process consumes both, time and the memory.
In IBXP, the input XML (optimized) is stored in the form of a single string and a data structure containing integer offsets is created to represent the DOM. This way, only offsets are stored to navigate through all the elements, attributes, children and other nodes; this significantly reduces initial processing time and memory consumption both. Further updates to the DOM are maintained in a separate modify-buffer. The algorithm also uses meta-data to keep the search faster.
Thus, IBXP becomes more efficient by using indexes and reducing the object creation. And could save significant processing time and memory as compared to existing open source DOM parsers. The algorithm currently targets Java platform and will support the current version of JAXP; but with slight modifications, it should work for any platform.
---a work-in-progressOther authors -
Courses
-
Yog Visharad
-
Projects
Languages
-
Hindi
Native or bilingual proficiency
-
English
Full professional proficiency
Recommendations received
8 people have recommended Upendra
Join now to viewOther similar profiles
Explore collaborative articles
We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.
Explore More