Cite Article

An Empirical Evaluation of BFS, and DFS Search Algorithms on J2ME Platform, and SVG Tiny Parsing on J2ME Platform Using SAX, StAX, and DOM Parsers

Choose citation format

BibTeX

@article{IJASEIT234,
   author = {Venera Sengirova and Aidana Oralbekova and Nathar Shah},
   title = {An Empirical Evaluation of BFS, and DFS Search Algorithms on J2ME Platform, and SVG Tiny Parsing on J2ME Platform Using SAX, StAX, and DOM Parsers},
   journal = {International Journal on Advanced Science, Engineering and Information Technology},
   volume = {2},
   number = {5},
   year = {2012},
   pages = {405--410},
   keywords = {XML Parsing; SAX; StAX; DOM; J2ME; SVG Tiny},
   abstract = {SVG (Scalable Vector Graphics) Tiny, an XML-based data representation format was used in our Global Train Route Planner J2ME application to render and manipulate train network  images. The SVG Tiny format enables the application to be adaptable with any train network map. We compared three parsing models namely DOM (Document Object Model), SAX (Simple API for XML), and StAX (Streaming API for XML) which were used to visualize the images on mobile phone. We present here the result of the runtime performances, and memory footprints of those parsing models. This is a significant study because handheld devices like mobile phones require seamless interactivity (i.e. high performance) with users and an efficient parsing mechanism with less memory footprints. We also empirically investigated two route searching algorithms - graph and matrix based implementation of DFS (Depth First Search), and matrix based BFS (Breadth First Search) – for performance and memory footprints on a J2ME mobile device emulator. We concluded that DOM parser and DFS based on graph implementation are of better performance than the others.},
   issn = {2088-5334},
   publisher = {INSIGHT - Indonesian Society for Knowledge and Human Development},
   url = {http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=234},
   doi = {10.18517/ijaseit.2.5.234}
}

EndNote

%A Sengirova, Venera
%A Oralbekova, Aidana
%A Shah, Nathar
%D 2012
%T An Empirical Evaluation of BFS, and DFS Search Algorithms on J2ME Platform, and SVG Tiny Parsing on J2ME Platform Using SAX, StAX, and DOM Parsers
%B 2012
%9 XML Parsing; SAX; StAX; DOM; J2ME; SVG Tiny
%! An Empirical Evaluation of BFS, and DFS Search Algorithms on J2ME Platform, and SVG Tiny Parsing on J2ME Platform Using SAX, StAX, and DOM Parsers
%K XML Parsing; SAX; StAX; DOM; J2ME; SVG Tiny
%X SVG (Scalable Vector Graphics) Tiny, an XML-based data representation format was used in our Global Train Route Planner J2ME application to render and manipulate train network  images. The SVG Tiny format enables the application to be adaptable with any train network map. We compared three parsing models namely DOM (Document Object Model), SAX (Simple API for XML), and StAX (Streaming API for XML) which were used to visualize the images on mobile phone. We present here the result of the runtime performances, and memory footprints of those parsing models. This is a significant study because handheld devices like mobile phones require seamless interactivity (i.e. high performance) with users and an efficient parsing mechanism with less memory footprints. We also empirically investigated two route searching algorithms - graph and matrix based implementation of DFS (Depth First Search), and matrix based BFS (Breadth First Search) – for performance and memory footprints on a J2ME mobile device emulator. We concluded that DOM parser and DFS based on graph implementation are of better performance than the others.
%U http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=234
%R doi:10.18517/ijaseit.2.5.234
%J International Journal on Advanced Science, Engineering and Information Technology
%V 2
%N 5
%@ 2088-5334

IEEE

Venera Sengirova,Aidana Oralbekova and Nathar Shah,"An Empirical Evaluation of BFS, and DFS Search Algorithms on J2ME Platform, and SVG Tiny Parsing on J2ME Platform Using SAX, StAX, and DOM Parsers," International Journal on Advanced Science, Engineering and Information Technology, vol. 2, no. 5, pp. 405-410, 2012. [Online]. Available: http://dx.doi.org/10.18517/ijaseit.2.5.234.

RefMan/ProCite (RIS)

TY  - JOUR
AU  - Sengirova, Venera
AU  - Oralbekova, Aidana
AU  - Shah, Nathar
PY  - 2012
TI  - An Empirical Evaluation of BFS, and DFS Search Algorithms on J2ME Platform, and SVG Tiny Parsing on J2ME Platform Using SAX, StAX, and DOM Parsers
JF  - International Journal on Advanced Science, Engineering and Information Technology; Vol. 2 (2012) No. 5
Y2  - 2012
SP  - 405
EP  - 410
SN  - 2088-5334
PB  - INSIGHT - Indonesian Society for Knowledge and Human Development
KW  - XML Parsing; SAX; StAX; DOM; J2ME; SVG Tiny
N2  - SVG (Scalable Vector Graphics) Tiny, an XML-based data representation format was used in our Global Train Route Planner J2ME application to render and manipulate train network  images. The SVG Tiny format enables the application to be adaptable with any train network map. We compared three parsing models namely DOM (Document Object Model), SAX (Simple API for XML), and StAX (Streaming API for XML) which were used to visualize the images on mobile phone. We present here the result of the runtime performances, and memory footprints of those parsing models. This is a significant study because handheld devices like mobile phones require seamless interactivity (i.e. high performance) with users and an efficient parsing mechanism with less memory footprints. We also empirically investigated two route searching algorithms - graph and matrix based implementation of DFS (Depth First Search), and matrix based BFS (Breadth First Search) – for performance and memory footprints on a J2ME mobile device emulator. We concluded that DOM parser and DFS based on graph implementation are of better performance than the others.
UR  - http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=234
DO  - 10.18517/ijaseit.2.5.234

RefWorks

RT Journal Article
ID 234
A1 Sengirova, Venera
A1 Oralbekova, Aidana
A1 Shah, Nathar
T1 An Empirical Evaluation of BFS, and DFS Search Algorithms on J2ME Platform, and SVG Tiny Parsing on J2ME Platform Using SAX, StAX, and DOM Parsers
JF International Journal on Advanced Science, Engineering and Information Technology
VO 2
IS 5
YR 2012
SP 405
OP 410
SN 2088-5334
PB INSIGHT - Indonesian Society for Knowledge and Human Development
K1 XML Parsing; SAX; StAX; DOM; J2ME; SVG Tiny
AB SVG (Scalable Vector Graphics) Tiny, an XML-based data representation format was used in our Global Train Route Planner J2ME application to render and manipulate train network  images. The SVG Tiny format enables the application to be adaptable with any train network map. We compared three parsing models namely DOM (Document Object Model), SAX (Simple API for XML), and StAX (Streaming API for XML) which were used to visualize the images on mobile phone. We present here the result of the runtime performances, and memory footprints of those parsing models. This is a significant study because handheld devices like mobile phones require seamless interactivity (i.e. high performance) with users and an efficient parsing mechanism with less memory footprints. We also empirically investigated two route searching algorithms - graph and matrix based implementation of DFS (Depth First Search), and matrix based BFS (Breadth First Search) – for performance and memory footprints on a J2ME mobile device emulator. We concluded that DOM parser and DFS based on graph implementation are of better performance than the others.
LK http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=234
DO  - 10.18517/ijaseit.2.5.234