Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-09-13
2009-12-01
Pham, Khanh B (Department: 2166)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
07627570
ABSTRACT:
A method of matching subscriptions to published documents in a content-routed network involves receiving subscription information, receiving published documents, storing the subscription information and the published documents in memory, instructing an accelerator of the locations in memory of the published documents, transferring portions of the stored published documents from the memory to the accelerator on an as-needed basis, providing the subscription information to the accelerator, and processing the portions in the accelerator to perform subscription matching in the accelerator independently of other functions in the content-router. The accelerator preferably includes a pipeline. In this way, efficiently highly scalable subscription matching can be performed efficiently on a very large number of subscriptions.
REFERENCES:
patent: 5778371 (1998-07-01), Fujihara
patent: 5829025 (1998-10-01), Mittal
patent: 5881278 (1999-03-01), Tran et al.
patent: 6189068 (2001-02-01), Witt et al.
patent: 6243760 (2001-06-01), Armbruster et al.
patent: 6504819 (2003-01-01), Fowler et al.
patent: 6560681 (2003-05-01), Wilson et al.
patent: 6606625 (2003-08-01), Muslea et al.
patent: 6728753 (2004-04-01), Parasnis et al.
patent: 6785228 (2004-08-01), Vandette et al.
patent: 6810526 (2004-10-01), Menard et al.
patent: 7103181 (2006-09-01), Ananth
patent: 7200110 (2007-04-01), Burns et al.
patent: 2001/0018697 (2001-08-01), Kunitake et al.
patent: 2002/0004820 (2002-01-01), Baldwin et al.
patent: 2002/0056100 (2002-05-01), Shimomura et al.
patent: 2002/0059224 (2002-05-01), McConnell et al.
patent: 2003/0018692 (2003-01-01), Ebling et al.
patent: 2003/0193676 (2003-10-01), Lapstun
patent: 2004/0076154 (2004-04-01), Mizutani et al.
patent: 2004/0111420 (2004-06-01), Hofstee et al.
patent: 2004/0114810 (2004-06-01), Boliek et al.
patent: 2005/0010653 (2005-01-01), McCanne
patent: 2005/0067498 (2005-03-01), Smith
patent: 2005/0097514 (2005-05-01), Nuss
patent: 2005/0108518 (2005-05-01), Pandya
patent: 2005/0135418 (2005-06-01), Betts et al.
patent: 2005/0137998 (2005-06-01), Betts et al.
patent: 2005/0138038 (2005-06-01), Betts et al.
patent: 2005/0152286 (2005-07-01), Betts et al.
patent: 2006/0026162 (2006-02-01), Salmonsen et al.
patent: WO 03/39105 (2003-08-01), None
Hauswirth, et al., “A component and communication model for push systems”, Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering, Dec. 1999, ACM Press, p. 20-38.
Motorola, “Integrated Datacasting Solutions for Digital Television”, Jun. 1999, Motorola, XP-0002204351, p. 1-13.
Jones, et al., “Garbage Collection: Algorithms for Automatic Dynamic Memory Management”, Dec. 1996, John Wiley & Sons, p. xxiv, 15, 210, 219, 229.
Department of Computer Science, Iowa State University., “Specification and Verification Component Based Systems”, Oct. 2004, ACM SIGSOFT 04, ACM Press, 153 pages.
Kittitornkun et al, “Mapping Deep Nested Do-Loop DSP Algorithms to Large Scale FPGA Array Structures”, Apr. 2003, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 11, No. 2, p. 208-217.
Aksoy et al, “Research in Data Broadcast and Dissemination”, Dec. 1998, 15 pages.
Labovitz et al, “Internet Routing Instability”, Oct. 1998, IEEE Trans. on Networking, vol. 6, No. 5, p. 515-528, <Retrieved from IEEE Explore Jan. 31, 2009>.
Fuhr, “Probabilistic Datalog: Implementing Logical Information Retrieval for Advanced Applications”, Jan. 2000, Journal of the American Society for Information Science, p. 95-110, <Retrieved from internet Jan. 28, 2009>.
Chatterjee et al, “Recursive Array Layouts and Fast Matrix Multiplication”, Nov. 2002, IEEE Transactions on Parallel and Distributed Systems, vol. 13, No. 11, p. 1105-1123, <Retrieved from IEEE Explore Jan. 28, 2009>.
Castro et al, “SCRIBE: A large-scale and decentralized application-level multicast infrastructure”, Oct. 2002, IEEE Journal on Selected Areas in Communications, p. 100-110, <Retrieved from IEEE Explore Jan. 31, 2009>.
Crainiceanu et al, “Querying Peer-to-Peer Networks Using P-Trees”, Aug. 2004, Seventh Intl. Workshop on the Web and Database, WebDB 2004, p. 1-6, <Retrieved from ACM Portal Jan. 31, 2009>.
Lo et al, “Recursive Neural Filters and Dynamical Range Transformers”, Mar. 2004, Proceedings of the IEEE, vol. 92, No. 3, p. 514-535, <Retrieved from IEEE Explore Jan. 31, 2009>.
Chawathe et al, “A Case Study in Building Layered DHT Applications”, Aug. 2005, ACM SIGCOMM'05, p. 1-10, <Retrieved from ACM Portal Jan. 31, 2009>.
Papemmanouil et al, “SemCast: Semantic Multicast for Content-based Data Dissemination”, Apr. 2005, Proceedings of the 21st Intl. Conf. on Data Engineering (ICDE 2005), p. 1-12, <Retrieved from IEEE Explore Jan. 31, 2009>.
Diao et al, “Path Sharing and Predicate Evaluation for High-Performance XML Filtering”, Dec. 2003, ACM TODS, ACM Press, p. 467-516, <Retrieved from ACM Portal May 6, 2009 -this is a date publication stamped version of AAPA YFilter article copy undated ref Jun. 4, 2008>.
Chand et al “A Scalable Protocol for Content-based Routing in Overlay Networks” Network Computing and applications NCA 2003, 2nd IEEE International Symposium, Apr. 16-18, 2003, Proceedings, pp. 123-130.
Taylor, et al, “Scalable IP Lookup for Programmable Routers”, INFOCOM 2002, 21st Annual Joint Conference of the IEEE Computer and Communications Societies, Jun. 23-27, 2002, Proceedings vol. 2. pp. 562-671.
Sheldon, “Content Routing: A Scalable Architecture for Network-based Information Discovery”, Massachusetts Inst. of Science, Thesis, Oct. 11, 1995 [retrieved on Jul. 12, 2005].
Fengyun et al “Efficient Event Routing In Content-based Publish-subscribe Service networks”, INFOCOM 2004, 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 7-11, 2004, Proceedings vol. 2, pp. 929-940.
Virgillito et al, On Event Routing in Content-based Publish/subscribe Through Dynamic Networks, Distributed Computing Systems, FIDCS 2003, The 9th IEEE Workshop on Future Trends, May 28-30, 2003, Proceedings, pp. 322-328.
Gupta et al, “The View Selection Problem for XML Content Based Routing”, ACM SIAMOD/ PODS 2003 Conference, San Diego, CA Jun. 9-12, 2003 [retrieved on Jul. 12, 2005].
A Routing Scheme for Content-Based Networking, Antonia Carzaniga et al, University of Colorado, Department of Computer Science, Technical Report CU-CS-953-03, Jun. 2003.
Processing XML Streams with Deterministic Automata and Stream Indexes, Todd J. Green et. al, ACM Transactions on Computational Logic, vol. ??, No. 4, 12, 2004.
XML Extensible Markup Language, WC3 Recommendation Feb. 4, 2004.
XML Path Language, WC3 Recommendation, Nov. 1999.
Efficient Filtering of XML Documents for Selective Dissemination of Information, Mehmet Atmel, Proceedings of 26th VLDB Conference, Nov. 2000.
Path Sharing and Predicate Evaluation for High-Performance XML filtering Yanlei Diao et al., ACM Transactions on Database Systems, Mar. 2003.
Efficient Filtering of XML Documents with XPath Expressions, Chee-Yong Chang et al., Bell Laboratories ,Lucent Technologies, Dec. 2002.
Deep Packet Inspection using Parallel Bloom Filters, Sarang Dharmapurikar et al., Computer Science and Engineering Department, Washington University in Saint Louis, Jan. 2004.
Exclusion Based Signature Matching for Intrusion Detection, Evangelos P. Markatos et al, Foundation for Research and Technology, Hellas, Nov. 2002.
Deterministic String Matching Algorithms for Intrusion Detection, Nathan Tuck et al, Department of Computer Science and Engineering, University of California, Mar. 2004.
Bosloy Jonathan
Funnekotter Edward
Mitchell Charles
Whelan Jason
(Marks & Clerk)
Mitchell Richard J.
Pham Khanh B
Solace Systems Inc.
LandOfFree
Highly scalable subscription matching for a content routing... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Highly scalable subscription matching for a content routing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Highly scalable subscription matching for a content routing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4144951