Method and/or system for performing tree matching

Details Method and/or system for performing tree matching Method and/or system for performing tree matching

2004-12-07

2009-11-17

Cottingham, John R. (Department: 2167)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

07620632

ABSTRACT:
Embodiments of methods, apparatuses, devices and/or systems for performing tree matching are disclosed.

REFERENCES:
patent: 4156910 (1979-05-01), Barton et al.
patent: 4745561 (1988-05-01), Hirosawa et al.
patent: 4751684 (1988-06-01), Holt
patent: 4905138 (1990-02-01), Bourne
patent: 4931928 (1990-06-01), Greenfeld
patent: 4949388 (1990-08-01), Bhaskaran
patent: 4989132 (1991-01-01), Mellender et al.
patent: 4991087 (1991-02-01), Burkowski et al.
patent: 5021943 (1991-06-01), Grimes
patent: 5021992 (1991-06-01), Kondo
patent: 5191522 (1993-03-01), Bosco et al.
patent: 5235701 (1993-08-01), Ohler et al.
patent: 5265245 (1993-11-01), Nordstrom et al.
patent: 5295261 (1994-03-01), Simonetti
patent: 5335345 (1994-08-01), Frieder et al.
patent: 5509088 (1996-04-01), Robson
patent: 5598350 (1997-01-01), Kawanishi et al.
patent: 5606669 (1997-02-01), Bertin et al.
patent: 5724512 (1998-03-01), Winterbottom
patent: 5724576 (1998-03-01), LeTourneau
patent: 5758152 (1998-05-01), LeTourneau
patent: 5781906 (1998-07-01), Aggarwal et al.
patent: 5787415 (1998-07-01), Jacobson et al.
patent: 5787432 (1998-07-01), LeTourneau
patent: 5796356 (1998-08-01), Okada et al.
patent: 5848159 (1998-12-01), Collins et al.
patent: 5978790 (1999-11-01), Buneman et al.
patent: 5999926 (1999-12-01), Suciu
patent: 6002879 (1999-12-01), Radigan et al.
patent: 6055537 (2000-04-01), LeTourneau
patent: 6141655 (2000-10-01), Johnson et al.
patent: 6199103 (2001-03-01), Sakuguchi
patent: 6236410 (2001-05-01), Politis et al.
patent: 6289354 (2001-09-01), Aggarwal et al.
patent: 6292938 (2001-09-01), Sarkar et al.
patent: 6442584 (2002-08-01), Kolli et al.
patent: 6542899 (2003-04-01), Saulpaugh et al.
patent: 6550024 (2003-04-01), Pagurek et al.
patent: 6598052 (2003-07-01), Saulpaugh et al.
patent: 6606632 (2003-08-01), Saulpaugh et al.
patent: 6609130 (2003-08-01), Saulpaugh et al.
patent: 6611844 (2003-08-01), Saulpaugh et al.
patent: 6714939 (2004-03-01), Saldanha et al.
patent: 6785673 (2004-08-01), Fernandez et al.
patent: 6968330 (2005-11-01), Edwards et al.
patent: 7051033 (2006-05-01), Agarwal et al.
patent: 7072904 (2006-07-01), Najork et al.
patent: 7103838 (2006-09-01), Krishnamurthy et al.
patent: 7162485 (2007-01-01), Gottlob et al.
patent: 7191182 (2007-03-01), Anonsen et al.
patent: 7203774 (2007-04-01), Zhou et al.
patent: 7287026 (2007-10-01), Oommen
patent: 7313563 (2007-12-01), Bordawekar et al.
patent: 2002/0040292 (2002-04-01), Marcu
patent: 2002/0129129 (2002-09-01), Bloch et al.
patent: 2002/0133497 (2002-09-01), Draper et al.
patent: 2002/0169563 (2002-11-01), De Carvalho Ferreira
patent: 2003/0041088 (2003-02-01), Wilson et al.
patent: 2003/0065659 (2003-04-01), Agarwal et al.
patent: 2003/0130977 (2003-07-01), Oommen
patent: 2003/0167445 (2003-09-01), Su et al.
patent: 2003/0195885 (2003-10-01), Emmick et al.
patent: 2003/0195890 (2003-10-01), Oommen
patent: 2003/0236794 (2003-12-01), Hostetter et al.
patent: 2004/0010752 (2004-01-01), Chan et al.
patent: 2004/0103105 (2004-05-01), Lindblad et al.
patent: 2004/0215642 (2004-10-01), Cameron et al.
patent: 2004/0239674 (2004-12-01), Ewald et al.
patent: 2004/0254909 (2004-12-01), Testa
patent: 2004/0260683 (2004-12-01), Chan et al.
patent: 2005/0027743 (2005-02-01), O'Neil et al.
patent: 2005/0060332 (2005-03-01), Bernstein et al.
patent: 2005/0125432 (2005-06-01), Lin et al.
patent: 2005/0165732 (2005-07-01), Burges
patent: 2005/0187900 (2005-08-01), LeTourneau
patent: 2005/0267908 (2005-12-01), LeTourneau
patent: 2006/0015538 (2006-01-01), LeTourneau
patent: 2006/0095442 (2006-05-01), LeTourneau
patent: 2006/0095455 (2006-05-01), LeTourneau
patent: 2006/0123029 (2006-06-01), LeTourneau
patent: 2006/0129582 (2006-06-01), Schiffmann
patent: 2006/0259533 (2006-11-01), LeTourneau
patent: 2006/0271573 (2006-11-01), LeTourneau
patent: 2007/0198538 (2007-08-01), Palacios
“Pattern Matching in Trees”, Christoph M. Hoffman and Michael J. O'Donnell, Journal for the Association for Computing Machinery, vol. 29, No. 1, Jan. 1982, pp. 68-95.
Dubiner, M.,Galil, Z., and Magen, E. “Faster Tree Pattern Matching.” Journal of the Association for Computing Machinery. vol. 41, No. 2. Mar. 1994. pp. 205-213.
Ramesh, R. and Ramakrishnan, I. V. “Nonlinear Pattern Matching in Trees.” Journal of the Association for Computing Machinery, vol. 39, No. 2 Apr. 1992. pp. 295-316.
“Core Technology Benchmarks A White Paper”, Jul. 2002, downloaded from the internet Mar. 2, 2004.
“Origin Data, Inc. White Paper”, pp. 1-13.
“The Art of Computer Programming”, vol. 1 Fundamental Algorithms, Second edition, Addison-Wesley Series inComputer Science and Information Processing, ISBN 0-201-03809-9, Reading, Massachusetts, Copyright 1973.
“The Associative Model of Data White Paper”, Lazy Software, 2000.
Apostol, “A Centennial History of the Prime Number Theorem”, Engineering and Science, No. 4, 1996.
Cano et al., “Lazy Evaluation in Penniless Propagation over Join Trees”, Networks, vol. 39(4), 175-185, 2002.
Cooper et al., “Oh! Pascal!”, 1982, pp. 295-327.
Er, M.C., “Enumerating Ordered Trees Lexicographically”, Computation Journal, vol. 28, Issue 5, pp. 538-542, 1985.
Kharbutli et al., “Using Prime Numbers for Cache Indexing to Eliminate Conflict Misses”, 24 pages.
Kilpelainen, “Tree Matching Problems with Applications to Structured Text Databases”, Ph.D. Dissertation, Department of Computer Science, University of Helsinki, Report A-1992-6, Helsinki, Finland, pp. 1-109, Nov. 1992.
Letourneau, “The Elementary Theory of Object Oriented Arithmetic”, pp. 1-9, Apr. 1990.
Neven, Frank and Thomas Schwentick, “Expressive and efficient pattern languages for tree-structured data” Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 2000.
Sechrest et al., “Blending Hierarchical and Attribute-Based File Naming”, Distributed Computing System, 1992., Proceedings of the 12thInternational Conference on Jun. 9-12, 1992, pp. 572-580.
Shanmugasundaram et al., “Querying SML Views of Relational Data”, Proceedings of the 27thVLDB Conference, Roma, Italy, 2001.
Sitaraman, Krishna, Ranganathan, N., and Ejnioui, Abdel, “A VLSI Architecture for Object Recognition using Tree Matching” Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP'02) 2000.
Smorynski, Craig, “Logical Number Theory I: An Introduction”, Springer-Verlag, 1991, pp, 14-23, and 305.
Somani et al., “Phased-Mission System Analysis Using Boolean Algebraic Methods”, May 1994, ACM Press, vol. 22, Issue 1.
Stanat, D.F., and McAllister, D.F., “Discrete Mathematics in Computer Science”, Prentice-Hall, 1977, Section 3.2, Trees, p. 131-145.
Valiente, “Algorithms on Trees and Graphs”, pp. 151-251, Springer 2002.
Valiente, Gabriel, Chapter 4, “Tree Isomorphism,” of Algorithms on Trees and Graphs, published by Springer, 2002.
Zaks, S., “Lexicographic Generation of Ordered Trees”, The Journal of Theoretical Computer Science, vol. 10(1), pp. 63-82, 1980.
Office action: Restriction Requirement in co-pending U.S. Appl. No. 11/005,859, dated Dec. 12, 2007.
Response to Restriction Requirement in co-pending U.S. Appl. No. 11/005,859, dated Jan. 14, 2008.
Non-Final OA in co-pending U.S. Appl. No. 11/005,859, dated Mar. 21, 2008.
Preliminary Amendment in co-pending U.S. Appl. No. 11/007,139, dated Apr. 28, 2005.
Non-Final OA issued in co-pending pending U.S. Appl. No. 11/007,139 dated May 14, 2007.
Response to Non-Final OA in co-pending U.S. Appl. No. 11/007,139 dated Oct. 15, 2007.
Supplemental Amendment in co-pending U.S. Appl. No. 11/007,139 dated Oct. 17, 2007.
Non-Final OA issued in co-pending U.S. Appl. No. 11/007,139 dated Jan. 2, 2008.
Response to Non-Final OA in co-pending U.S. Appl. No. 11/007,139 dated Apr.

Affiliated with

Also associated with

Rating

Method and/or system for performing tree matching does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and/or system for performing tree matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and/or system for performing tree matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4081642