IP Library › Granted Patent US 12,210,500
Granted Patent B2
US 12,210,500 · App. 18/317,008 · Granted Jan 28, 2025

Computer implemented method for creating database structures without knowledge on functioning of relational database system

Inventor: Krystian Piecko (Herndon, VA)
Assignee: DATAWALK SPOLKA AKCYJNA
G06F16/22G06F16/8358G06F16/254
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,210,500
App. No.
18/317,008
Granted
Jan 28, 2025
Kind
B2
Abstract

Computer implemented methods for storing ad hoc relations between previously unrelated database objects assigned to different database structures using an electronic computing device are presented, the methods including: causing the electronic computing device to define at least three database structures: structure A, structure B and structure C, where each of the at least three database structures each includes a number of objects, where there exists at least one relation between objects of structure A and objects of structure B, and where there exists at least one relation between objects of structure B and objects of structure C; filtering data of structure A; accessing structure B using a first selected relation between structure A and structure B; storing information about filtering of structure A and information on a first selected path between structure A and structure B; filtering results obtained from structure B.

Claims (21)

1. A computer implemented method for storing ad hoc relations between previously unrelated database objects assigned to two unrelated data sets, the method comprising:

creating an ad hoc relation between a first data set and a third data set that are previously unrelated, wherein the ad hoc relation comprises at least i) a first relation between the first data set and a second data set, ii) a second relation between the second data set and the third data set and iii) a filtering condition on the first data set or on the second data set; and

storing the ad hoc relation between the first data set and the third data set in a file, wherein the file defines the ad hoc relation by at least storing the first relation, the second relation and the filtering condition.

2. The method of claim 1 , wherein the file is in a form of an Extensible Markup Language (XML) file.

3. The method of claim 1 , wherein the ad hoc relation represents a path from the first data set to the third data set.

4. The method of claim 1 , wherein the file defines the ad hoc relation in one or more levels of hierarchy.

5. The method of claim 4 , wherein the one or more levels of hierarchy comprises an identification of a data set, a filtering condition of a data set, or a relation between two data sets.

6. The method of claim 1 , wherein the first relation is selected from one or more relations between the first data set and the second data set.

7. The method of claim 1 , wherein the second relation is selected from one or more relations between the second data set and the third data set.

8. The method of claim 1 , wherein the first data set or the second data set includes a plurality of objects defined by a plurality of data structures.

9. A computing device program product for storing ad hoc relations between previously unrelated database objects assigned to two unrelated data sets, the computing device program product comprising:

a non-transitory computer readable medium having instructions stored thereon that when executed by a processor cause operations to execute the instructions, the instructions comprising;

first programmatic instructions for creating an ad hoc relation between a first data set and a third data set that are previously unrelated, wherein the ad hoc relation comprises at least i) a first relation between the first data set and a second data set, ii) a second relation between the second data set and the third data set and iii) a filtering condition on the first data set or on the second data set; and

second programmatic instructions for storing the ad hoc relation between the first data set and the third data set in a file, wherein the file defines the ad hoc relation by at least storing the first relation, the second relation and the filtering condition.

10. The computing device program product of claim 9 , wherein the file is in a form of an Extensible Markup Language (XML) file.

11. The computing device program product of claim 9 , wherein the ad hoc relation represents a path from the first data set to the third data set.

12. The computing device program product of claim 9 , wherein the file defines the ad hoc relation in one or more levels of hierarchy.

13. The computing device program product of claim 12 , wherein the one or more levels of hierarchy comprises an identification of a data set, a filtering condition of a data set, or a relation between two data sets.

14. The computing device program product of claim 9 , wherein the first relation is selected from one or more relations between the first data set and the second data set.

15. The computing device program product of claim 9 , wherein the second relation is selected from one or more relations between the second data set and the third data set.

16. The computing device program product of claim 9 , wherein the first data set or the second data set includes a plurality of objects defined by a plurality of data structures.

