Graph caching

Details Graph caching Graph caching

2007-11-01

2011-12-27

Jalil, Neveen Abel (Department: 2165)

Data processing: database and file management or data structures

Database and file access

Preparing data for information retrieval

Reexamination Certificate

active

08086609

ABSTRACT:
In a method and apparatus for analyzing nodes of a Deterministic Finite Automata (DFA), an accessibility ranking, based on a DFA graph geometrical configuration, may be determined in order to determine cacheable portions of the DFA graph in order to reduce the number of external memory accesses. A walker process may be configured to walk the graph in a graph cache as well as main memory. The graph may be generated in a manner allowing each arc to include information if the node it is pointing to is stored in the graph cache or in main memory. The walker may use this information to determine whether or not to access the next arc in the graph cache or in main memory.

REFERENCES:
patent: 5781757 (1998-07-01), Deshpande
patent: 6799248 (2004-09-01), Scherr
patent: 2001/0021959 (2001-09-01), Holmberg et al.
patent: 2002/0099909 (2002-07-01), Meyer
patent: 2005/0246700 (2005-11-01), Archambault et al.
patent: 2006/0069872 (2006-03-01), Bouchard et al.
patent: 2006/0075206 (2006-04-01), Bouchard et al.
patent: 2006/0077979 (2006-04-01), Dubrovsky et al.
patent: 2006/0085533 (2006-04-01), Hussain et al.
patent: 2006/0101195 (2006-05-01), Jain
patent: 2006/0265552 (2006-11-01), Davis et al.
patent: 2007/0038798 (2007-02-01), Bouchard et al.
patent: 2008/0271141 (2008-10-01), Goldman et al.

Affiliated with

Also associated with

Rating

Graph caching does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Graph caching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph caching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4254854