The following relates to computer interfaces, and more particularly relates to systems and methods for creating and joining tournaments in a multi-tenant database environment.
Modern software development is evolving away from the client-server model toward “cloud”-based processing systems that provide access to data and services via the Internet or other networks. In contrast to prior systems that hosted networked applications on dedicated server hardware, the cloud computing model allows applications to be provided over the network “as a service” supplied by an infrastructure provider. The infrastructure provider typically abstracts the underlying hardware and other resources used to deliver a customer-developed application so that the customer no longer needs to operate and support dedicated server hardware. The cloud computing model can often provide substantial cost savings to the customer over the life of the application because the customer no longer needs to provide dedicated network infrastructure, electrical and temperature controls, physical security and other logistics in support of dedicated server hardware.
Although multi-tenant platforms can provide substantial benefits, they can be relatively difficult to design and develop. The often competing demands of integration and isolation between tenants, for example, can lead to any number of challenges in design and implementation. For example, even though multiple tenants share a common server, each tenant may be able to provide data or services to its customers using the tenant's own separate, unique network domain. Furthermore, applications which are accessible by multiple tenants need to maintain data isolation between the multiple tenants.
Exemplary embodiments will hereinafter be described in conjunction with the following drawing figures, wherein like numerals denote like elements, and
According to various exemplary embodiments, systems and methods are provided to allow a user to create and join a tournament in a multi-tenant database environment.
Turning now to
A “tenant” generally refers to a group of users that shares access to common data within database 130. Tenants may represent customers, customer departments, business or legal organizations, and/or any other entities that maintain data for particular sets of users within system 100. Although multiple tenants may share access to a common server 102 and database 130, the particular data and services provided from server 102 to each tenant can be securely isolated from those provided to other tenants. The multi-tenant architecture allows different sets of users to share functionality without necessarily sharing each other's data 132.
Database 130 is any sort of repository or other data storage system capable of storing and managing data 132 associated with any number of tenants. Database 130 may be implemented using any type of conventional database server hardware. In various embodiments, database 130 shares processing hardware 104 with server 102. In other embodiments, database 130 is implemented using separate physical and/or virtual database server hardware that communicates with server 102 to perform the various functions described herein.
Server 102 is implemented using one or more actual and/or virtual computing systems that collectively provide a dynamic application platform 110 for generating virtual applications 128A-B. Server 102 operates with any sort of conventional computing hardware 104, such as any processor 105, memory 106, input/output features 107 and the like. Processor 105 may be implemented using one or more of microprocessors, microcontrollers, processing cores and/or other computing resources spread across any number of distributed or integrated systems, including any number of “cloud-based” or other virtual systems. Memory 106 represents any non-transitory short or long term storage capable of storing programming instructions for execution on processor 105, including any sort of random access memory (RAM), read only memory (ROM), flash memory, magnetic or optical mass storage, and/or the like. Input/output features 107 represent conventional interfaces to networks (e.g., to network 145, or any other local area, wide area or other network), mass storage, display devices, data entry devices and/or the like. In a typical embodiment, application platform 110 gains access to processing resources, communications interfaces and other features of hardware 104 using any sort of conventional or proprietary operating system 108. As noted above, server 102 may be implemented using a cluster of actual and/or virtual servers operating in conjunction with each other, typically in association with conventional network communications, cluster management, load balancing and other features as appropriate.
The tournament generator 150 interacts with a tournament application which can be downloaded to a user's domain and run as one of the virtual tenant applications 128A-B. Once a user downloads the tournament application to the user's domain, the user can launch the tournament application.
Tournaments are a fun way to compete with friends, engage employees and create healthy competition. An employer, for example, may want to create a tournament to see which salesman makes the most sales, which programmer finds the most bugs or which organization within the company is the most profitable. The employer may also want the employees to compete to see who can predict how the tournament will unfold. Others may want to setup an online tournament for a local little league, high school sports teams, or other amateur or professional sports to compete with friends or colleagues to see who can predict results.
The tournament creation interface 400 includes a number of secondary interfaces 420-434 which allow the user to customize certain aspects of the tournament. For example, the user can activate an interface control 420 to enter the number of participants (individuals, teams or any combination thereof) in the tournament. Any number participants may be used. The interface control 420 may also allow the user to customize format and matchups for the tournament. For example, the user may assign a bye-round to certain participants, so that the selected participant does not have an opponent for one or more rounds. Bye-rounds are useful when the number of participants doesn't allow for every participant to have an opponent each round.
The interface control 420 can be used, for example, to set up mini play-in tournaments. For example, if there are thirty-six participants in the tournament, twenty-eight of the participants may be assigned a bi-round for the first round, while the remaining eight participants face off in the first round to determine which participants will play in a traditional thirty-two participant tournament.
The interface control 420 may also be used to select a data source for the tournament which contains the number of participant data. For example, the user may select a data entry 132 in the multitenant database 130 where the number of participants for the tournament may be located. In one embodiment, for example, the data entry 132 may change until a tournament is locked, or closed to new participants. In this embodiment, the tournament generator 150 may automatically update the tournament to reflect the latest number of participants. In other embodiments, the tournament generator 150 may notify the user who created the tournament to manually update the tournament when new participants are added or removed.
The tournament creation interface 400 also includes an interface 422 to assign participants to the tournament. The assignments determine which participants are matched up against each other during the tournaments. In one embodiment, for example, the assignments may be based upon a ranking or order of the participants. By activating the interface 422, the user can manually set the matchups for the tournament in any arrangement. The interface 422, for example, may launch respective screens or GUI elements that in turn allow the user to create the assignment of participants data. In another embodiment, the user can use the interface 422 to select a data source which contains the participant assignments. For example, a data entry 132 in the multi-tenant database 130 may include the names of the participants. In one embodiment, for example, the data entry 132 which includes the names of the participants may be the same data entry which includes the number of participants. The user may also use the interface 422 to enter a description of each participant which other users may view when making their selections, as described in further detail below. The user could also user the interface 422 to enter description of each matchup, as discussed in further detail below.
Returning to
The tournament creation interface 400 also includes a scoring system customization interface 426. The customization interface 426 allows the user to select the scoring system data from one of a number of standard scoring systems, or to make a customized scoring system. In some scoring systems a user may get a single point per correct prediction. In other scoring systems bonus points may be awarded for picking upsets, if there is a ranking associated with the participants. In some scoring systems the number of points awarded for making a correct prediction may increase based upon the current round. In other scoring systems a margin of victory, a total score, or any other statistic may be used to award points to users.
Returning to
Returning to
The tournament access interface 430 may also give the user the ability to make smaller open or private tournaments within a larger tournament. In one embodiment, for example, the user may create a tournament between groups of users within the tenant. The user creating the tournament can then create smaller tournaments for each group. In other embodiments, the user creating the tournament may enable other users to create local (i.e., local to each users domain) tournaments based upon a larger tournament, as discussed in further detail below.
The tournament creation interface 400 may also include a privacy options interface 434. As discussed above, the multi-tenant system 100 is designed to maintain data security between tenants, such that a user in one tenant can not access the data of users in another tenant while simultaneously sharing the system resources of the multi-tenant database system.
Returning to
Returning to
Any of the above discussed tournament creation interfaces 420-434 and the publishing interface 440 may be implemented in a variety of ways. For example, each interface may open to a separate window for the user select the respective options. Some of the interfaces may be menus, such as a drop down menu. Other options may be selected by checkboxes, radio buttons or the like. Any combination of the types of interfaces may be used.
Returning to
The interface 700 further includes a participant selection interface 730. In the embodiment illustrated in
In one embodiment, for example, the interface 700 includes a tie break interface 740. The tie break interface 740 allows a user to enter a value corresponding to at least on of the matchups (e.g., the final matchup). The value will depend upon the measure being used to determine the winner for each matchup. In one embodiment, for example, if the tournament is based upon a sporting event, the value could be a total score between the two final teams, a score of the winning team, a score of the losing team, a margin of victory (difference between the winning team and the losing team, the number of touchdowns, goals, homeruns, strikeouts, free-throws made, or any other statistical measurement.
Once the user is satisfied with the selections, the user may interact with a submission interface 560 to submit the user's selections for the tournament.
Returning to
Generally speaking, the various functions and features of method 300 and 500 may be carried out with any sort of hardware, software and/or firmware logic that is stored and/or executed on any platform. Some or all of method 300 and/or 500 may be carried out, for example, by logic executing within system 100 in
The term “exemplary” is used herein to represent one example, instance or illustration that may have any number of alternates. Any implementation described herein as “exemplary” should not necessarily be construed as preferred or advantageous over other implementations.
Although several exemplary embodiments have been presented in the foregoing description, it should be appreciated that a vast number of alternate but equivalent variations exist, and the examples presented herein are not intended to limit the scope, applicability, or configuration of the embodiments in any way. To the contrary, various changes may be made in the function and arrangement of the various features described herein without departing from the scope of the claims and their legal equivalents.
This application claims the benefit of U.S. provisional patent application Ser. No. 61/503,193, filed Jun. 30, 2011, the entire content of which is incorporated by reference herein.
Number | Name | Date | Kind |
---|---|---|---|
5577188 | Zhu | Nov 1996 | A |
5608872 | Schwartz et al. | Mar 1997 | A |
5649104 | Carleton et al. | Jul 1997 | A |
5715450 | Ambrose et al. | Feb 1998 | A |
5761419 | Schwartz et al. | Jun 1998 | A |
5819038 | Carleton et al. | Oct 1998 | A |
5821937 | Tonelli et al. | Oct 1998 | A |
5831610 | Tonelli et al. | Nov 1998 | A |
5873096 | Lim et al. | Feb 1999 | A |
5918159 | Fomukong et al. | Jun 1999 | A |
5963953 | Cram et al. | Oct 1999 | A |
6092083 | Brodersen et al. | Jul 2000 | A |
6169534 | Raffel et al. | Jan 2001 | B1 |
6178425 | Brodersen et al. | Jan 2001 | B1 |
6189011 | Lim et al. | Feb 2001 | B1 |
6216135 | Brodersen et al. | Apr 2001 | B1 |
6233617 | Rothwein et al. | May 2001 | B1 |
6266669 | Brodersen et al. | Jul 2001 | B1 |
6295530 | Ritchie et al. | Sep 2001 | B1 |
6324568 | Diec et al. | Nov 2001 | B1 |
6324693 | Brodersen et al. | Nov 2001 | B1 |
6336137 | Lee et al. | Jan 2002 | B1 |
D454139 | Feldcamp et al. | Mar 2002 | S |
6367077 | Brodersen et al. | Apr 2002 | B1 |
6393605 | Loomans | May 2002 | B1 |
6405220 | Brodersen et al. | Jun 2002 | B1 |
6434550 | Warner et al. | Aug 2002 | B1 |
6446089 | Brodersen et al. | Sep 2002 | B1 |
6535909 | Rust | Mar 2003 | B1 |
6549908 | Loomans | Apr 2003 | B1 |
6553563 | Ambrose et al. | Apr 2003 | B2 |
6560461 | Fomukong et al. | May 2003 | B1 |
6574635 | Stauber et al. | Jun 2003 | B2 |
6577726 | Huang et al. | Jun 2003 | B1 |
6601087 | Zhu et al. | Jul 2003 | B1 |
6604117 | Lim et al. | Aug 2003 | B2 |
6604128 | Diec | Aug 2003 | B2 |
6609150 | Lee et al. | Aug 2003 | B2 |
6621834 | Scherpbier et al. | Sep 2003 | B1 |
6654032 | Zhu et al. | Nov 2003 | B1 |
6665648 | Brodersen et al. | Dec 2003 | B2 |
6665655 | Warner et al. | Dec 2003 | B1 |
6684438 | Brodersen et al. | Feb 2004 | B2 |
6711565 | Subramaniam et al. | Mar 2004 | B1 |
6724399 | Katchour et al. | Apr 2004 | B1 |
6728702 | Subramaniam et al. | Apr 2004 | B1 |
6728960 | Loomans | Apr 2004 | B1 |
6732095 | Warshavsky et al. | May 2004 | B1 |
6732100 | Brodersen et al. | May 2004 | B1 |
6732111 | Brodersen et al. | May 2004 | B2 |
6754681 | Brodersen et al. | Jun 2004 | B2 |
6763351 | Subramaniam et al. | Jul 2004 | B1 |
6763501 | Zhu et al. | Jul 2004 | B1 |
6768904 | Kim | Jul 2004 | B2 |
6782383 | Subramaniam et al. | Aug 2004 | B2 |
6804330 | Jones et al. | Oct 2004 | B1 |
6826565 | Ritchie et al. | Nov 2004 | B2 |
6826582 | Chatterjee et al. | Nov 2004 | B1 |
6826745 | Coker | Nov 2004 | B2 |
6829655 | Huang et al. | Dec 2004 | B1 |
6842748 | Warner et al. | Jan 2005 | B1 |
6850895 | Brodersen et al. | Feb 2005 | B2 |
6850949 | Warner et al. | Feb 2005 | B2 |
7340411 | Cook | Mar 2008 | B2 |
7620655 | Larsson et al. | Nov 2009 | B2 |
7698160 | Beaven et al. | Apr 2010 | B2 |
8082301 | Ahlgren et al. | Dec 2011 | B2 |
8095413 | Beaven | Jan 2012 | B1 |
8095594 | Beaven et al. | Jan 2012 | B2 |
8275836 | Beaven et al. | Sep 2012 | B2 |
20010004609 | Walker et al. | Jun 2001 | A1 |
20010044791 | Richter et al. | Nov 2001 | A1 |
20020072951 | Lee et al. | Jun 2002 | A1 |
20020082892 | Raffel | Jun 2002 | A1 |
20020129352 | Brodersen et al. | Sep 2002 | A1 |
20020140731 | Subramaniam et al. | Oct 2002 | A1 |
20020142842 | Easley et al. | Oct 2002 | A1 |
20020143997 | Huang et al. | Oct 2002 | A1 |
20020155886 | Kidron | Oct 2002 | A1 |
20020162090 | Parnell et al. | Oct 2002 | A1 |
20020165742 | Robbins | Nov 2002 | A1 |
20030004971 | Gong | Jan 2003 | A1 |
20030018705 | Chen et al. | Jan 2003 | A1 |
20030018830 | Chen et al. | Jan 2003 | A1 |
20030066031 | Laane et al. | Apr 2003 | A1 |
20030066032 | Ramachandran et al. | Apr 2003 | A1 |
20030069936 | Warner et al. | Apr 2003 | A1 |
20030070000 | Coker et al. | Apr 2003 | A1 |
20030070004 | Mukundan et al. | Apr 2003 | A1 |
20030070005 | Mukundan et al. | Apr 2003 | A1 |
20030074418 | Coker et al. | Apr 2003 | A1 |
20030120675 | Stauber et al. | Jun 2003 | A1 |
20030151633 | George et al. | Aug 2003 | A1 |
20030159136 | Huang et al. | Aug 2003 | A1 |
20030187921 | Diec et al. | Oct 2003 | A1 |
20030189600 | Gune et al. | Oct 2003 | A1 |
20030190960 | Jokipii et al. | Oct 2003 | A1 |
20030204427 | Gune et al. | Oct 2003 | A1 |
20030206192 | Chen et al. | Nov 2003 | A1 |
20030225730 | Warner et al. | Dec 2003 | A1 |
20040001092 | Rothwein et al. | Jan 2004 | A1 |
20040010489 | Rio et al. | Jan 2004 | A1 |
20040015981 | Coker et al. | Jan 2004 | A1 |
20040027388 | Berg et al. | Feb 2004 | A1 |
20040128001 | Levin et al. | Jul 2004 | A1 |
20040186860 | Lee et al. | Sep 2004 | A1 |
20040193510 | Catahan et al. | Sep 2004 | A1 |
20040199489 | Barnes-Leon et al. | Oct 2004 | A1 |
20040199536 | Barnes Leon et al. | Oct 2004 | A1 |
20040199543 | Braud et al. | Oct 2004 | A1 |
20040249854 | Barnes-Leon et al. | Dec 2004 | A1 |
20040260534 | Pak et al. | Dec 2004 | A1 |
20040260659 | Chan et al. | Dec 2004 | A1 |
20040268299 | Lei et al. | Dec 2004 | A1 |
20050050555 | Exley et al. | Mar 2005 | A1 |
20050091098 | Brodersen et al. | Apr 2005 | A1 |
20050261043 | Slade | Nov 2005 | A1 |
20070117617 | Spanton et al. | May 2007 | A1 |
20070191102 | Coliz et al. | Aug 2007 | A1 |
20070218997 | Cho | Sep 2007 | A1 |
20090191929 | Nicora | Jul 2009 | A1 |
20100062840 | Herrmann | Mar 2010 | A1 |
20100130280 | Arezina et al. | May 2010 | A1 |
20110256913 | Ford | Oct 2011 | A1 |
20110300926 | Englman et al. | Dec 2011 | A1 |
20120172133 | Trexler et al. | Jul 2012 | A1 |
Number | Date | Country | |
---|---|---|---|
20130006402 A1 | Jan 2013 | US |
Number | Date | Country | |
---|---|---|---|
61503193 | Jun 2011 | US |