Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

175

Voted

SIGMOD
2007
ACM

142views Database» more SIGMOD 2007»

Fast and practical indexing and querying of very large graphs

16 years 2 months ago

Fast and practical indexing and querying of very large graphs

Download wwwcs.upb.de

Silke Trißl, Ulf Leser

Real-time Traffic

Database | Practical Indexing | SIGMOD 2007 |

claim paper

Related Content

» A hierarchical approach to reachability query answering in very large graph databases

» Scalable join processing on very large RDF graphs

» GADDI distance index based subgraph matching in biological networks

» Fast Computation of Reachability Labeling for Large Graphs

» Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns

» A Uniform Framework for AdHoc Indexes to Answer Reachability Queries on Large Graphs

» Approximate Processing of Multiway Spatial Joins in Very Large Databases

» Ghash towards fast kernelbased similarity search in large graph databases

» GRAIL Scalable Reachability Index for Large Graphs

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2007
Where	SIGMOD
Authors	Silke Trißl, Ulf Leser

Comments (0)