Assignments (2)
CHANGE OF NAME Recorded Oct 4, 2023
From: PILAB SPOLKA AKCYJNA
To: DATAWALK SPOLKA AKCYJNA
Reel/Frame 065121/0928 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 28, 2023
From: PIECKO, KRYSTIAN
To: PILAB SPOLKA AKCYJNA
Reel/Frame 065067/0581 →
Priority Claims (1)
EP 13461546 · Aug 30, 2013 · regional
Continuity (4)
Continuation 17130212 · Dec 22, 2020
Continuation 15649565 · Jul 13, 2017
Continuation 14469968 · Aug 27, 2014
Related Publication 20240012798A1 · Jan 11, 2024
References Cited (106)
US 5257349A · Alexander · 1993 [cited by applicant]
US 5418961A · Segal et al. · 1995 [cited by applicant]
US 5548758A · Pirahesh et al. · 1996 [cited by applicant]
US 5604899A · Doktor · 1997 [cited by applicant]
US 6038566A · Tsai · 2000 [cited by applicant]
US 6105035A · Monge et al. · 2000 [cited by applicant]
US 6163775A · Wlaschin et al. · 2000 [cited by applicant]
US 6192371B1 · Schultz · 2001 [cited by applicant]
US 6934712B2 · Kiernan et al. · 2005 [cited by applicant]
US 6947945B1 · Carey et al. · 2005 [cited by applicant]
US 6986102B1 · Baer et al. · 2006 [cited by applicant]
US 7058622B1 · Tedesco · 2006 [cited by applicant]
US 7076493B2 · Myers et al. · 2006 [cited by applicant]
US 7243106B2 · Vierich et al. · 2007 [cited by applicant]
US 7363593B1 · Loyens et al. · 2008 [cited by applicant]
US 7895191B2 · Colossi et al. · 2011 [cited by applicant]
US 8103703B1 · Jetter et al. · 2012 [cited by applicant]
US 8224829B2 · Pauly · 2012 [cited by applicant]
US 8364623B1 · Bunker et al. · 2013 [cited by applicant]
US 8386920B2 · Cox et al. · 2013 [cited by applicant]
US 8793246B1 · Mathur et al. · 2014 [cited by applicant]
US 8874621B1 · Goodwin et al. · 2014 [cited by applicant]
US 9218380B2 · Adzic et al. · 2015 [cited by applicant]
US 9483508B1 · Wilkes et al. · 2016 [cited by applicant]
US 9747312B2 · Piecko · 2017 [cited by applicant]
US 10002143B2 · Piecko · 2018 [cited by applicant]
US 10095743B2 · Piecko · 2018 [cited by applicant]
US 10242056B2 · Piecko · 2019 [cited by applicant]
US 10909099B2 · Piecko · 2021 [cited by applicant]
US 11687509B2 · Piecko · 2023 [cited by applicant]
US 20010051948A1 · Srinivasan et al. · 2001 [cited by applicant]
US 20020029209A1 · Bernal et al. · 2002 [cited by applicant]
US 20030088545A1 · Subramaniam et al. · 2003 [cited by applicant]
US 20030208493A1 · Hall et al. · 2003 [cited by applicant]
US 20030229640A1 · Carlson et al. · 2003 [cited by applicant]
US 20040088283A1 · Lissar et al. · 2004 [cited by applicant]
US 20040133581A1 · Shinjo · 2004 [cited by applicant]
US 20040139102A1 · Vierich et al. · 2004 [cited by applicant]
US 20040255301A1 · Turski et al. · 2004 [cited by applicant]
US 20050039033A1 · Meyers et al. · 2005 [cited by applicant]
US 20050216503A1 · Charlot et al. · 2005 [cited by applicant]
US 20050228818A1 · Murthy et al. · 2005 [cited by applicant]
US 20050278275A1 · Myers · 2005 [cited by examiner]
US 20060173841A1 · Bill · 2006 [cited by applicant]
US 20060288035A1 · Viavant · 2006 [cited by applicant]
US 20070112803A1 · Pettovello · 2007 [cited by applicant]
US 20070198557A1 · Ching · 2007 [cited by examiner]
US 20080021864A1 · Bakalash et al. · 2008 [cited by applicant]
US 20080033987A1 · Carter · 2008 [cited by applicant]
US 20080183658A1 · Mangipudi · 2008 [cited by applicant]
US 20080301181A1 · Lori · 2008 [cited by applicant]
US 20090103715A1 · Thorbjornsson · 2009 [cited by applicant]
US 20090222408A1 · Charles et al. · 2009 [cited by applicant]
US 20100287212A1 · Becker · 2010 [cited by applicant]
US 20100299348A1 · Gill et al. · 2010 [cited by applicant]
US 20110231438A1 · Pfeifle et al. · 2011 [cited by applicant]
US 20120096002A1 · Sheehan et al. · 2012 [cited by applicant]
US 20120117027A1 · Shau et al. · 2012 [cited by applicant]
US 20120246147A1 · Lamb et al. · 2012 [cited by applicant]
US 20120284635A1 · Sitrick et al. · 2012 [cited by applicant]
US 20130083104A1 · Mitsuki · 2013 [cited by applicant]
US 20130086104A1 · Morrison et al. · 2013 [cited by applicant]
US 20130091180A1 · Vicat-Blanc-Primet et al. · 2013 [cited by applicant]
US 20130144917A1 · Hosurmath et al. · 2013 [cited by applicant]
US 20130307843A1 · Sikka et al. · 2013 [cited by applicant]
US 20130311518A1 · Agbaria · 2013 [cited by applicant]
US 20140046983A1 · Galloway et al. · 2014 [cited by applicant]
US 20140297693A1 · Piecko · 2014 [cited by applicant]
EP 0592046A2 · 1994 [cited by applicant]
EP 2455869A1 · 2012 [cited by applicant]
EP 2843568A1 · 2015 [cited by applicant]
WO WO02059793A3 · 2003 [cited by applicant]
Anonymous: II sql—Relational database design question—Surrogate-key or Natural-key? -Stack Overflow, Sep. 19, 2010 (Sep. 19, 2010), XP055109921, Retrieved from the Internet: URL: http://stackoverflow.com/questions/37477… [cited by applicant]
European Patent Office Search Report; RE. Application No. 13461516.0 Report Date: Jul. 30, 2013. [cited by applicant]
European Patent Office Search Report; RE. Application No. 13461536.8 Report Date: Sep. 10, 2013. [cited by applicant]
European Patent Office Search Report; RE. Application No. 13461545.9 Report Date: Apr. 25, 2014. [cited by applicant]
European Patent Office Search Report; RE. Application No. 13461546.7 Report Date: Apr. 11, 2014. [cited by applicant]
European Search Report dated Feb. 16, 2017 for European Patent Application No. EP16197450.6. [cited by applicant]
European Search Report dated May 18, 2017 for European Patent Application No. 16203912.7. [cited by applicant]
Girvan et al. Community structure in social and biological networks. Proc Natl Acad Sci U S A. Jun. 11, 2002; 99(12): 7821-7826. [cited by applicant]
Notice of Allowance dated Feb. 23, 2023 for U.S. Appl. No. 17/130,212. [cited by applicant]
Notice of Allowance dated Apr. 10, 2017 for U.S. Appl. No. 14/469,968. [cited by applicant]
Notice of Allowance dated Apr. 28, 2017 for U.S. Appl. No. 14/469,968. [cited by applicant]
Notice of Allowance dated Jul. 26, 2017 for U.S. Appl. No. 14/469,968. [cited by applicant]
Notice of Allowance dated Dec. 19, 2017 for U.S. Appl. No. 14/222,795. [cited by applicant]
Office action dated Feb. 11, 2016 for U.S. Appl. No. 14/222,795. [cited by applicant]
Office Action dated Mar. 13, 2017 for U.S. Appl. No. 14/315,481. [cited by applicant]
Office action dated Apr. 1, 2022 for U.S. Appl. No. 17/130,212. [cited by applicant]
Office Action dated Apr. 28, 2017 for U.S. Appl. No. 14/222,795. [cited by applicant]
Office Action dated May 26, 2017 for U.S. Appl. No. 14/469,958. [cited by applicant]
Office action dated Jun. 2, 2016 for U.S. Appl. No. 14/222,795. [cited by applicant]
Office Action dated Jul. 3, 2017 for U.S. Appl. No. 14/315,481. [cited by applicant]
Office action dated Aug. 22, 2016 for U.S. Appl. No. 14/315,481. [cited by applicant]
Office action dated Aug. 26, 2016 for U.S. Appl. No. 14/469,968. [cited by applicant]
Office action dated Sep. 12, 2016 for U.S. Appl. No. 14/469,958. [cited by applicant]
Office Action dated Sep. 22, 2016 for U.S. Appl. No. 14/222,795. [cited by applicant]
Office action dated Nov. 25, 2022 for U.S. Appl. No. 17/130,212. [cited by applicant]
Office Action dated Dec. 21, 2016 for U.S. Appl. No. 14/469,968. [cited by applicant]
Office Action dated Dec. 22, 2017 for U.S. Appl. No. 14/469,958. [cited by applicant]
PCT/EP2017/059892 International Search Report and Written Opinion dated May 30, 2017. [cited by applicant]
U.S. Appl. No. 14/222,795 Notice of Allowance dated Jan. 29, 2018. [cited by applicant]
U.S. Appl. No. 14/315,481 Notice of Allowance dated Nov. 28, 2018. [cited by applicant]
U.S. Appl. No. 14/315,481 Office Action dated May 17, 2018. [cited by applicant]
U.S. Appl. No. 14/469,958 Notice of Allowance dated Jun. 29, 2018. [cited by applicant]
U.S. Appl. No. 15/649,565 Notice of Allowance dated Oct. 15, 2020. [cited by applicant]
U.S. Appl. No. 15/649,565 Office Action dated May 1, 2020. [cited by applicant]