Hi All, I 'am currently working on Data Mapper feature, data mapping algorithm development. While implementing I want to store input data in a tree data structure so that I could access data efficiently. This tree *will not restructured* *or write *often. But it will be *read heavily*. I'm wandering is there any better way to implement other than using objects as nodes. For example : We can use adjacency lists to represent graph like data structures so that graph operations can be done efficiently.
This tree is basically represent a AVRO schema related data object. ( We can think of a xml request with converted to a JSON object ) So there can be lists inside lists and complex data representations. We may required to navigate and retrieve data's from one of the sibling or one of the parent node's child or etc. Is there any *improved , efficient way of storing and do above operations on this kind of data tree which will not restructured or written often but will read heavily* , other than using objects as nodes. Thanks, Nuwan -- ---------------------------------------------------------- *Nuwan Chamara Pallewela* *Software Engineer* *WSO2, Inc. *http://wso2.com *lean . enterprise . middleware* Email *[email protected] <[email protected]>* Mobile *+94719079739@*
_______________________________________________ Dev mailing list [email protected] http://wso2.org/cgi-bin/mailman/listinfo/dev
