توضیحاتی در مورد کتاب Practical Graph Structures in SQL Server and Azure SQL: Enabling Deeper Insights Using Highly Connected Data
نام کتاب : Practical Graph Structures in SQL Server and Azure SQL: Enabling Deeper Insights Using Highly Connected Data
عنوان ترجمه شده به فارسی : ساختارهای نمودار عملی در SQL Server و Azure SQL: فعال کردن بینش عمیق تر با استفاده از داده های بسیار متصل
سری :
نویسندگان : Louis Davidson
ناشر : Apress
سال نشر :
تعداد صفحات : 244
ISBN (شابک) : 9781484294581 , 1484294580
زبان کتاب : English
فرمت کتاب : pdf
حجم کتاب : 7 مگابایت
بعد از تکمیل فرایند پرداخت لینک دانلود کتاب ارائه خواهد شد. درصورت ثبت نام و ورود به حساب کاربری خود قادر خواهید بود لیست کتاب های خریداری شده را مشاهده فرمایید.
فهرست مطالب :
Table of Contents\nAbout the Author\nAbout the Technical Reviewer\nAcknowledgments\nPreface\nChapter 1: Introduction to Graphs\n Graph Fundamentals\n Definition\n Graphs In Computing/Directed Graphs\n Cyclic and Acyclic Graphs\n Summary\nChapter 2: Data Structures and Algorithms\n Basic Implementation\n Acyclic Graphs\n Trees\n Other Acyclic Graphs\n Cyclic Graphs\n Non-Directed Graphs\n Summary\nChapter 3: SQL Graph Table Basics\n Object Creation\n Creating Data\n Querying Data\n Node-to-Node Querying\n Filtering Output\n Multiple MATCH Expressions\n Traversing Variable Level Paths\n Displaying the Last Node in the Path\n Aggregation Along the Path\n Controlling Depth of Processing\n Filtering for One Path\n Finding All Paths Between Nodes\n Weighted Graph Calculations\n Checking Conditions on the Matched Item\n Summary\nChapter 4: SQL Graph Tables: Extended Topics\n Advanced Data Creation Techniques\n Building an Interface Layer\n INSERT\n UPDATE\n DELETE\n Loading Data Using Composable JSON Tags\n Heterogenous Queries\n Integrity Constraints and Indexes\n Edge Constraint\n Uniqueness Constraints (and Indexes)\n Additional Constraints\n Metadata Roundup\n List Graph Objects in the Database\n Types of Graph Columns\n Tools for Fetching Graph Information\n Summary\nChapter 5: Tree Data Structures\n Creating the Data Structures\n Base Table Structures\n Demo Sales Structure\n Essential Tree Maintenance Code\n Code To Create New Nodes\n Reparenting Nodes\n Deleting a Node\n Tree Output Code\n Returning Part of the Tree\n Determining If a Child Node Exists\n Aggregating Child Activity at Every Level\n Summary\nChapter 6: Tree Structures, Algorithms, and Performance\n Alternative Tree Implementation\n Path Technique\n Code\n Table Create Script\n Insert New Rows\n Return Hierarchy\n Check For Child\n Report Sales\n Helper Table\n Kimball Helper Table\n Code\n Table Create Script\n Check For Child\n Hierarchy Display Helper\n Code\n Table Create Script\n Using the Helper Objects\n Report Sales\n Performance Comparison\n Summary\nChapter 7: Other Directed Acyclic Graphs\n The Problem Set\n The Example\n Determining If a Part Is Used in a Build\n Picking Items for a Build\n Printing Out the Parts List for a Build\n Summary\nChapter 8: A Graph For Testing\n The Example\n Creating the Tables\n Loading the Data\n The Queries\n Find Every Node That Is Connected to a Specific Node\n Seeing If One Node is Connected to Another\n Returning All Paths Between Two Nodes\n Finding All People That a User Connects To At Any Level Where They Share an Interest\n Finding a Specific User Who a User Connects To at Any Level Where They Share a Specific Interest\n Finding Connections Through Other Nodes\n Performance Tuning Results\n Performance Tuning Roundup\n Test\n Index the Internal Columns\n Employ a Maximum Degree of Parallelism of One\n Consider Breaking Up Some Queries\n The End (or Is It the Beginning?)\nIndex