Prosecution Insights
Last updated: April 19, 2026
Application No. 18/985,181

SYSTEM AND METHOD FOR IMPROVED SEARCHING ACROSS MULTIPLE DATABASES

Non-Final OA §103
Filed
Dec 18, 2024
Examiner
PEACH, POLINA G
Art Unit
2165
Tech Center
2100 — Computer Architecture & Software
Assignee
Rewardstyle Inc.
OA Round
1 (Non-Final)
50%
Grant Probability
Moderate
1-2
OA Rounds
3y 7m
To Grant
73%
With Interview

Examiner Intelligence

Grants 50% of resolved cases
50%
Career Allow Rate
229 granted / 461 resolved
-5.3% vs TC avg
Strong +23% interview lift
Without
With
+23.2%
Interview Lift
resolved cases with interview
Typical timeline
3y 7m
Avg Prosecution
34 currently pending
Career history
495
Total Applications
across all art units

Statute-Specific Performance

§101
17.9%
-22.1% vs TC avg
§103
49.9%
+9.9% vs TC avg
§102
14.5%
-25.5% vs TC avg
§112
11.2%
-28.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 461 resolved cases

Office Action

§103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Priority The later-filed application must be an application for a patent for an invention which is also disclosed in the prior application (the parent or original nonprovisional application or provisional application). The disclosure of the invention in the parent application and in the later-filed application must be sufficient to comply with the requirements of 35 U.S.C. 112(a) or the first paragraph of pre-AIA 35 U.S.C. 112, except for the best mode requirement. See Transco Products, Inc. v. Performance Contracting, Inc., 38 F.3d 551, 32 USPQ2d 1077 (Fed. Cir. 1994). The disclosure of the prior-filed application, Application No. 62/754,243, fails to provide adequate support or enablement in the manner provided by 35 U.S.C. 112(a) or pre-AIA 35 U.S.C. 112, first paragraph for one or more claims of this application. The limitation of the independent claims “based on the one or more mapping relationships, identifying second product information stored for the product in the one or more second product data fields of the second database, the second product information including the updated product information causing at least a portion of the second product information to be inconsistent with the first product information” is not supported by the later-filed application No. 62/754,243, and thus, given a priority date of 04/01/2019.. Analogously, claims 3, 15 and 6, 17 are not supported by the later-filed application and thus, given a priority date of 04/01/2019. Specification The disclosure is objected to because of the following informalities: The specification failed to provide a support for the limitation of claims 6, 17 – “excluding the one or more of the unavailable subset of products from the results generated for the product search request”. Appropriate correction is required. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claim(s) 1-2, 4-5, 9, 13-14, 16 and 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over applicant’s admitted prior art Plaehn et al. (US 20170228815) (see IDS filed 12/18/2024) in view of Sun et al. (US 20140046899). Regarding claim 1, Plaehn teaches a computer-implemented method comprising: for a plurality of databases, each configured to store product information associated with a plurality of products and each including a plurality of product data fields associated with a plurality of different types of the product information being stored ([0034]-[0036], [0040]), establishing one or more mapping relationships between a first database of the plurality of databases and at least a second database of the plurality of databases, the one or more mapping relationships associating one or more first product data fields of the first database with corresponding one or more second product data fields of the second database storing a same type of the product information as the one or more first product data fields ([0038]-[0039], [0042]); receiving and storing updated product information for a product, from the plurality of products, in the one or more second product data fields of the second database ([0043], [0052]); receiving a product search request ([0072], [0142]); determining the product, from the plurality of products, is responsive to the product search request using the first database ([0087], [0089]), the first database storing first product information for the product in the one or more first product data fields ([0077]-[0078], [0083]); based on the one or more mapping relationships, identifying second product information stored for the product in the one or more second product data fields of the second database, the second product information including the updated product information ([0043]) causing the updated product information to be displayed in association with the product within results generated for the product search request ([0093], [0137], F6-8). Plaehn does not explicitly teach, however Sun discloses based on the one or more mapping relationships, identifying second product information stored for the product in the one or more second product data fields of the second database ([0046], [0081]-[0082]), the second product information including the updated product information ([0051]) causing at least a portion of the second product information to be inconsistent with the first product information ([0054], [0077], [0087], [0109]). Sun further teaches corresponding one or more second product data fields of the second database storing a same type of the product information ([0088], [0098], [0110]). It would have been obvious to one of ordinary skill in the art at the time of invention to modify the teachings of Plaehn to include identifying inconsistent with the first product information as disclosed by Sun. Doing so would increase efficiency of a user navigation and provide a timely update of the product information (Sun [0009]). Regarding claim 13, Plaehn teaches a system comprising: a plurality of databases, each configured to store product information associated with a plurality of products and each including a plurality of product data fields associated with a plurality of different types of the product information being stored; at least one memory device storing instructions; and at least one processor that executes the instructions to perform operations including: establishing one or more mapping relationships between a first database of the plurality of databases and at least a second database of the plurality of databases, the one or more mapping relationships associating one or more first product data fields of the first database with corresponding one or more second product data fields of the second database storing a same type of the product information as the one or more first product data fields; receiving and storing updated product information for a product, from the plurality of products, in the one or more second product data fields of the second database; receiving a product search request; determining the product, from the plurality of products, is responsive to the product search request using the first database, the first database storing first product information for the product in the one or more first product data fields; based on the one or more mapping relationships, identifying second product information stored for the product in the one or more second product data fields of the second database, the second product information including the updated product information causing at least a portion of the second product information to be inconsistent with the first product information; and causing the updated product information to be displayed in association with the product within results generated for the product search request. Claim 13 recites substantially the same limitations as claim 1, and is rejected for substantially the same reasons. Regarding claims 2 and 14, Plaehn as modified teaches the method and the system, wherein the product information associated with the plurality of products includes one or more of: a product identifier, a product description, a product image, or a scene description (Plaehn [0035], Sun [0030], [0034], [0046]). Regarding claim 4, Plaehn as modified teaches the computer-implemented method of claim 1, further comprising: determining the product is available for purchase (Plaehn [0071], [0083]). Regarding claims 5 and 16, Plaehn as modified teaches the method and the system, wherein determining the product is available for purchase comprises determining at least one of: the product is available from a retailer associated with the product (Plaehn F6:640, [0077]), the product is out of stock but on back order, the product is available from one or more other retailers (Plaehn [0137]), or the product has not been discontinued by a manufacturer (Plaehn [0071], [0083], F4:430f). Regarding claim 9, Plaehn as modified teaches the computer-implemented method of claim 1, wherein the first database and the second databases are maintained by different entities (Plaehn [0034]-[0036], [0040]). Regarding claim 20, Plaehn teaches at least one non-transitory computer-readable medium storing computer-executable instructions which, when executed by at least one processor, causes the at least one processor to perform operations comprising: for a plurality of databases, each configured to store product information associated with a plurality of products and each including a plurality of product data fields associated with a plurality of different types of the product information being stored, establishing one or more mapping relationships between a first database of the plurality of databases and at least a second database of the plurality of databases, the one or more mapping relationships associating one or more first product data fields of the first database with corresponding one or more second product data fields of the second database storing a same type of the product information as the one or more first product data fields; receiving and storing updated product information for a product, from the plurality of products, in the one or more second product data fields of the second database; receiving a product search request; determining the product, from the plurality of products, is responsive to the product search request using the first database, the first database storing first product information for the product in the one or more first product data fields; based on the one or more mapping relationships, identifying second product information stored for the product in the one or more second product data fields of the second database, the second product information including the updated product information causing at least a portion of the second product information to be inconsistent with the first product information; and causing the updated product information to be displayed in association with the product within results generated for the product search request. Claim 20 recites substantially the same limitations as claim 1, and is rejected for substantially the same reasons. Claim(s) 3, 10-12, 15, 19 is/are rejected under 35 U.S.C. 103 as being unpatentable over applicant’s admitted prior art Plaehn as modified and in further view of Vaschillo et al. (US 2005/0050068). Regarding claims 3 and 15, Plaehn as modified teaches the method and the system, wherein the established one or more mapping relationships between the first database and the second database include a dependency of the one or more first product data fields of the first database to the one or more second product data fields of the second database (Plaehn [0042], [0056], [0058]). Plaehn does not explicitly teach, however Vaschillo discloses established one or more mapping relationships between the first database and the second database include a dependency ([0231], [0236]) of the one or more first data fields of the first database to the one or more second data fields of the second database ([0064], [0131]-[0134], [0141], [0151], [0229]). It would have been obvious to one of ordinary skill in the art at the time of invention to modify the teachings of Plaehn to include a dependency of the fields as disclosed by Vaschillo. Doing so enables parallel navigation in different data structures (Vaschillo [0062]). Regarding claims 10 and 19, Plaehn as modified does not explicitly teach, however Vaschillo discloses the method and the system, further comprising: generating a product schema for one or more of the first database or the second database ([0034], [0046], [0068]); and modifying a database structure of the one or more of the first database or the second database to include the product schema ([0049], [0051], [0054], [0224]). It would have been obvious to one of ordinary skill in the art at the time of invention to modify the teachings of Plaehn to generating a product schema as disclosed by Vaschillo. Doing so enables parallel navigation in different data structures (Vaschillo [0062]). Regarding claim 11, Plaehn as modified teaches the computer-implemented method of claim 10, wherein the product schema includes at least one large class and at least one successive narrower class for each product class (Sun [0004], Vaschillo [0064], [0132]). Regarding claim 12, Plaehn as modified teaches the computer-implemented method of claim 10, wherein modifying the database structure of the one or more of the first database or the second database to include the product schema further comprises: associating a time relevancy parameter with the plurality of products (Plaehn [0067], [0091] “notify a web server that new data is available”, [0095], F7:740, Sun [0033], [0058] “updated product node (i.e., newly-added property information is added”, Vaschillo [0092] see "xsd:dateTime", [0184]). Claim(s) 6-8, 17-18 is/are rejected under 35 U.S.C. 103 as being unpatentable over applicant’s admitted prior art Plaehn as modified and in further view of Pope et al. (US 10762511). Regarding claims 6 and 17, Plaehn as modified does not explicitly teach, however Pope discloses the method and the system, wherein the product is one of a subset of products, from the plurality of products, determined to be responsive to the product search request, and the method further comprises: determining one or more of the subset of products other than the product are unavailable for purchase; and excluding the one or more of the unavailable subset of products from the results generated for the product search request (C20L15-26, 47-56). It would have been obvious to one of ordinary skill in the art at the time of invention to modify the teachings of Plaehn to exclude unavailable products as disclosed by Pope. Doing so would allow for efficient searching of multiple sources (Pope C9L65-66). Regarding claims 7 and 18, Plaehn as modified teaches the method and the system, wherein the product is one of a subset of products, from the plurality of products, determined to be responsive to the product search request, and the method further comprises: ranking the subset of products based on one or more relevancy criteria (Pope C19L52-58); and based on the ranking, ordering the subset of products within the results generated for the product search request (Pope C19L52-67). Regarding claim 8, Plaehn as modified teaches the computer-implemented method of claim 7, wherein the one or more relevancy criteria include one or more of: a number of times the respective product of the subset of products has been identified in response to a search (Pope C19L15-24), or an amount of commercial activity associated with content including the product (Pope C18L36-38, 60-63, Sun [0058]-[0059]). Claim(s) 7-8, 11-12, 18 is/are alternatively rejected under 35 U.S.C. 103 as being unpatentable over applicant’s admitted prior art Plaehn as modified and in further view of applicant’s admitted prior art Sicora et al. (US 10684738) (see IDS filed 12/18/2024). Regarding claims 7 and 18, Plaehn as modified teaches the method and the system, wherein the product is one of a subset of products, from the plurality of products, determined to be responsive to the product search request, and the method further comprises: ranking the subset of products based on one or more relevancy criteria (C110L65-67, C113L24-27, C114L1-4); and based on the ranking, ordering the subset of products within the results generated for the product search request (C110L65-67, C113L24-27, C114L1-4). It would have been obvious to one of ordinary skill in the art at the time of invention to modify the teachings of Plaehn to include number of times the product has been identified as disclosed by Sicora. Doing so would allow a user to readily view and interact with results with minimal additional inputs to locate relevant content (Sicora C114L43-45). NOTE the applicant’s admitted prior art - England et al. (US 20120290446) likewise disclose claim 7 and 18 in [0194]-[0214] and further obviate the teachings of Plaehn. Regarding claim 8, Plaehn as modified teaches the computer-implemented method as disclosed above, Sicora additionally teaches, wherein the one or more relevancy criteria (C114L18-40) include one or more of: a number of times the respective product of the subset of products has been identified in response to a search, or an amount of commercial activity associated with content including the product (C102L20-55). NOTE the applicant’s admitted prior art - England et al. (US 20120290446) likewise disclose claim 8 in [0194]-[0214] and further obviate the teachings of Plaehn. Regarding claim 11, Plaehn as modified teaches the computer-implemented method as disclosed above, Sicora additionally teaches wherein the product schema includes at least one large class and at least one successive narrower class for each product class (C22L22L1-3, C102L9-14). It would have been obvious to one of ordinary skill in the art at the time of invention to modify the teachings of Plaehn to include classes and subclasses as disclosed by Sicora. Doing so would allow a user to readily view and interact with results with minimal additional inputs to locate relevant content (Sicora C114L43-45). Regarding claim 12, Plaehn as modified teaches the computer-implemented method ss disclosed above, Sicora additionally teaches, wherein modifying the database structure of the one or more of the first database or the second database to include the product schema further comprises: associating a time relevancy parameter with the plurality of products (C15L5-7, C48L5-26, 41-53). It would have been obvious to one of ordinary skill in the art at the time of invention to modify the teachings of Plaehn to include a time relevancy parameter as disclosed by Sicora. Doing so would allow a user to readily view and interact with results with minimal additional inputs to locate relevant content (Sicora C114L43-45). Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure is indicated on PTO-892. Any inquiry concerning this communication or earlier communications from the examiner should be directed to POLINA G PEACH whose telephone number is (571)270-7646. The examiner can normally be reached Monday-Friday, 9:30 - 5:30. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Aleksandr Kerzhner can be reached at 571-270-1760. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /POLINA G PEACH/ Primary Examiner, Art Unit 2165 January 27, 2026
Read full office action

Prosecution Timeline

Dec 18, 2024
Application Filed
Jan 27, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12596921
Stochastic Bitstream Generation with In-Situ Function Mapping
2y 5m to grant Granted Apr 07, 2026
Patent 12585998
DETERMINING QUALITY OF MACHINE LEARNING MODEL OUTPUT
2y 5m to grant Granted Mar 24, 2026
Patent 12585632
METHOD, DEVICE, AND MEDIUM FOR MANAGING ACTIVITY DATA WITHIN AN APPLICATION
2y 5m to grant Granted Mar 24, 2026
Patent 12579191
IDENTIFYING SEARCH RESULTS IN A HISTORY REPOSITORY
2y 5m to grant Granted Mar 17, 2026
Patent 12572575
USING LARGE LANGUAGE MODELS TO GENERATE SEARCH QUERY ANSWERS
2y 5m to grant Granted Mar 10, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
50%
Grant Probability
73%
With Interview (+23.2%)
3y 7m
Median Time to Grant
Low
PTA Risk
Based on 461 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month