Not logged in : Login
(Sponging disallowed)

About: Re:Transitivity and Graphs for SQL     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : atom:Entry, within Data Space : www.openlinksw.com associated with source document(s)
QRcode icon
http://www.openlinksw.com/describe/?url=http%3A%2F%2Fwww.openlinksw.com%2Fdataspace%2Foerling%2Fweblog%2FOrri%2520Erling%2527s%2520Blog%2F1433%2F4589&graph=http%3A%2F%2Fwww.openlinksw.com%2Fdataspace&graph=http%3A%2F%2Fwww.openlinksw.com%2Fdataspace

AttributesValues
has container
Date Created
Date Modified
link
id
  • ca4cabc8a112dbe7833fb398bd8bf1a2
content
  • "[...] meaning that all database access is parallelized and that the<br /> algorithm is internally latency tolerant."<br><br>Do you have some deep magic voo-doo that works around the problem of having a straight chain?&nbsp; In the worst case, every single step of your search will cross nodes.&nbsp; Every one.&nbsp; That is in no way, shape, or form "latency tolerant."<br><br>In the realm of parallel graph manipulation and searching, you need to be very, very precise in what you declare...&nbsp; Are your results for some general case, over some set of examples, or a technical average?<br><br>You certainly are not talking about worst-case performance.&nbsp; Some graphs contain no parallelism at all.&nbsp; Some pointer jumping or triangulation can add parallelism to otherwise sequential graphs but at an explosive storage cost.&nbsp; There are some nifty techniques for pulling as much parallelism as possible out of a graph (splitting by the DFS tree, forgot the author, but it's referenced from Reif's proof that DFS is sequential), but they are quite painful if your data is dynamic.<br>
reply of
Title
  • Re:Transitivity and Graphs for SQL
is described using
atom:source
atom:updated
  • 2008-09-08T16:53:46Z
atom:title
  • Re:Transitivity and Graphs for SQL
label
  • Re:Transitivity and Graphs for SQL
atom:published
  • 2008-09-08T16:53:46Z
type
is link of
is has reply of
is atom:contains of
is atom:entry of
is container of of
Faceted Search & Find service v1.17_git122 as of Jan 03 2023


Alternative Linked Data Documents: iSPARQL | ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Apr 5 2024, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (30 GB total memory, 26 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software