Friday, March 9, 2012

OO storage? How to store large graphs and enable efficient graph operations?

Storing large graph in relational form doesn't allow us to perform graph operations such as shortest path quite efficiently. I'm wondering if storing the graph as objects would be better? How should I design the schema? Thanks!There is an entire chapter (ch.9) dedicated to graphs, hierachies, etc. in Itzik's book. Highly recommend it.

http://www.amazon.com/Inside-Microsoft-SQL-Server-2005/dp/0735623139/ref=pd_sim_b_2/002-5855731-9288849?ie=UTF8&qid=1172821634&sr=8-4|||THanks, oj. But ch 9 is Transactions. Is that what you meant?|||No. Chapter 9 is about graphs, trees, hierachies, and recursive queries. Did I post the wrong url for T-SQL Querying book?|||this is what I found of this book:

Inside Microsoft SQL Server 2005: T-SQL

Programming

byItzik Ben-Gan,

Dejan SarkaandRoger Wolter

Microsoft Press

2006 (532 pages)

ISBN:0735621977

Written by a T-SQL guru, this thorough, hands-on

reference for database developers and administrators focuses on language

features and how they are interpreted and processed by the SQL Server execution

engine.


Table of Contents

Inside Microsoft SQL Server 2005— T-SQL Programming

Foreword

Preface

Introduction

Chapter 1

-

Datatype-Related Problems, XML, and CLR

UDTs

Chapter 2

-

Temporary Tables and Table

Variables

Chapter 3

-

Cursors

Chapter 4

-

Dynamic SQL

Chapter 5

-

Views

Chapter 6

-

User-Defined

Functions

Chapter 7

-

Stored

Procedures

Chapter 8

-

Triggers

Chapter 9

-

Transactions

Chapter 10

-

Exception

Handling

Chapter 11

-

Service Broker

Appendix A

-

Companion to CLR

Routines

Index

List of Figures

List of Tables

List of Listings

List of Sidebars

|||No. You want T-SQL QUERYING (not programming).

No comments:

Post a Comment