IP Library Granted Patent US 12,554,781
Granted Patent B2
US 12,554,781 · App. 17/570,271 · Granted Feb 17, 2026

System and method for efficiently determining and displaying optimal packages of data items

Inventors: Xiangnong Wang (New York, NY); Yifei Huang (New York, NY); Michael Yang (New York, NY); Francis Chen (Sunnyvale, CA); Andy Chen (New York, NY); Andre Frederico Cavalheiro Menck (New York, NY); Christopher Yu (Culver City, CA); Grace Garde (South Orange, NJ); Mark Cinali (New York, NY); James Winchester (New York, NY); Peter Wang (Seattle, WA); Nitish Kulkarni (Fremont, CA)
Assignee: Palantir Technologies Inc.
G06F16/951G06F16/9577G06Q30/0242G06Q30/0244G06Q30/0247
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,554,781
App. No.
17/570,271
Granted
Feb 17, 2026
Kind
B2
Abstract

Various systems and methods for aggregating data from disparate sources to determine an optimal package of data items are disclosed. For example, the system described herein can obtain data items from various sources, aggregate and/or organize the data items into an optimal package based on various criteria, and present, via an interactive user interface, the optimal package. Furthermore, the interactive user interface may enable a user to adjust the criteria used to aggregate and/or organize the data items. The system may interactively re-aggregate and re-organize the data items using the adjusted criteria as the user interacts with the package via the user interface. The system and user interface may thus enable the user to optimize the packages of data items based on multiple factors quickly and efficiently.

Claims (34)

1 . A computer-implemented method performed by a computing device comprising one or more hardware computer processors, the method comprising:

retrieving, by an item aggregation engine of an item packaging system through a network, one or more data items from a user data store, wherein the user data store comprises a database of available inventory;

retrieving, by the item aggregation engine through the network, one or more data items from an entity data store, wherein the entity data store comprises a database storing historical data item packages associated with one or more entities;

receiving, by the item aggregation engine through the network, a first constraint, a second constraint, and a third constraint from a user device associated with a user;

parsing, by the item aggregation engine, the received constraints to determine that the first constraint is less flexible than the second constraint;

identifying, by the item aggregation engine, a first data unit from a plurality of data units that satisfies the first constraint;

identifying, by the item aggregation engine, a first set of data units from the plurality of data units that satisfies the second constraint and is within a tolerance level associated with the second constraint or exceeds a minimum requirement of the second constraint;

identifying, by the item aggregation engine, a second set of data units from the first set of data units that matches the third constraint or exceeds a minimum requirement of the third constraint;

determining, by the item aggregation engine, one or more alternate data item packages in parallel based on different tolerance levels distinct from the tolerance level associated with the second constraint;

transmitting, by a recommendation engine of the item packaging system, instructions to a user device to display, in a first window of a user interface, a graphical summary of a data item package; and

displaying, in a second window that overlaps the first window, a recommendation for changing the tolerance level of the second constraint to a different tolerance level associated with one of the alternate data item packages, wherein the recommended change increases a value of the data item package.

2 . The computer-implemented method of claim 1 , wherein the value of the data item package is based on a cost of one or more data items included in the data item package.

3 . The computer-implemented method of claim 1 , wherein adding, to the data item package, the first data unit further comprises generating the data item package that includes the first data unit.

4 . The computer-implemented method of claim 1 , wherein the first constraint is based on another constraint in a historical data item package.

5 . The computer-implemented method of claim 1 , wherein the first data unit is one of an advertisement spot, a network-based advertisement, a billboard, a cover of a video game, an announcement during a sporting event, a consumer product, or an insurance plan.

6 . A computing system comprising:

a hardware computer processor; and

a non-transitory computer readable medium having executable software instructions stored thereon, wherein the executable instructions are configured to implement:

an item aggregation engine configured to:

retrieve, through a network, one or more data items from a user data store, wherein the user data store comprises a database of available inventory;

retrieve, through the network, one or more data items from an entity data store, wherein the entity data store comprises a database storing historical data item packages associated with one or more entities;

receive, through the network, a first constraint, a second constraint, and a third constraint from a user device associated with a user;

