ISBN: 9783846517604 - hierarchical data in rdbms: a new horizon for data storage and retrieval (7 risultati)

Condizione: New. pp. 100.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Relational databases are not well suited for representing and processing hierarchical data. Clever schemes are required to represent trees in the flat format of the relational model, as well as answering queries such as retrieving all nodes in a sub-tree, all nodes at a particular level and the nodes on the path from a node to one of its descendants. Some areas where hierarchical data needs to be stored and processed include XML data warehousing, organization chart in automation systems, bioinformatics and pyramidal games that require hierarchical data representation. In this book, a new method (Arya) is proposed to represent hierarchical data structures in relational database systems so that queries proved on trees can be executed efficiently. This method reshapes hierarchical data structures to non-hierarchical graphs using extra pointers to be accessed directly from each node to its ancestors. The cost for the gained performance is only a small increase in the space required for the representation of the original tree, which is significantly less than the used space by other methods. 100 pp. Englisch.…

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Relational databases are not well suited for representing and processing hierarchical data. Clever schemes are required to represent trees in the flat format of the relational model, as well as answering queries such as retrieving all nodes in a sub-tree, all nodes at a particular level and the nodes on the path from a node to one of its descendants. Some areas where hierarchical data needs to be stored and processed include XML data warehousing, organization chart in automation systems, bioinformatics and pyramidal games that require hierarchical data representation. In this book, a new method (Arya) is proposed to represent hierarchical data structures in relational database systems so that queries proved on trees can be executed efficiently. This method reshapes hierarchical data structures to non-hierarchical graphs using extra pointers to be accessed directly from each node to its ancestors. The cost for the gained performance is only a small increase in the space required for the representation of the original tree, which is significantly less than the used space by other methods.…

Condizione: New. Print on Demand pp. 100 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Rahnama BehnamBehnam Rahnama is assistant professor in Computer Engineering at European University of Lefke, North Cyprus. His research interests include Semantic Robotics, Security and Cryptography, Embedded Systems, CMS, and GPGPU .…

Condizione: New. PRINT ON DEMAND pp. 100.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Relational databases are not well suited for representing and processing hierarchical data. Clever schemes are required to represent trees in the flat format of the relational model, as well as answering queries such as retrieving all nodes in a sub-tree, all nodes at a particular level and the nodes on the path from a node to one of its descendants. Some areas where hierarchical data needs to be stored and processed include XML data warehousing, organization chart in automation systems, bioinformatics and pyramidal games that require hierarchical data representation. In this book, a new method (Arya) is proposed to represent hierarchical data structures in relational database systems so that queries proved on trees can be executed efficiently. This method reshapes hierarchical data structures to non-hierarchical graphs using extra pointers to be accessed directly from each node to its ancestors. The cost for the gained performance is only a small increase in the space required for the representation of the original tree, which is significantly less than the used space by other methods.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 100 pp. Englisch.…