Behnam rahnama (8 risultati)
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 77,39
EUR 3,46 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 100.
- Altre immagini
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 43,35
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Hierarchical Data in RDBMS | A New Horizon for Data Storage and Retrieval | Behnam Rahnama | Taschenbuch | 100 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846517604 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de… | Anbieter: preigu.
- Altre immagini
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,00
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
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.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 77,44
EUR 7,60 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
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.
- Altre immagini
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 41,05
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
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, E…mbedded Systems, CMS, and GPGPU .
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 79,55
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 100.
- Altre immagini
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,00
EUR 60,84 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
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 n…odes 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.
- Altre immagini
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,00
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
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.
