All Answers: Re: [pakgrid] graph data structures [1 Attachment]

Friday, 17 August 2012

Re: [pakgrid] graph data structures [1 Attachment]

[Attachment(s) from Monis Rahman included below]

Dear Asif,

Although it has been a while, I implemented a B-Tree (specialized graph) in hardware to lookup network routes without having to use expensive CAM memory. It also allowed storage of larger route tables through the use of common RAM. B-tree's are great for database type operations where searches are much more frequent than inserts or deletions. Inserts/deletions often involve having to rebalance the tree and can be painful and time consuming, so don't advise this for cases where you have very frequent data modifications.

I'm attaching the patent I received for this which outlines the algorithm in quite some detail. Again, please bear in mind that this was done in hardware on an ASIC chip using microcode.

Hope this helps.

Warm Regards,

--monis.

--
"40% of Pakistan's Internet users visited ROZEE.PK during the last 12 months"

Monis Rahman
Chairman & CEO
Naseeb Networks, Inc.
[LHR PHO] +92.42.577.7630 ext. 233
[USA PHO] +1.650.430.3257
[Twitter] monispk

[Forbes] http://onforb.es/monisrahman

ROZEE.PK, Pakistan's #1 Job Website
www.rozee.pk | 111.JOB.JOB (111.562.562)
2,600,000 Registered Professionals
47,200 Employers
8.9 Million Annual Visitors

On Mon, Aug 13, 2012 at 2:25 PM, Rauf Malick <raufmalick@yahoo.com> wrote:

Assalamoaliekum

I developed my own graph based query optimization system over link graph for biological databases. What is your point of interest please?

Rauf

From: Asif Jan <asif.jan@gmail.com>
To: pakgrid@yahoogroups.com
Sent: Saturday, July 14, 2012 5:14 PM
Subject: Re: [pakgrid] graph data structures

sure, I am aware of current product opensource and commercial product offerings. what I am looking for is someone who has done some work/ or is actively involved in more than just scratching the surface :)

aj

On Fri, Jul 13, 2012 at 10:02 PM, Sulman Sarwar <sulmansarwar@gmail.com> wrote:

checkout Neo4J.. a graph database (neo4j.org)..

On Fri, Jul 13, 2012 at 9:52 PM, Asif Jan <asif.jan@gmail.com> wrote:

well there is a difference in efficiently navigating the graph (which boost could help with) and keyword search support which is more in the domain of relational databases.

On Thu, Jul 12, 2012 at 5:33 PM, Abid Rafique <abid.rafique@gmail.com> wrote:

Might try BOOST library for graph data structures.

On Thu, Jul 12, 2012 at 11:38 AM, yasir mehmood <yasir.mehmood@gmail.com> wrote:

Salam Asif bhai,

How would you define a graph database? Is it a network of keywords with links or edges between/among the keywords?
And how would you define a search? Is is a smaller graph (just like query document) that you are interested in finding in the network?

I may not know the exact answer, but I'm interested in knowing the problem.

Thanks,
yasir

On Thu, Jul 12, 2012 at 11:38 AM, Asif Jan <asif.jan@gmail.com> wrote:

Hi

Is someone on the list working on the graph data structures; I am particularly interested in keyword searches over graph databases.

Thanks a lot

Asif

--
Best Regards,

PhD Student
Circuits and Systems Group
Electrical and Electronic Engineering
Imperial College
South Kensington Campus
London SW7 2AZ

--
----------------------------------------------------------------
M. Sulman Sarwar
Email: sulmansarwar@gmail.com
-----------------------------------------------------------------