Ex Parte Parkkinen et alDownload PDFPatent Trial and Appeal BoardSep 28, 201613675634 (P.T.A.B. Sep. 28, 2016) Copy Citation UNITED STA TES p A TENT AND TRADEMARK OFFICE APPLICATION NO. FILING DATE FIRST NAMED INVENTOR 13/675,634 11113/2012 Jarmo Parkkinen 46161 7590 09/30/2016 Cantor Colburn LLP - IBM SVL 20 Church Street, 22nd Floor Hartford, CT 06103-3207 UNITED STATES DEPARTMENT OF COMMERCE United States Patent and Trademark Office Address: COMMISSIONER FOR PATENTS P.O. Box 1450 Alexandria, Virginia 22313-1450 www .uspto.gov ATTORNEY DOCKET NO. CONFIRMATION NO. GB920120113US 1 4773 EXAMINER SANTOS, PEDRO J ART UNIT PAPER NUMBER 2167 NOTIFICATION DATE DELIVERY MODE 09/30/2016 ELECTRONIC Please find below and/or attached an Office communication concerning this application or proceeding. The time period for reply, if any, is set in the attached communication. Notice of the Office communication was sent electronically on above-indicated "Notification Date" to the following e-mail address( es): USPTOPatentMail@cantorcolburn.com PTOL-90A (Rev. 04/07) UNITED STATES PATENT AND TRADEMARK OFFICE BEFORE THE PATENT TRIAL AND APPEAL BOARD Ex parte JARMO PARKKINEN, VILHO T. RAATIKKA, JARMO K. RUUTH, PETRI U. SOINI, and ANTONI WOLSKI Appeal2015-006107 Application 13/675,634 Technology Center 2100 Before LARRY J. HUME, LINZY T. McCARTNEY, and NATHAN A. ENGELS, Administrative Patent Judges. ENGELS, Administrative Patent Judge. DECISION ON APPEAL STATEMENT OF THE CASE Appellants appeal under 35 U.S.C. § 134(a) from the Final Rejection of claims 1, 3-5, 7-17, 19, and 20. Claims 2, 6, and 18 are canceled. We have jurisdiction under 35 U.S.C. § 6(b ). We affirm. Appeal2015-006107 Application 13/675,634 ILLUSTRATIVE CLAIM Claim 1, reproduced below, is illustrative of the claimed subject matter: 1. A data management method, comprising: creating a search index for a database which includes data stored in both a first memory comprising an in-memory storage and a second memory comprising a disk memory storage, said search index having a reference value of a first type that is a page pointer to the in memory storage or a second type that is a page disk address of a page in the disk memory; responsive to a data retrieval request, accessing data using said reference value from said first or said second memory; recalculating and altering said search index reference values based on data being migrated between said first and second memories. THE REJECTIONS Claims 1, 3-5, 7-17, 19, and 20 stand rejected under 35 U.S.C. § 103(a) as being unpatentable in view of Joan Guisado-Gamez et al., HYBRID IN-MEMORY AND ON-DISK TABLES FOR SPEEDING-UP TABLE ACCESSES (2010) and Hayashi et al. (US 5,568,638; Oct. 22, 1996) in further combination with various combinations of Celis et al. (US 2012/0072652 Al; Mar. 22, 2012), Chong et al. (US 7,809,674 B2; Oct. 5, 2010), and Shmueli et al. (US 2011/0208737 Al; Aug. 25, 2011). ANALYSIS The Final Action cites Guisado-Gamez as teaching creating a search index for a database that includes data stored in both in-memory storage and disk storage. Final Act. 3 (citing Guisado-Gamez § 2, § 2.2); Ans. 3--4. The Final Action also cites Hayashi as teaching a search index having a reference 2 Appeal2015-006107 Application 13/675,634 value of a first type that is a page pointer to the in memory storage or a second type that is a page disk address of a page in the disk memory. Final Act. 4 (citing Hayashi col. 2, 11. 58-64). Appellants state "Hayashi teaches a control system for a page group in a data processing system having a storage structure employing a non-dense B-tree cluster structure." Br. 6. Without additional analysis, Appellants contend "Hayashi ... is devoid of teaching a search index having a reference value of a first type that is a page pointer to the in-memory storage or a second type that is a page disk address of a page in the disk memory" (Br. 6), as required by independent claims 1, 15, and 20 (Br. 5---6). The Examiner's Answer further clarifies that the previously cited portion of Hayashi discloses use of a key which is equivalent to a page pointer to a location on a disk. Ans. 3 (citing Hayashi col. 2, 11. 58---64). The Examiner's Answer also cites additional portions of Hayashi as teaching the disputed limitation (Ans. 3 (citing Hayashi col. 4, 11. 47-56)) as well as disclosures in Guisado-Gamez (Ans. 3--4 (citing Guisado-Gamez § 2, § 2.2 (disclosing an algorithm for determining whether an attribute is related to a value in an in-memory ("RM") portion of a hybrid table or a disk-resident ("RD") portion of the hybrid table))). Cf Spec. Fig. 1, i-f 18 ("[T]he reference to the key is ... tested to determine whether the reference is a page pointer or a page disk address. If the reference is a page pointer, then the page pointer is used to access them-part page which is in the in-memory storage 130 (240 in FIG. 2) .... On the other hand, if the reference (x) 125 is a page disk address 127, then further processing can be performed to resolve the disk address."). 3 Appeal2015-006107 Application 13/675,634 Appellants do not substantively address or rebut the Examiner's findings. 1 We agree with the Examiner and adopt as our own the Examiner's findings, conclusions, and reasons, and we sustain the Examiner's rejection of independent claims 1, 15, and 20, as well as claims 3-5, 7-14, 16, 17, and 19, which Appellants do not argue independently. See Br. 6. DECISION We affirm the Examiner's rejection of claims 1, 3-5, 7-17, 19, and 20. No time period for taking any subsequent action in connection with this appeal may be extended. 37 C.F.R. § 1.136(a)(l )(iv). AFFIRMED 1 We note Appellants did not file a reply brief in response to the factual findings and legal conclusions in the Examiner's Answer. 4 Copy with citationCopy as parenthetical citation