parse the received constraints to determine that the first constraint is less flexible than the second constraint;

identify a first data unit from a plurality of data units that satisfies the first constraint;

identify a first set of data units from the plurality of data units that satisfies the second constraint and is within a tolerance level associated with the second constraint or exceeds a minimum requirement of the second constraint;

identify a second set of data units from the first set of data units that matches the third constraint or exceeds a minimum requirement of the third constraint; and

determine one or more alternate data item packages in parallel based on different tolerance levels distinct from the tolerance level associated with the second constraint; and

a recommendation engine configured to:

transmit instructions to a user device to display, in a first window of a user interface, a graphical summary of a data item package; and

display, in a second window that overlaps the first window, a recommendation for changing the tolerance level of the second constraint to a different tolerance level associated with one of the alternate data item packages, wherein the recommended change increases a value of the data item package.

7 . The computing system of claim 6 , wherein the value of the data item package is based on a cost of one or more data items included in the data item package.

8 . The computing system of claim 6 , wherein adding, to the data item package, the first data unit further comprises generating the data item package that includes the first data unit.

9 . The computing system of claim 6 , wherein the first constraint is based on another constraint in a historical data item package.

10 . The computing system of claim 6 , wherein the first data unit is one of an advertisement spot, a network-based advertisement, a billboard, a cover of a video game, an announcement during a sporting event, a consumer product, or an insurance plan.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 14, 2023
From: WANG, XIANGNONG; HUANG, YIFEI; YANG, MICHAEL; CHEN, FRANCIS; CHEN, ANDY; MENCK, ANDRE FREDERICO CAVALHEIRO; YU, CHRISTOPHER; GARDE, GRACE; CINALI, MARK; WINCHESTER, JAMES; WANG, PETER; KULKARNI, NITISH
To: PALANTIR TECHNOLOGIES INC.
Reel/Frame 064908/0613 →
Continuity (3)
Continuation 15669035 · Aug 4, 2017
Provisional Application 62371085 · Aug 4, 2016
Related Publication 20220129508A1 · Apr 28, 2022
References Cited (315)
US 5418950A · Li et al. · 1995 [cited by applicant]
US 5428737A · Li et al. · 1995 [cited by applicant]
US 5428776A · Rothfield · 1995 [cited by applicant]
US 5542089A · Lindsay et al. · 1996 [cited by applicant]
US 5608899A · Li et al. · 1997 [cited by applicant]
US 5613105A · Xbikowski et al. · 1997 [cited by applicant]
US 5701456A · Jacopi et al. · 1997 [cited by applicant]
US 5724575A · Hoover et al. · 1998 [cited by applicant]
US 5794228A · French et al. · 1998 [cited by applicant]
US 5794229A · French et al. · 1998 [cited by applicant]
US 5857329A · Bingham · 1999 [cited by applicant]
US 5911138A · Li et al. · 1999 [cited by applicant]
US 5918225A · White et al. · 1999 [cited by applicant]
US 6208985B1 · Krehel · 2001 [cited by applicant]
US 6236994B1 · Swartz et al. · 2001 [cited by applicant]
US 6289334B1 · Reiner et al. · 2001 [cited by applicant]
US 6311181B1 · Lee et al. · 2001 [cited by applicant]
US 6321274B1 · Shakib et al. · 2001 [cited by applicant]
US 6338043B1 · Miller · 2002 [cited by examiner]
US 6643613B2 · McGee et al. · 2003 [cited by applicant]
US 6745382B1 · Zothner · 2004 [cited by applicant]
US 6851108B1 · Syme et al. · 2005 [cited by applicant]
US 6857120B1 · Arnold et al. · 2005 [cited by applicant]
US 6877137B1 · Rivette et al. · 2005 [cited by applicant]
US 6976024B1 · Chavez et al. · 2005 [cited by applicant]
US 6985882B1 · Del Sesto · 2006 [cited by examiner]
US 7028223B1 · Kolawa et al. · 2006 [cited by applicant]
US 7085890B2 · Kashyap · 2006 [cited by applicant]
US 7155728B1 · Prabhu et al. · 2006 [cited by applicant]
US 7216133B2 · Wu et al. · 2007 [cited by applicant]
US 7406592B1 · Polyudov · 2008 [cited by applicant]
US 7519589B2 · Charnock et al. · 2009 [cited by applicant]
US 7546353B2 · Hesselink et al. · 2009 [cited by applicant]
US 7610290B2 · Kruy et al. · 2009 [cited by applicant]
US 7627489B2 · Schaeffer et al. · 2009 [cited by applicant]
US 7661116B2 · Slaney et al. · 2010 [cited by applicant]
US 7783679B2 · Bley · 2010 [cited by applicant]
US 7853573B2 · Warner et al. · 2010 [cited by applicant]
US 7877421B2 · Berger et al. · 2011 [cited by applicant]
US 7908521B2 · Sridharan et al. · 2011 [cited by applicant]
US 7979424B2 · Dettinger et al. · 2011 [cited by applicant]
US 8073857B2 · Sreekanth · 2011 [cited by applicant]
US 8103962B2 · Embley et al. · 2012 [cited by applicant]
US 8117067B2 · Ketchum · 2012 [cited by applicant]
US 8271328B1 · Baltz et al. · 2012 [cited by applicant]
US 8311878B2 · Subramanian et al. · 2012 [cited by applicant]
US 8370197B2 · Axe et al. · 2013 [cited by applicant]
US 8417715B1 · Bruckhaus et al. · 2013 [cited by applicant]
US 8429194B2 · Aymeloglu et al. · 2013 [cited by applicant]
US 8433702B1 · Carrino et al. · 2013 [cited by applicant]
US 8499287B2 · Shafi et al. · 2013 [cited by applicant]
US 8516515B2 · Zigmond et al. · 2013 [cited by applicant]
US 8560494B1 · Downing · 2013 [cited by applicant]
US 8615430B2 · Yonezaki et al. · 2013 [cited by applicant]
US 8639552B1 · Chen et al. · 2014 [cited by applicant]
US 8799867B1 · Peri-Glass et al. · 2014 [cited by applicant]
US 8909597B2 · Aymeloglu et al. · 2014 [cited by applicant]
US 8924245B2 · Chatter et al. · 2014 [cited by applicant]
US 8924429B1 · Fisher et al. · 2014 [cited by applicant]
US 8935201B1 · Fisher et al. · 2015 [cited by applicant]
US 8935303B2 · Karatzoglou et al. · 2015 [cited by applicant]
US 9031981B1 · Potter et al. · 2015 [cited by applicant]
US 9105000B1 · White et al. · 2015 [cited by applicant]
US 9176966B2 · Silverstein et al. · 2015 [cited by applicant]
US 9292388B2 · Fisher et al. · 2016 [cited by applicant]
US 9330120B2 · Colgrove et al. · 2016 [cited by applicant]
US 9483789B1 · Hanlon · 2016 [cited by examiner]
US 9501783B2 · Hood et al. · 2016 [cited by applicant]
US 9595068B2 · Tedjamulia et al. · 2017 [cited by applicant]
US 9652510B1 · Huang · 2017 [cited by examiner]
US 10129346B1 · Roy · 2018 [cited by examiner]
US 11256762B1 · Wang et al. · 2022 [cited by applicant]
US 20020184111A1 · Swanson · 2002 [cited by applicant]
US 20030004770A1 · Miller et al. · 2003 [cited by applicant]
US 20030023485A1 · Newsome · 2003 [cited by applicant]
US 20030023620A1 · Trotta · 2003 [cited by applicant]
US 20030074252A1 · Chandler-Pepelnjak et al. · 2003 [cited by applicant]
US 20030105833A1 · Daniels · 2003 [cited by applicant]
US 20040088177A1 · Travis et al. · 2004 [cited by applicant]
US 20040093286A1 · Cooper · 2004 [cited by examiner]
US 20040098731A1 · Demsey et al. · 2004 [cited by applicant]
US 20040103088A1 · Cragun et al. · 2004 [cited by applicant]
US 20040126840A1 · Cheng et al. · 2004 [cited by applicant]
US 20040139212A1 · Mukherjee et al. · 2004 [cited by applicant]
US 20040153837A1 · Preston et al. · 2004 [cited by applicant]
US 20040167676A1 · Mizumaki · 2004 [cited by applicant]
US 20040193608A1 · Gollapudi et al. · 2004 [cited by applicant]
US 20050004911A1 · Goldberg et al. · 2005 [cited by applicant]
US 20050021397A1 · Cui et al. · 2005 [cited by applicant]
US 20050120080A1 · Weinreb et al. · 2005 [cited by applicant]
US 20050183005A1 · Denoue et al. · 2005 [cited by applicant]
US 20050226473A1 · Ramesh · 2005 [cited by applicant]
US 20050278286A1 · Djugash et al. · 2005 [cited by applicant]
US 20060004740A1 · Dettinger et al. · 2006 [cited by applicant]
US 20060026063A1 · Collins · 2006 [cited by applicant]
US 20060070046A1 · Balakrishnan et al. · 2006 [cited by applicant]
US 20060074967A1 · Shaburov · 2006 [cited by applicant]
US 20060080616A1 · Vogel et al. · 2006 [cited by applicant]
US 20060116991A1 · Calderwood · 2006 [cited by applicant]
US 20060129992A1 · Oberholtzer et al. · 2006 [cited by applicant]
US 20060142949A1 · Helt · 2006 [cited by applicant]
US 20060209085A1 · Wong et al. · 2006 [cited by applicant]
US 20060271884A1 · Hurst · 2006 [cited by applicant]
US 20060288046A1 · Gupta et al. · 2006 [cited by applicant]
US 20070005582A1 · Navratil et al. · 2007 [cited by applicant]
US 20070027756A1 · Collins et al. · 2007 [cited by applicant]
US 20070027757A1 · Collins et al. · 2007 [cited by applicant]
US 20070027851A1 · Kruy et al. · 2007 [cited by applicant]
US 20070094248A1 · Mcveigh et al. · 2007 [cited by applicant]
US 20070113164A1 · Hansen et al. · 2007 [cited by applicant]
US 20070150805A1 · Misovski · 2007 [cited by applicant]
US 20070156673A1 · Maga · 2007 [cited by applicant]
US 20070168336A1 · Ransil et al. · 2007 [cited by applicant]
US 20070178501A1 · Rabinowitz et al. · 2007 [cited by applicant]
US 20070185867A1 · Maga · 2007 [cited by applicant]
US 20070192281A1 · Cradick et al. · 2007 [cited by applicant]
US 20070260582A1 · Liang · 2007 [cited by applicant]
US 20080126226A1 · Popkiewicz et al. · 2008 [cited by applicant]
US 20080126344A1 · Hoffman et al. · 2008 [cited by applicant]
US 20080126951A1 · Sood et al. · 2008 [cited by applicant]
US 20080155440A1 · Trevor et al. · 2008 [cited by applicant]
US 20080162277A1 · Moonka · 2008 [cited by examiner]
US 20080196016A1 · Todd · 2008 [cited by applicant]
US 20080201313A1 · Dettinger et al. · 2008 [cited by applicant]
US 20080215543A1 · Huang et al. · 2008 [cited by applicant]
US 20080267386A1 · Cooper · 2008 [cited by applicant]
US 20080270398A1 · Landau et al. · 2008 [cited by applicant]
US 20090006150A1 · Prigge et al. · 2009 [cited by applicant]
US 20090007056A1 · Prigge et al. · 2009 [cited by applicant]
US 20090037267A1 · Duggal et al. · 2009 [cited by applicant]
US 20090043762A1 · Shiverick et al. · 2009 [cited by applicant]
US 20090055375A1 · Oestlien · 2009 [cited by examiner]
US 20090055487A1 · Moraes et al. · 2009 [cited by applicant]
US 20090083275A1 · Jacob et al. · 2009 [cited by applicant]
US 20090094217A1 · Dettinger et al. · 2009 [cited by applicant]
US 20090144747A1 · Baker · 2009 [cited by applicant]
US 20090161147A1 · Klave · 2009 [cited by applicant]
US 20090172674A1 · Bobak et al. · 2009 [cited by applicant]
US 20090187556A1 · Ross et al. · 2009 [cited by applicant]
US 20090193012A1 · Williams · 2009 [cited by applicant]
US 20090199047A1 · Vaitheeswaran et al. · 2009 [cited by applicant]
US 20090248478A1 · Duggal et al. · 2009 [cited by applicant]
US 20090248721A1 · Burton et al. · 2009 [cited by applicant]
US 20090262892A1 · Haras · 2009 [cited by examiner]
US 20090282068A1 · Shockro et al. · 2009 [cited by applicant]
US 20090299830A1 · West et al. · 2009 [cited by applicant]
US 20100011282A1 · Dollard et al. · 2010 [cited by applicant]
US 20100036718A1 · Hamilton et al. · 2010 [cited by applicant]
US 20100073315A1 · Lee et al. · 2010 [cited by applicant]
US 20100082671A1 · Li et al. · 2010 [cited by applicant]
US 20100145902A1 · Boyan et al. · 2010 [cited by applicant]
US 20100161646A1 · Ceballos et al. · 2010 [cited by applicant]
US 20100169376A1 · Chu · 2010 [cited by applicant]
US 20100169405A1 · Zhang · 2010 [cited by applicant]
US 20100199167A1 · Uematsu et al. · 2010 [cited by applicant]
US 20100313119A1 · Baldwin et al. · 2010 [cited by applicant]
US 20110035396A1 · Merz et al. · 2011 [cited by applicant]
US 20110040634A1 · Landsberry · 2011 [cited by examiner]
US 20110041084A1 · Karam · 2011 [cited by applicant]
US 20110066497A1 · Gopinath et al. · 2011 [cited by applicant]
US 20110074811A1 · Hanson et al. · 2011 [cited by applicant]
US 20110093490A1 · Schindlauer et al. · 2011 [cited by applicant]
US 20110131547A1 · Elaasar · 2011 [cited by applicant]
US 20110145401A1 · Westlake · 2011 [cited by applicant]
US 20110208822A1 · Rathod · 2011 [cited by applicant]
US 20110218955A1 · Tang · 2011 [cited by applicant]
US 20110252282A1 · Meek et al. · 2011 [cited by applicant]
US 20110258216A1 · Supakkul et al. · 2011 [cited by applicant]
US 20110270871A1 · He et al. · 2011 [cited by applicant]
US 20110295649A1 · Fine · 2011 [cited by applicant]
US 20110321008A1 · Jhoney et al. · 2011 [cited by applicant]
US 20120036007A1 · Robertson et al. · 2012 [cited by applicant]
US 20120078595A1 · Balandin et al. · 2012 [cited by applicant]
US 20120102022A1 · Miranker et al. · 2012 [cited by applicant]
US 20120159449A1 · Arnold et al. · 2012 [cited by applicant]
US 20120173381A1 · Smith · 2012 [cited by applicant]
US 20120174057A1 · Narendra et al. · 2012 [cited by applicant]
US 20120188252A1 · Law · 2012 [cited by applicant]
US 20120284719A1 · Phan et al. · 2012 [cited by applicant]
US 20120290448A1 · England et al. · 2012 [cited by applicant]
US 20120330752A1 · Kim · 2012 [cited by applicant]
US 20130024268A1 · Manickavelu · 2013 [cited by applicant]
US 20130024731A1 · Shochat et al. · 2013 [cited by applicant]
US 20130054306A1 · Bhalla · 2013 [cited by applicant]
US 20130054551A1 · Lange · 2013 [cited by applicant]
US 20130086482A1 · Parsons · 2013 [cited by applicant]
US 20130096968A1 · Van Pelt et al. · 2013 [cited by applicant]
US 20130110746A1 · Ahn · 2013 [cited by applicant]
US 20130185245A1 · Anderson · 2013 [cited by applicant]
US 20130187926A1 · Silverstein · 2013 [cited by applicant]
US 20130198624A1 · Aymeloglu et al. · 2013 [cited by applicant]
US 20130225212A1 · Khan · 2013 [cited by applicant]
US 20130226944A1 · Baid et al. · 2013 [cited by applicant]
US 20130232220A1 · Sampson · 2013 [cited by applicant]
US 20130247095A1 · Weihs et al. · 2013 [cited by applicant]
US 20130305278A1 · Gordon et al. · 2013 [cited by applicant]
US 20140012886A1 · Downing et al. · 2014 [cited by applicant]
US 20140074591A1 · Allen et al. · 2014 [cited by applicant]
US 20140074888A1 · Potter et al. · 2014 [cited by applicant]
US 20140100944A1 · Zhu et al. · 2014 [cited by applicant]
US 20140108074A1 · Miller et al. · 2014 [cited by applicant]
US 20140108097A1 · Gange · 2014 [cited by examiner]
US 20140115589A1 · Marinelli, III et al. · 2014 [cited by applicant]
US 20140115610A1 · Marinelli, III et al. · 2014 [cited by applicant]
US 20140143252A1 · Silverstein et al. · 2014 [cited by applicant]
US 20140214579A1 · Shen et al. · 2014 [cited by applicant]
US 20140244388A1 · Manouchehri et al. · 2014 [cited by applicant]
US 20150112641A1 · Faraj · 2015 [cited by applicant]
US 20150269030A1 · Fisher et al. · 2015 [cited by applicant]
US 20160012481A1 · Elvekrog et al. · 2016 [cited by applicant]
US 20160026923A1 · Erenrich et al. · 2016 [cited by applicant]
US 20160078551A1 · Samuels · 2016 [cited by examiner]
US 20160088333A1 · Bhatia et al. · 2016 [cited by applicant]
US 20160104067A1 · Xu · 2016 [cited by examiner]
US 20170026678A1 · Smith · 2017 [cited by examiner]
US 20170034593A1 · Ray et al. · 2017 [cited by applicant]
US 20170310884A1 · Li · 2017 [cited by examiner]
US 20170325005A1 · Liassides et al. · 2017 [cited by applicant]
DE 102014103482 · 2014 [cited by applicant]
EP 1647908 · 2006 [cited by applicant]
EP 2634745 · 2013 [cited by applicant]
EP 2743839 · 2014 [cited by applicant]
EP 2778986 · 2014 [cited by applicant]
EP 2921975 · 2015 [cited by applicant]
GB 2366498 · 2002 [cited by applicant]
GB 2508503 · 2015 [cited by applicant]
GB 2508293 · 2015 [cited by applicant]
HK 1194178 · 2015 [cited by applicant]
NZ 622485 · 2015 [cited by applicant]
NZ 616212 · 2015 [cited by applicant]
NZ 616299 · 2015 [cited by applicant]
WO WO2000034895 · 2000 [cited by applicant]
WO WO2010030917 · 2010 [cited by applicant]
WO WO2013030595 · 2013 [cited by applicant]
Loc Do, Hady W. Lauw, and Ke Wang. 2015. Mining revenue-maximizing bundling configuration. Proc. VLDB Endow. 8, 5 (Jan. 2015), 593-604. https://doi.org/10.14778/2735479.2735491 (Year: 2015). [cited by examiner]
“A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2. [cited by applicant]
“A Tour of Pinboard,” <http://pinboard.in/tour> as printed May 15, 2014 in 6 pages. [cited by applicant]
Alur et al., “Chapter 2: IBM InfoSphere DataStage Stages,” IBM InfoSphere DataStage Data Flow and Job Design, Jul. 1, 2008, pp. 35-137. [cited by applicant]
Anonymous, “Frequently Asked Questions about Office Binder 97,” http://web.archive.org/web/20100210112922/http://support.microsoft.com/kb/843147 printed Dec. 18, 2006 in 5 pages. [cited by applicant]
Bae et al., “Partitioning Algorithms for the Computation of Average Iceberg Queries,” DaWak 2000, LNCS 1874, pp. 276_286. [cited by applicant]
Ballesteros et al., “Batching: A Design Pattern for Efficient and Flexible Client/Server Interaction,” Transactions on Pattern Languages of Programming, Springer Berlin Heildeberg, 2009, pp. 48-66. [cited by applicant]
Bogle et al., “Reducing Cross-Domain Call Overhead Using Batched Futures,” SIGPLAN No. 29, 10 (Oct. 1994) pp. 341-354. [cited by applicant]
Bogle, Phillip Lee, “Reducing Cross-Domain Call Overhead Using Batched Futures,” May 1994, Massachusetts Institute of Technology, pp. 96. [cited by applicant]
Bouajjani et al., “Analysis of Recursively Parallel Programs,” PLDI09: Proceedings of the 2009 ACM Sigplan Conference on Programming Language Design and Implementation, Jun. 15-20, 2009, Dublin, Ireland, pp. 203-214. [cited by applicant]
Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10. [cited by applicant]
Chazelle et al., “The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables,” SODA '04 Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 30-39. [cited by applicant]
Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679. [cited by applicant]
Delicious, <http://delicious.com/> as printed May 15, 2014 in 1 page. [cited by applicant]
Donjerkovic et al., “Probabilistic Optimization of Top N Queries,” Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999, pp. 411-422. [cited by applicant]
Fang et al., “Computing Iceberg Queries Efficiently,” Proceedings of the 24th VLDB Conference. [cited by applicant]
New York, 1998, pp. 299-310. [cited by applicant]
“The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29. [cited by applicant]
Goldstein et al., “Stacks Lazy Threads: Implementing a Fast Parallel Call,” Journal of Parallel and Distributed Computing, Jan. 1, 1996, pp. 5-20. [cited by applicant]
Han et al., “Efficient Computation of Iceberg Cubes with Complex Measures,” ACM Sigmod, May 21-24, 2001, pp. 1-12. [cited by applicant]
Ivanova et al., “An Architecture for Recycling Intermediates in a Column-Store,” Proceedings of the 35th Sigmod International Conference on Management of Data, Sigmod '09, Jun. 29, 2009, p. 309. [cited by applicant]
Jacques, M., “An extensible math expression parser with plug-ins,” Code Project, Mar. 13, 2008. Retrieved on Jan. 30, 2015 from the internet: <http://www.codeproject.com/Articles/7335/An-extensible-math-expression-parse… [cited by applicant]
Jenks et al., “Nomadic Threads: A Migrating Multithreaded Approach to Remote Memory Accesses in Multiprocessors,” Parallel Architectures and Compilation Techniques, 1996, Oct. 20, 1996, pp. 2-11. [cited by applicant]
Kahan et al., “Annotea: an Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, Elsevier Science Publishers B.V., vol. 39, No. 5, dated Aug. 5, 2002, pp. 589-608. [cited by applicant]
Karp et al., “A Simple Algorithm for Finding Frequent Elements in Streams and Bags,” ACM Transactions on Database Systems, vol. 28, No. 1, Mar. 2003, pp. 51Ð55. [cited by applicant]
Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21. [cited by applicant]
Leela et al., “On Incorporating Iceberg Queries in Query Processors,” Technical Report, TR-2002-01, Database Systems for Advanced Applications Lecture Notes in Computer Science, 2004, vol. 2973. [cited by applicant]
Liu et al., “Methods for Mining Frequent Items in Data Streams: An Overview,” Knowledge and Information Systems, vol. 26, No. 1, Jan. 2011, pp. 1-30. [cited by applicant]
Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15. [cited by applicant]
Mendes et al., “TcruziKB: Enabling Complex Queries for Genomic Data Exploration,” IEEE International Conference on Semantic Computing, Aug. 2008, pp. 432-439. [cited by applicant]
Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14. [cited by applicant]
Russell et al., “NITELIGHT: A Graphical Tool for Semantic Query Construction,” 2008, pp. 10. [cited by applicant]
Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166. [cited by applicant]
Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11. [cited by applicant]
Smart et al., “A Visual Approach to Semantic Query Design Using a Web-Based Graphical Query Designer,” 16th International Conference on Knowledge Engineering and Knowledge Management (EKAW 2008), ÊAcitrezza, Catania, It… [cited by applicant]
Stamos et al., “Remote Evaluation,” Journal ACM Transactions on Programming Languages and Systems (TOPLAS) vol. 12, Issue 4, Oct. 1990, pp. 537-564. [cited by applicant]
Wang et al., “Distributed Collaborative Filtering for Peer-to-Peer File Sharing Systems,” Proceedings of the 2006 ACM Symposium on Applied Computing, pp. 1026-1030; SAC'Apr. 23-27, 06, 2006. [cited by applicant]
Wikipedia, “Machine Code”, p. 1-5, printed Aug. 11, 2014. [cited by applicant]
Wollrath et al., “A Distributed Object Model for the Java System,” Proceedings of the 2nd Conference on USENEX, Conference on Object-Oriented Technologies (COOTS), Jun. 17, 1996, pp. 219-231. [cited by applicant]
Notice of Acceptance for New Zealand Patent Application No. 616212 dated Jan. 23, 2015. [cited by applicant]
Notice of Acceptance for New Zealand Patent Application No. 616299 dated Apr. 7, 2015. [cited by applicant]
Notice of Acceptance for New Zealand Patent Application No. 622485 dated Nov. 24, 2014. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 13/657,635 dated Jan. 29, 2016. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 13/767,779 dated Mar. 17, 2015. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/019,534 dated Feb. 4, 2016. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/254,757 dated Sep. 10, 2014. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/254,773 dated Aug. 20, 2014. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/304,741 dated Apr. 7, 2015. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/581,902 dated Nov. 13, 2015. [cited by applicant]
Official Communication for Australian Patent Application No. 2013237658 dated Feb. 2, 2015. [cited by applicant]
Official Communication for Australian Patent Application No. 2013237710 dated Jan. 16, 2015. [cited by applicant]
Official Communication for Australian Patent Application No. 2014201580 dated Feb. 27, 2015. [cited by applicant]
Official Communication for Canadian Patent Application No. 2807899 dated Jul. 20, 2015. [cited by applicant]
Official Communication for Canadian Patent Application No. 2807899 dated Oct. 24, 2014. [cited by applicant]
Official Communication for Canadian Patent Application No. 2828264 dated Apr. 28, 2015. [cited by applicant]
Official Communication for Canadian Patent Application No. 2829266 dated Apr. 28, 2015. [cited by applicant]
Official Communication for European Patent Application No. 13157474.1 dated Oct. 30, 2015. [cited by applicant]
Official Communication for European Patent Application No. 14159175.0 dated Jul. 17, 2014. [cited by applicant]
Official Communication for European Patent Application No. 14159175.0 dated Feb. 4, 2016. [cited by applicant]
Official Communication for European Patent Application No. 14159629.6 dated Sep. 22, 2014. [cited by applicant]
Official Communication for European Patent Application No. 14159629.6 dated Jul. 31, 2014. [cited by applicant]
Official Communication for European Patent Application No. 15159520.4 dated Jul. 15, 2015. [cited by applicant]
Official Communication for German Patent Application No. 10 2013 221 052.3 dated Mar. 24, 2015. [cited by applicant]
Official Communication for German Patent Application No. 10 2013 221 057.4 dated Mar. 23, 2015. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1404574.4 dated Dec. 18, 2014. [cited by applicant]
Official Communication for Netherlands Patent Application No. 2011613 dated Aug. 13, 2015. [cited by applicant]
Official Communication for Netherlands Patent Application No. 2011627 dated Aug. 14, 2015. [cited by applicant]
Official Communication for Netherlands Patent Application No. 2012437 dated Sep. 18, 2015. [cited by applicant]
Official Communication for New Zealand Patent Application No. 622414 dated Mar. 24, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 622484 dated Apr. 2, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 13/411,291 dated Oct. 1, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/411,291 dated Jul. 15, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/608,864 dated Mar. 17, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/608,864 dated Jun. 8, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/657,635 dated Mar. 30, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/657,635 dated Oct. 7, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/657,656 dated May 6, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/657,656 dated Oct. 7, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 13/827,627 dated Mar. 2, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/827,627 dated Oct. 20, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/827,627 dated Dec. 22, 2015. [cited by applicant]