Over 10 mio. titler Fri fragt ved køb over 499,- Hurtig levering Forlænget returret til 31/01/25

Joe Celko's Trees and Hierarchies in SQL for Smarties

  • Format
  • Bog, paperback
  • Engelsk

Beskrivelse

The demand for SQL information and training continues to grow with the need for a database behind every website capable of offering web-based information queries. SQL is the de facto standard for database retrieval, and if you need to access, update, or utilize data in a modern database management system, you will need SQL to do it. The Second Edition of Joe Celko's Trees and Hierarchies in SQL for Smarties covers two new sets of extensions over three entirely new chapters and expounds upon the changes that have occurred in SQL standards since the previous edition's publication. Benefit from mastering the challenging aspects of these database applications in SQL as taught by Joe Celko, one of the most-read SQL authors in the world.

Læs hele beskrivelsen
Detaljer
Størrelse og vægt
  • Vægt450 g
  • coffee cup img
    10 cm
    book img
    19,1 cm
    23,5 cm

    Findes i disse kategorier...

    Se andre, der handler om...

    Navigation Oracle XML Inheritance Tokens SQL (Computer program language) Traveling-salesman problem Trees (Graph theory) Reorganization Trees Zip codes Aggregation Application programs Microsoft Places Recursion Data Definition Language Anomalies HierarchyID Data field Nodes Subordination Levels Traversal Root Data validation DLI Floating point numbers Transitions Node GAPS Relational database Segment XPath Nulls Paths Insertion Spread Hybrid models Rational Numbers Subordinates Edges adjacency list model adjacency and depth model adjacency and nested sets model adjacency list with self-references and n adjacency matrix model autonumbering balanced binary search tree balanced binary tree AVL tree Carl Adam Petri control blocks breadth-first convergence point dynamic edges database record Dewey Decimal Classification system directed arcs dynamic nodes data communications component Egyptian fractions data type deletion edge enumeration EXPLODE operator Complete Binary Tree computed hybrid models flow lines Frammis indegree heaps depth-first enumeration depth-first convergence point initial state height-balanced tree disjoint hierarchy Inorder Traversal Internal Node Melville Louis Kossuth Dewey Fibonacci tree m relationships nested intervals model node enumeration Greatest Common Divisor organizational charts nonreconvergent postorder traversal parts explosions Preorder Traversal path string perfect binary tree shop categories reachable nodes reconvergent stack algorithm Statistical tools Stern-Brocot numbers sequence field subtrees termination states sink node isolated node WITH operator least common multiple overlapping hierarchy outdegree nested sets with depth model self-joins path end points subordinate adjacency list subtree recursive common table expressions State Transition Diagram static edges static nodes superiors Source Node
    Machine Name: SAXO080