Source: http://www.google.fr/patents/US7953721
Timestamp: 2013-05-24 13:37:55
Document Index: 515118253

Matched Legal Cases: ['art. 6', 'art. 6', 'art. 1', 'art, 1', 'art, 1', 'Art, 35', 'Art, 1', 'Art, 5', 'art. 2', 'art. 2']

Brevet US7953721 - Integrated search engine devices that support database key dumping and ... - Google�BrevetsRecherche Images Maps Play YouTube Actualit�s Gmail Drive Plus » Recherche avanc�e dans les brevets | Historique Web | Connexion Recherche avanc�e dans les brevets BrevetsMethods of operating a search engine device include repeatedly reading next keys (and associated handles) from a database within the search engine device in order to identify and transfer some or possibly all of the contents of the database to another device (e.g., command host) requesting the database...http://www.google.fr/patents/US7953721?utm_source=gb-gplus-shareBrevet US7953721 - Integrated search engine devices that support database key dumping and methods of operating same Num�ro de publicationUS7953721 B1Type de publicationOctroi Num�ro de demande11/963,041 Date de publication31 mai 2011 Date de d�p�t21 d�c. 2007 Date de priorit�27 nov. 2006 InventeursDavid Walter CarrGary Depelteau Cessionnaire d'origineNetlogic Microsystems, Inc.Netlogic Microsystems International LimitedNetlogic Microsystems Caymans LimitedSilicon Valley BankIntegrated Device Technology, Inc. Classification aux �tats-Unis707/706707/778 Classification internationaleG06F17/30 Classification coop�rativeG06F17/30327 Classification europ�enneG06F 17/30S2P3R�f�rencesCitations de brevets (102)Citations hors brevets (59) R�f�renc� par (1)Liens externesUSPTO Cession USPTO EspacenetIntegrated search engine devices that support database key dumping and methods of operating sameUS 7953721 B1 R�sum� Methods of operating a search engine device include repeatedly reading next keys (and associated handles) from a database within the search engine device in order to identify and transfer some or possibly all of the contents of the database to another device (e.g., command host) requesting the database contents. An operation to read a next key includes: (i) searching a pipelined database within the search engine device with a first key to identify at least one key therein that is greater than the first key and then (ii) executing a next key fetch operation in the pipelined database to identify the next key from the at least one key. The next key and a handle associated with the next key are then retrieved from the search engine device (e.g., transferred to a command host).
Citations de brevets Brevet cit� Date de d�p�t Date de publication D�posant TitreUS446465010 ao�t 19817 ao�t 1984Sperry CorporationApparatus and method for compressing data signals and restoring the compressed data signalsUS460600217 ao�t 198312 ao�t 1986Wang Laboratories, Inc.B-tree structured data base using sparse array bit maps to store inverted listsUS522811512 f�vr. 199213 juil. 1993International Business Machines CorporationHybrid backtrack/lookahead search technique for constraint-satisfaction problemsUS543086929 mai 19914 juil. 1995Hewlett-Packard CompanySystem and method for restructuring a B-TreeUS544688717 sept. 199329 ao�t 1995Microsoft CorporationOptimal reorganization of a B-treeUS547583717 janv. 199512 d�c. 1995Hewlett-Packard CompanyMethod and system for restructuring a B-Tree for managing data during a node splitting operationUS556000718 oct. 199524 sept. 1996Borland International, Inc.B-tree key-range bit map index optimization of database queriesUS564476328 juin 19951 juil. 1997Sybase, Inc.Database system with improved methods for B-tree maintenanceUS566649431 mars 19959 sept. 1997Samsung Electronics Co., Ltd.Queue management mechanism which allows entries to be processed in any orderUS575802425 juin 199626 mai 1998Microsoft CorporationMethod and system for encoding pronunciation prefix treesUS575835612 sept. 199526 mai 1998Hitachi Software Engineering Co., Ltd.High concurrency and recoverable B-tree index management method and systemUS578743030 juin 199428 juil. 1998International Business Machines CorporationVariable length data sequence backtracking a trie structureUS581285311 avr. 199422 sept. 1998Lucent Technologies Inc.Method and apparatus for parsing source code using prefix analysisUS58129966 nov. 199522 sept. 1998Sybase, Inc.Database system with methods for optimizing query performance with a buffer managerUS581300014 mars 199622 sept. 1998Sun Micro SystemsB tree structure and methodUS582274928 f�vr. 199713 oct. 1998Sybase, Inc.Database system with methods for improving query performance with cache optimization strategiesUS589765510 d�c. 199627 avr. 1999International Business Machines CorporationSystem and method for cache replacement within a cache set based on valid, modified or least recently used status in order of preferenceUS591824513 mars 199629 juin 1999Sun Microsystems, Inc.Microprocessor having a cache memory system using multi-level cache set predictionUS592411529 mars 199613 juil. 1999Interval Research CorporationHierarchical memory architecture for a programmable integrated circuit having an interconnect structure connected in a tree configurationUS60353268 sept. 19977 mars 2000International Business Machines CorporationMapping table lookup optimization systemUS604105318 sept. 199721 mars 2000Microsfot CorporationTechnique for efficiently classifying packets using a trie-indexed hierarchy forest that accommodates wildcardsUS609815017 nov. 19951 ao�t 2000Sun Microsystems, Inc.Method and apparatus for fetching information from a cache memoryUS61157929 nov. 19995 sept. 2000Advanced Micro Devices, Inc.Way prediction logic for cache arrayUS613812315 juil. 199724 oct. 2000Rathbun; Kyle R.Method for creating and using parallel data structuresUS62196629 juil. 199817 avr. 2001International Business Machines CorporationSupporting database indexes based on a generalized B-tree indexUS638950714 janv. 200014 mai 2002Gigabus, Inc.Memory device search system and methodUS640111731 mars 19994 juin 2002Intel CorporationPlatform permitting execution of multiple network infrastructure applicationsUS640475227 ao�t 199911 juin 2002International Business Machines CorporationNetwork switch using network processor and methodsUS64217301 avr. 199916 juil. 2002Intel CorporationProgrammable system for processing a partitioned network infrastructureUS643052726 ao�t 19986 ao�t 2002Avici SystemsPrefix search circuitry and methodUS64410538 juin 199927 ao�t 2002The Trustees Of The University Of PennsylvaniaInhibitors of glycogen synthase kinase-3 and methods for identifying and using the sameUS646011222 juin 19991 oct. 2002Netlogic Microsystems, LlcMethod and apparatus for determining a longest prefix match in a content addressable memory deviceUS646012027 ao�t 19991 oct. 2002International Business Machines CorporationNetwork processor, memory organization and methodsUS648083918 juil. 200012 nov. 2002Go2Market.ComSystem and method for improving database data manipulation using direct indexing within a B*tree index having a tunable index organizationUS649059230 d�c. 19993 d�c. 2002Nortel Networks LimitedMethod of and apparatus for generating a tree data structure supporting longest match lookupUS652263225 juin 199818 f�vr. 2003Avici SystemsApparatus and method for efficient prefix searchUS652605520 oct. 199825 f�vr. 2003Sun Microsystems, Inc.Method and apparatus for longest prefix address lookupUS653245714 juil. 200011 mars 2003Ezchip Technologies Ltd.Look-ahead tree structureUS653549129 nov. 199918 mars 2003Cisco Technology, Inc.Method and apparatus for rapidly reconfiguring computer networks using a spanning tree algorithmUS65393698 d�c. 200025 mars 2003Mosaid Technologies, Inc.Method and apparatus for storing sparse and dense subtrees in a longest prefix match lookup tableUS65533704 oct. 200022 avr. 2003Lsi Logic CorporationFlexible search engine having sorted binary search tree for perfect matchUS65642114 oct. 200013 mai 2003Lsi Logic CorporationFast flexible search engine for longest prefix matchUS66118329 oct. 200126 ao�t 2003International Business Machines Corp.Data structure for longest-matching prefix searching and updating method for search table data structuresUS661478929 d�c. 19992 sept. 2003Erlang Technology, Inc.Method of and apparatus for matching strings of different lengthsUS663386523 d�c. 199914 oct. 2003Pmc-Sierra LimitedMultithreaded address resolution systemUS663684922 nov. 200021 oct. 2003Genmetrics, Inc.Data search employing metric spaces, multigrid indexes, and B-grid treesUS66369566 juil. 200121 oct. 2003Cypress Semiconductor Corp.Memory management of striped pipelined data structuresUS666228718 oct. 20019 d�c. 2003Lsi Logic CorporationFast free memory address controllerUS66911244 avr. 200110 f�vr. 2004Cypress Semiconductor Corp.Compact data structures for pipelined message forwarding lookupsUS669432327 janv. 200317 f�vr. 2004Sybase, Inc.System and methodology for providing compact B-TreeUS66972761 f�vr. 200224 f�vr. 2004Netlogic Microsystems, Inc.Content addressable memory deviceUS67076935 juin 200216 mars 2004Netlogic Microsystems, Inc.Content addressable memory with simultaneous write and compare functionUS675777931 oct. 200129 juin 2004Netlogic Microsystems, Inc.Content addressable memory with selectable mask write modeUS67687399 f�vr. 200027 juil. 2004Nec CorporationRouter with a cache having a high hit probabilityUS67785308 nov. 199917 ao�t 2004Juniper Networks, Inc.Method and apparatus for multiple field matching in network deviceUS67823827 mars 200124 ao�t 2004International Business Machines CorporationPrefix search method and data structure using compressed search tablesUS683185018 nov. 200314 d�c. 2004Netlogic Microsystems, Inc.Content addressable memory with configurable class-based storage partitionUS683980028 ao�t 20024 janv. 2005Hywire Ltd.RAM-based range content addressable memoryUS685945510 nov. 200022 f�vr. 2005Erlang Technology, Inc.Method and apparatus for building and using multi-dimensional index trees for multi-dimensional data objectsUS68684143 janv. 200115 mars 2005International Business Machines CorporationTechnique for serializing data structure updates and retrievals without requiring searchers to use locksUS692843023 avr. 20029 ao�t 2005Integrated Silicon Solution, Inc.Prefix match search schemeUS693479531 oct. 200123 ao�t 2005Netlogic Microsystems, Inc.Content addressable memory with programmable word width and programmable priorityUS694131415 avr. 20026 sept. 2005Lsi Logic CorporationUser selectable editing protocol for fast flexible search engineUS694470931 oct. 200113 sept. 2005Netlogic Microsystems, Inc.Content addressable memory with block-programmable mask write mode, word width and priorityUS70070272 d�c. 200228 f�vr. 2006Microsoft CorporationAlgorithm for tree traversals using left linksUS701690425 avr. 200121 mars 2006Altera CorporationMethod and system for rapid insertion of various data streams into sorted tree structuresUS70170214 avr. 200121 mars 2006Cypress Semiconductor Corp.High-speed message forwarding lookups for arbitrary length strings using pipelined memoriesUS702380712 nov. 20024 avr. 2006Cathey James ENetwork switching device with pipelined search enginesUS703584425 f�vr. 200225 avr. 2006Lsi Logic CorporationFFS search and edit pipeline separationUS704731714 juin 200016 mai 2006Altera CorporationHigh performance network address processor systemUS70624998 janv. 200213 juin 2006Intel CorporationEnhanced multiway radix tree and related methodsUS707660221 oct. 200311 juil. 2006Hywire Ltd.Multi-dimensional associative search engine having an external memoryUS71072638 d�c. 200012 sept. 2006Netrics.Com, Inc.Multistage intelligent database search methodUS711040724 mars 200119 sept. 2006Netlogic Microsystems, Inc.Method and apparatus for performing priority encoding in a segmented classification system using enable signalsUS716257212 oct. 20049 janv. 2007Spans Logic Inc.Memory and power efficient mechanism for fast table lookupUS72313831 mai 200212 juin 2007Lsi CorporationSearch engine for large-width dataUS724619815 juin 200517 juil. 2007Netlogic Microsystems, Inc.Content addressable memory with programmable word width and programmable priorityUS725753012 f�vr. 200314 ao�t 2007Hongfeng YinMethod and system of knowledge based search engine using text miningUS728997910 d�c. 200330 oct. 2007Alcatel LucentParallel asymmetric binary search on lengthsUS729216212 juil. 20066 nov. 2007Cisco Systems, Inc.Data coding system and methodUS738327630 janv. 20043 juin 2008Microsoft CorporationConcurrency control for B-trees with node deletionUS742651828 mars 200316 sept. 2008Netlogic Microsystems, Inc.System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded sizeUS74373547 mai 200414 oct. 2008Netlogic Microsystems, Inc.Architecture for network search engines with fixed latency, high capacity, and high throughputUS747810915 mars 200413 janv. 2009Cisco Technology, Inc.Identification of a longest matching prefix based on a search of intervals corresponding to the prefixesUS757115625 mars 20044 ao�t 2009Netlogic Microsystems, Inc.Network device, storage medium and methods for incrementally updating a forwarding databaseUS760334613 f�vr. 200713 oct. 2009Netlogic Microsystems, Inc.Integrated search engine devices having pipelined search and b-tree maintenance sub-engines thereinUS765361913 f�vr. 200726 janv. 2010Netlogic Microsystems, Inc.Integrated search engine devices having pipelined search and tree maintenance sub-engines therein that support variable tree heightUS769751815 sept. 200613 avr. 2010Netlogic Microsystems, Inc.Integrated search engine devices and methods of updating same using node splitting and merging operationsUS780542728 sept. 200728 sept. 2010Netlogic Microsystems, Inc.Integrated search engine devices that support multi-way search trees having multi-column nodesUS783162620 sept. 20079 nov. 2010Netlogic Microsystems, Inc.Integrated search engine devices having a plurality of multi-way trees of search keys therein that share a common root nodeUS200100436028 d�c. 200022 nov. 2001Mosaid Technologies, Inc.Method and apparatus for an incremental update of a longest prefix match lookup tableUS2002008993714 nov. 200111 juil. 2002Gupta PankajPacket matching method and systemUS200201165268 d�c. 200022 ao�t 2002Mosaid Technologies, Inc.Method and apparatus for longest match address lookupUS200201460094 avr. 200110 oct. 2002Netlogic Microsystems Caymans LimitedHigh-speed message forwarding lookups for arbitrary length strings using pipelined memoriesUS200201477214 avr. 200110 oct. 2002Netlogic Microsystems Caymans LimitedCompact data structures for pipelined message forwarding lookupsUS2002015241311 juin 200217 oct. 2002Carvey Philip P.Prefix search circuitry and methodUS2002016196931 oct. 200131 oct. 2002Netlogic Microsystems, Inc.Content addressable memory with programmable word width and programmable priorityUS200300094533 juil. 20019 janv. 2003International Business Machines CorporationMethod and system for performing a pattern match search for text stringsUS2003000946621 juin 20019 janv. 2003Zarlink Semiconductor V.N., Inc.Search engine with pipeline structureUS200300936139 ao�t 200215 mai 2003Sherman DavidCompressed ternary mask system and methodUS2006009543929 oct. 20044 mai 2006Sap AktiengesellschaftMaster data frameworkUSRE4093231 oct. 20026 oct. 2009Netlogic Microsystems, Inc.Content addressable memory (CAM) devices that perform pipelined multi-cycle look-up operations using cam sub-arrays and longest match detectionCitations hors brevetsR�f�rence1Agarwal et al. "A Model for Hierarchical Memory" Jan. 1987 Proceedings of the nineteenth annual ACM conference on Theory of computing STOC '87 Publisher: ACM Press.2Answers.com, http://www.answers.com/topic/b-tree, B~tree: Information From Answers.com, Admitted prior art. 6 pages.3Answers.com, http://www.answers.com/topic/b-tree, B�tree: Information From Answers.com, Admitted prior art. 6 pages.4Bayer, R. et al., "Prefix B-Trees," ACM Trans. On Database Systems, vol. 2, No. 1, Mar. 1977, pp. 11-26.5Bender et al. "Cache-oblivious B-trees", SIAM J. Comput, 2000, pp. 1-18.6B-tree, http://en.wikipedia.org/wiki/B%2A-tree, Admitted prior art. 1 page.7B-Trees: Balanced Tree Data Structures, http://www.bluerwhite.org/btree/, Admitted Prior Art, Printed, 8 pages.8Canonical form http://en.wikipedia.org/wiki/Canonical-form, Admitted prior art, 1 page.9Canonical form http://en.wikipedia.org/wiki/Canonical�form, Admitted prior art, 1 page.10Chang et al., "Dynamic Routing Tables using Augmented Balanced Search Tree," National Cheng Kung University and I-Shou University, Admitted Prior Art, 35 pages.11Choudhury et al. "A New Buffer Management Scheme for Hierarchical Shared Memory Switches" Oct. 1997 IEEE/ACM Transactions on Networking (TON), vol. 5 Issue 5 Publisher: IEEE Press.12Djordjevic et al. "A Hierarchical memory system environment" Jun. 1998 Proceedings of the 1998 workshop on Computer architecture education WCAE '98 Publisher: ACM Press.13Final Office Action dated Aug. 4, 2009 for U.S. Appl. No. 11/674,487, 22 Pages.14Final Office Action dated Dec. 30, 2010 for U.S. Appl. No. 11/963,142.15Final Office Action dated Dec. 8, 2009 for U.S. Appl. No. 11/768,646, 13 Pages.16Final Office Action dated Feb. 4, 2011 for U.S. Appl. No. 11/934,240.17Final Office Action dated Jan. 13, 2011 for U.S. Appl. No. 11/768,646.18Final Office Action dated Mar. 26, 2010 for U.S. Appl. No. 11/864,290.19Final Office Action dated Nov. 24, 2009 for U.S. Appl. No. 11/685,982, 20 Pages.20Final Office Action dated Sep. 10, 2008 for U.S. Appl. No. 11/184,243, 15 Pages.21Henry Hong-yi Tzeng, "Longest Prefix Search Using Compressed Trees", In Proceedings of IEEE Globe.com, 1998.22Kobayashi et al. "A Longest Prefix Match Search Engine for Multi-Gigabit IP Processing", C&C Media Research Laboratories, NEC Corporation 2000 IEEE.23Lu et al., "A B-Tree Dynamic Router-Table Design", IEEE Transactions on Computers, 54:7, pp. 1-27, http:!/www.cise.ufl.edu/-sahn/papers/btree.odf, (Jul. 2005).24Microsoft Computer Dictionary, 2002, Microsoft Press, Fifth Edition, p. 329.25Nasser Yazdani et al., "Prefix Trees: New Efficient Data Structures for Matching Strings of Different Lengths", IEEE, 2001, p. 76-85.26Network address processor makes embedded DRAM a virtue, http://www.electronicproducts.com/print.asp?ArticleURL=oct12.oct2000, Printed Aug. 14, 2006, Admitted Prior Art, 1 page.27Non-final Office Action dated Apr. 1, 2009 for U.S. Appl. No. 11/532,225, 8 Pages.28Non-final Office Action dated Dec. 11, 2008 for U.S. Appl. No. 11/674,474, now Issued Patent 7,603,346 , 22 Pages.29Non-final Office Action dated Dec. 11, 2008 for U.S. Appl. No. 11/674,487, 23 Pages.30Non-final Office Action dated Dec. 17, 2009 for U.S. Appl. No. 11/184,843, 18 Pages.31Non-final Office Action dated Jul. 21, 2009 for U.S. Appl. No. 11/685,982, 20 Pages.32Non-final Office Action dated Jun. 25, 2009 for U.S. Appl. No. 11/184,243, 15 Pages.33Non-final Office Action dated Jun. 25, 2009 for U.S. Appl. No. 11/768,646, 12 Pages.34Non-final Office Action dated Mar. 18, 2009 for U.S. Appl. No. 11/184,243, 15 Pages.35Non-final Office Action dated Nov. 15, 2007 for U.S. Appl. No. 11/184,243, 18 Pages.36Non-final Office Action dated Oct. 15, 2009 for U.S. Appl. No. 11/864,290, 15 Pages.37Non-Final Office Action dated Oct. 22, 2010 for U.S. Appl. No. 11/934,240.38Non-final Office Action dated Sep. 10, 2009 for U.S. Appl. No. 11/532,225, 8 Pages.39Non-Final Office Action dated Sep. 30, 2010 for U.S. Appl. No. 11/768,646.40Non-Final Office Action mailed Jul. 21, 2010 for U.S. Appl. No. 11/963,142.41Non-Final Office Action mailed Jun. 21, 2010 for U.S. Appl. No. 11/858,441.42Notice of Allowance dated Apr. 2, 2010 for U.S. Appl. No. 11/184,243.43Notice of Allowance dated Aug. 7, 2009 for U.S. Appl. No. 11/674,474, now Issued Patent 7,603,346 , 13 Pages.44Notice of Allowance dated Dec. 2, 2009 for U.S. Appl. No. 11/674,487, 11 Pages.45Notice of Allowance dated Jan. 12, 2010 for U.S. Appl. No. 11/532,225, 6 Pages.46Notice of Allowance dated Mar. 31, 2010 for U.S. Appl. No. 11/685,982.47Notice of Allowance mailed Jul. 13, 2010 for U.S. Appl. No. 11/864,290.48Notice of Allowance mailed Sep. 22, 2010 for U.S. Appl. No. 11/858,441.49O'Connor et al., "The iFlow Address Processor," 2001 IEEE, pp. 16-23.50Srinivasan et al. "Fast Address Lookups Using Controlled Prefix Expansion" Washington University in St. Louis, ACM Sigmetrics '98/ Performance '98 Joint International Conference on Measurement and Modeling of Computer Systems.51Suri et al., "Multiway Range Trees: Scalable IP Lookup with Fast Updates," http:!www.cs.edu/-Varghese/PAPERS/globecome2001.pdf, Admitted Prior Art, 5 pages.52Tree (data structure), http://en.wikipedia.org/wiki/Tree-data-structure, (Redirected from Tree data structure, Admitted prior art. 2 pages.53Tree (data structure), http://en.wikipedia.org/wiki/Tree�data�structure, (Redirected from Tree data structure, Admitted prior art. 2 pages.54U.S. Appl. No. 11/184,243, filed Jul. 9, 2005, Depelteau, Gary.55U.S. Appl. No. 11/685,982, filed Mar. 14, 2007, Depelteau, Gary.56U.S. Appl. No. 11/934,240, filed Nov. 2, 2007, Depelteau, Gary.57U.S. Appl. No. 11/963,142, filed Dec. 21, 2007, Depelteau, Gary.58U.S. Appl. No. 12/336,565, filed Dec. 17, 2008, Carr, D. W.59Uga et al. "A fast and compact longest match prefix look-up method using pointer cache for very long network address", IT Network Service Systems Laboratories Midori 3-9-1 1, Musashino, Tokyo 180-8585, Japan, 1999 IEEE. R�f�renc� par Brevet citant Date de d�p�t Date de publication D�posant TitreUS808664117 d�c. 200827 d�c. 2011Netlogic Microsystems, Inc.Integrated search engine devices that utilize SPM-linked bit maps to reduce handle memory duplication and methods of operating sameFaire pivoterImage d'origineAccueil Google - Plan du site - T�l�chargements par lot sur l'USPTO - R�gles de confidentialit� - Conditions d'utilisation - � propos de Google�Brevets - Envoyer des commentairesDonn�es fournies par IFI CLAIMS Patent Services©2012 Google