System, method and computer program product for defining custom junction objects in an on-demand database service

Information

  • Patent Grant
  • 10949435
  • Patent Number
    10,949,435
  • Date Filed
    Monday, October 23, 2017
    7 years ago
  • Date Issued
    Tuesday, March 16, 2021
    3 years ago
Abstract
In accordance with embodiments, there are provided mechanisms and methods for defining custom junction objects in an on-demand database service. These mechanisms and methods for defining custom junction objects in an on-demand database service can enable embodiments to provide for enhanced security and more efficient querying, etc. The ability of embodiments to provide such features may lead to these and other benefits in an on-line environment.
Description
COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.


FIELD OF THE INVENTION

The current invention relates generally to database systems, and more particularly to defining custom junction objects.


BACKGROUND

The subject matter discussed in the background section should not be assumed to be prior art merely as a result of its mention in the background section. Similarly, a problem mentioned in the background section or associated with the subject matter of the background section should not be assumed to have been previously recognized in the prior art. The subject matter in the background section merely represents different approaches, which in and of themselves may also be inventions.


In conventional database systems, users access their data resources in one logical database. A user of such a conventional system typically retrieves data from and stores data on the system using the user's own systems. A user system might remotely access one of a plurality of server systems that might in turn access the database system. Data retrieval from the system might include the issuance of a query from the user system to the database system. The database system might process the request for information received in the query and send to the user system information relevant to the request.


There is often a desire to define custom junction objects in the foregoing database frameworks. To date, such custom junction objects have been limited to traditional database frameworks. To this end, the various benefits that may optionally be derived from such custom junction objects have been void in on-line environments.


BRIEF SUMMARY

In accordance with embodiments, there are provided mechanisms and methods for defining custom junction objects in an on-demand database service. These mechanisms and methods for defining custom junction objects in an on-demand database service can enable embodiments to provide for enhanced security and more efficient querying, etc. The ability of embodiments to provide such features may lead to these and other benefits in an on-line environment.


In an embodiment and by way of example, a method is provided for receiving information associated with a plurality of arbitrary objects. Further, a custom junction object is defined comprising a many-to-many relationship of any tuple selected from the arbitrary objects. Still yet, information about related tuples of arbitrary objects is stored in an on-demand database service using the definition.


While the present invention is described with reference to an embodiment in which techniques for defining custom junction objects in an on-demand database service are implemented in an application server providing a front end for a multi-tenant database on-demand service, the present invention is not limited to multi-tenant databases or deployment on application servers. Embodiments may be practiced using other database architectures, i.e., ORACLE®, DB2® and the like without departing from the scope of the embodiments claimed.


Any of the above embodiments may be used alone or together with one another in any combination. Inventions encompassed within this specification may also include embodiments that are only partially mentioned or alluded to or are not mentioned or alluded to at all in this brief summary or in the abstract. Although various embodiments of the invention may have been motivated by various deficiencies with the prior art, which may be discussed or alluded to in one or more places in the specification, the embodiments of the invention do not necessarily address any of these deficiencies. In other words, different embodiments of the invention may address different deficiencies that may be discussed in the specification. Some embodiments may only partially address some deficiencies or just one deficiency that may be discussed in the specification, and some embodiments may not address any of these deficiencies.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a method for defining custom junction objects in an on-demand database service, in accordance with one embodiment.



FIG. 2 shows a diagram of a first parent object, a second parent object, and at least one child object that may be used to define a many-to-many relationship of a custom junction object, in accordance with one embodiment.



FIG. 3 shows a method for running a pipeline of queries for returning a predetermined number of temporally ordered entities associated with a plurality of accounts, in accordance with one embodiment.



FIG. 4 shows a diagram illustrating the reduction of a number of rows per account after running a pipeline of queries, in accordance with one embodiment.



FIG. 5 illustrates a block diagram of an example of an environment wherein an on-demand database service might be used.



FIG. 6 illustrates a block diagram of an embodiment of elements of FIG. 5 and various possible interconnections between these elements.





DETAILED DESCRIPTION

General Overview


Systems and methods are provided for defining custom junction objects in an on-demand database service.


To date, use of custom junction objects have been limited to traditional database frameworks. To this end, the various benefits that may optionally be derived from such custom junction objects have been void in on-line environments. Thus, mechanisms and methods are provided herein for defining custom junction objects in an on-demand database service that can enable embodiments to provide for enhanced security and more efficient querying, etc. in an on-line environment.


Next, mechanisms and methods for defining custom junction objects in an on-demand database service will be described with reference to exemplary embodiments.



FIG. 1 shows a method 100 for defining custom junction objects in an on-demand database service, in accordance with one embodiment. As shown, information associated with a plurality of arbitrary objects is received. See operation 102.


In this case, the objects may include any objects capable of providing information. For example, in various embodiments, the arbitrary objects may include data associated with activities, opportunities, and cases, etc. In one embodiment, the arbitrary objects may comprise a data structure (e.g. a table or list) including such data.


Further, a custom junction object comprising a many-to-many relationship of any tuple selected from the arbitrary objects is then defined. See operation 104. In this case, a tuple refers to any sequence or list of values.


In the context of the present description, a custom junction object refers to any object that supports a many-to-many relationship of any two arbitrary objects. In this case, a many-to-many relationship refers to any relationship in which a record in a first object (e.g. table, etc.) may correspond to more than one record in a second object. In one embodiment, the custom junction object may include a many-to-many relationship associated with a plurality of the arbitrary objects that have a business relationship.


With further reference to FIG. 1, information about related tuples of arbitrary objects is stored in an on-demand database service, using the definition. See operation 106. In the context of the present description, an on-demand database service may include any service that relies on a database system that is accessible over a network.


In one embodiment, the on-demand database service may include a multi-tenant on-demand database service. In the present description, such multi-tenant on-demand database service may include any service that relies on a database system that is accessible over a network, in which various elements of hardware and software of the database system may be shared by one or more customers. For instance, a given application server may simultaneously process requests for a great number of customers, and a given database table may store rows for a potentially much greater number of customers.


In one embodiment, security criteria associated with the custom junction object may be defined and enforced. For example, the custom junction object may include a many-to-many relationship associated with a first parent object, a second parent object, and at least one child object, as shown in FIG. 2. In this case, the security criteria may allow the at least one child object to be read when both the first parent object and the second parent object are allowed to be read.


As an option, the security criteria may allow the at least one child object to be written when both the first parent object and the second parent object are allowed to be written. As another option, the security criteria may allow the at least one child object to be written when both the first parent object and the second parent object are allowed to be read. As still another option, the security criteria may allow the at least one child object to be written when at least one of the first parent object and the second parent object are allowed to be written and at least one of the first parent object and the second parent object are allowed to be read.


In this way, a security model may be applied to the custom junction object, where the security model may be inherited from at least one of a set of parents of the custom junction object. As an option, applying a security model to the custom junction object may include selectively enforcing the security model. As another option, selectively enforcing the security model may include enforcing the security model when both parents of the custom junction object are publicly shared, but may not necessarily be imposed with a database many-to-many relationship table.


In one embodiment, the custom junction object may include a many-to-many relationship associated with a plurality of the arbitrary objects associated with a single household. In the context of the present description, a household refers to a user-defined grouping of people and/or organizations. For example, the household may include a family or a business partnership.


As an option, the household may enable a user to view contact information for every member of a household. Furthermore, a household may allow the user to view all objects (e.g. activities, cases, solutions, custom objects, etc.) related to the household.


In one embodiment, the custom junction object may support household functionality including household tabs, household tab/object rename, household layouts, household record types, household overview/detail/edit, household custom fields, household Apex trigger support, household custom buttons and links, build data validations using Apex triggers/code, and support of custom object tab rename, etc.


A household member may also be configured to include any account of a person/organization that belongs to a household. In this case, the account may belong to multiple households. As a result, the underlying data model to support the household member may be a many-to-many relationship, as noted above.


In order to build the household member functionality, a new custom junction object may be generated. In one embodiment, the initial custom junction object may be parented by two arbitrary objects (e.g. a household custom object and an account, etc.). In this case, the custom junction object may include a data structure such as a table. As an option, the visibility of rows of the custom junction object may depend on read-access authorization of a user with respect to both parents. Furthermore, the ability to add/remove rows may depend on edit-access of a user with respect to both parents.


In one embodiment, the custom junction object may not include sharing rules. For example, the visibility/edit access of the custom junction object may be dependent entirely upon the parents. Furthermore, the ability to create/update rows may depend on edit-access on both parents.


Because the security of a custom junction object may be dependent upon the parents, the delete may also be dependent upon the parents. For example, a delete of a custom junction object may require access to the parents of both sets of foreign key fields of the parents.


In one embodiment, deleting either parent of the custom junction object may cause a cascade delete of the custom junction object. An undelete of the parent may also be reflected in the custom junction object, as the custom junction object may be undeleted as well. However, in some cases, deleting both parents and then undeleting both parents may cause a permanent delete of the custom junction object.


As an option, custom junction objects may not be allowed to have children entities such as activities, notes, attachments, children custom objects, etc. This may be enforced to simplify the cascade delete of custom junction objects via their parents.


In one embodiment, on a detail page of either parent of a custom junction object, a custom related list may be provided showing the custom junction objects related to that parent. For example, if a custom junction object exists between clients and cases, on the detail page of a particular client, a list of cases in which that client is involved may be displayed. Additionally, on the detail page of a particular case, the list of clients to which that case is related may be displayed.


In both cases, the sharing models may be applied such that cases on the related lists that are not normally displayed will not be displayed, even if the case is related to the particular client being viewed. As an option, this functionality may be present for every custom junction object that any customer builds. In one embodiment, this may be accomplished by a single database query which performs the steps illustrated in Table 1.









TABLE 1







1. Start from the Household (e.g. Custom Object)


2. Drive from Household → Household sharing tables (Optional if


 Household is public sharing)


3. Drive from Household → Household Member (e.g. Custom Junction


 Object) via a Household Foreign Key (FK) field on


 Household Member


4. Drive from Household Member (e.g. Custom Junction Object) →


 Account via the Account FK on the Household Member


5. Join from Account → Account sharing tables (Optional if Account is


 public sharing)


6. Join Account









In this case, sharing rules of the objects involved may be optional based on the sharing model of each parent. It should be noted that the security joins may be specific to the object parenting the custom junction object. Households and accounts are simply examples used for this feature, and such examples should not be construed as limiting in any manner.


In some embodiments, related lists may be associated with a single account. For households, related lists of items may be related to any account in the household. If a person account is a member of multiple households, this may allow entities (e.g. activities, opportunities, cases, etc.) to appear in multiple households. It is the many-to-many nature of junction objects that allows for an account to be related to multiple households and allows for a household to be related to multiple accounts. Thus, it is possible to display account X in the detail page of household Y, and display account X in the detail page of household Z.


In one embodiment, the junction object between a household and account may include extra built-in functionality not included in another custom junction object. This functionality, referred to as rollup functionality, may be configured such that account may include its own child objects, such as opportunities in an account, contacts in an account, and other child objects. The junction between household and account may be configured such that when one particular household is viewed, it is related to multiple accounts through the household member junction objects and each of those accounts are related to their own sets of opportunities, contacts, and other children. With this rollup feature, the detail page of a particular household may display a list of opportunities, contacts, and/or children that are related to any of the accounts associated with that household. In this way, it may be possible to see the same opportunity, contact, and/or child X in the detail page of household Y, and to see X again in the detail page of household Z. This is because the parent account of X is related to both households Y and Z.


Because a single database query may be ran to get all visible accounts related to a household or households, and because the visibility of child objects is determined by the visibility of the parent, the rollup functionality may be implemented by performing an extra database join to the child object from those visible accounts (e.g. after step 7 in Table 1).


When rollup is applied to activities, the set of activities related to any of the accounts that are related to a particular household may be displayed. In this case, the visibility of the activity is determined by multiple factors, rather than just that of the account.


For entity related lists (e.g. activity related lists, etc.), a separate query may be run to obtain all the accessible accounts in the household. A plsql function may then be called using those account IDs to retrieve the set of IDs of visible activities related to those accounts. Finally, the results from the plsql function may be joined against the activity table to retrieve those activities.



FIG. 3 shows a method 300 for running a sequence of queries for returning a predetermined number of temporally ordered entities associated with a plurality of accounts, in accordance with one embodiment. As an option, the present method 300 may be implemented in the context of the functionality of FIGS. 1-2. Of course, however, the method 300 may be carried out in any desired environment. The aforementioned definitions may apply during the present description.


As shown, a query is run to iterate over entities of a first account according to a sort temporal order. See operation 302. In this case, row sharing may be applied on a per row basis.


As a result of the query, the first N visible entities (e.g. activities, etc.) are received. See operation 304. In this case, N may represent any integer. For example, in various embodiments, N may be an integer between 1 and 10. Of course, in various other embodiments, N may include any integer value.


Once received, the received entities are inserted into a sorted list. See operation 306. In this case, the entities may be inserted into the sorted list.


The date of the entities is then stored. See operation 308. In one embodiment, the entity dates may be stored in an array. It is then determined whether there are any remaining accounts. See operation 310.


If there are remaining accounts, the query is run to iterate over the entities. See operation 312. Furthermore, the first available N visible entities (e.g. activities, etc.) are retrieved and inserted into the sorted list. See operation 314. In this case, the number of visible entries may be less than the number of the visible entries in the first query.


It is then determined whether an entity date of the current row is beyond a threshold. See operation 316. If the entity date of the current row is beyond the threshold, the query is terminated. For example, the query may be terminated as soon as the entity date of the current row is beyond the Nth visible account in the sorted list.


At the end of the plsql function, the sorted list of activities is returned, and the caller may join that against the activity table. In this way, while running one query for each account, asymptotically fewer and fewer entity rows per account may be fetched towards the latter accounts. In this way, by limiting the queries, processing resources and bandwidth resources may be conserved.


In one embodiment, there may be an existing pipeline function that returns the ID of visible activities that are related to a given account, ordered by date. This pipeline function may run a query to find activities related to a given account, determine if the activities are visible according to the sharing model, and return the visible activities one-by-one. As an option, this pipeline functionality may be used in the context of operations 302 and 312 of FIG. 3. It should be noted that when using the method 300 described in FIG. 3, each subsequent call to the pipeline function (e.g. using different account IDs) may return asymptotically fewer and fewer activities, until the threshold is crossed. Thus, processing resources may be reduced.



FIG. 4 shows a diagram 400 illustrating the reduction of a number of rows per account after running a pipeline of queries for returning a predetermined number of temporally ordered entities associated with a plurality of accounts A1-AN, in accordance with one embodiment.


In operation, a first query may be run for a predetermined number (e.g. 5, etc.) of temporally ordered entities (e.g. activities, cases, solutions, and custom objects, etc.) associated with a first account A1. A second query for temporally ordered entities associated with a second account A2 may then be limited. For example, the second query may be limited by determining whether a date associated with at least one of the temporally ordered entities would result in the at least one of the temporally ordered entities not being included in the predetermined number of temporally ordered entities. In this case, the at least one of the temporally ordered entity may be conditionally retrieved based on the determination. Thus, fewer and fewer entity rows per account are fetched as the account number shown in FIG. 4 increases.


System Overview



FIG. 5 illustrates a block diagram of an environment 510 wherein an on-demand database service might be used. As an option, any of the previously described embodiments of the foregoing figures may or may not be implemented in the context of the environment 510. Environment 510 may include user systems 512, network 514, system 516, processor system 517, application platform 518, network interface 520, tenant data storage 522, system data storage 524, program code 526, and process space 528. In other embodiments, environment 510 may not have all of the components listed and/or may have other elements instead of, or in addition to, those listed above.


Environment 510 is an environment in which an on-demand database service exists. User system 512 may be any machine or system that is used by a user to access a database user system. For example, any of user systems 512 can be a handheld computing device, a mobile phone, a laptop computer, a work station, and/or a network of computing devices. As illustrated in FIG. 5 (and in more detail in FIG. 6) user systems 512 might interact via a network with an on-demand database service, which is system 516.


An on-demand database service, such as system 516, is a database system that is made available to outside users that do not need to necessarily be concerned with building and/or maintaining the database system, but instead may be available for their use when the users need the database system (e.g., on the demand of the users). Some on-demand database services may store information from one or more tenants stored into tables of a common database image to form a multi-tenant database system (MTS). Accordingly, “on-demand database service 516” and “system 516” will be used interchangeably herein. A database image may include one or more database objects. A relational database management system (RDMS) or the equivalent may execute storage and retrieval of information against the database object(s). Application platform 518 may be a framework that allows the applications of system 516 to run, such as the hardware and/or software, e.g., the operating system. In an embodiment, on-demand database service 516 may include an application platform 518 that enables creation, managing and executing one or more applications developed by the provider of the on-demand database service, users accessing the on-demand database service via user systems 512, or third party application developers accessing the on-demand database service via user systems 512.


The users of user systems 512 may differ in their respective capacities, and the capacity of a particular user system 512 might be entirely determined by permissions (permission levels) for the current user. For example, where a salesperson is using a particular user system 512 to interact with system 516, that user system has the capacities allotted to that salesperson. However, while an administrator is using that user system to interact with system 516, that user system has the capacities allotted to that administrator. In systems with a hierarchical role model, users at one permission level may have access to applications, data, and database information accessible by a lower permission level user, but may not have access to certain applications, database information, and data accessible by a user at a higher permission level.


Thus, different users will have different capabilities with regard to accessing and modifying application and database information, depending on a user's security or permission level. Network 514 is any network or combination of networks of devices that communicate with one another. For example, network 514 can be any one or any combination of a LAN (local area network), WAN (wide area network), telephone network, wireless network, point-to-point network, star network, token ring network, hub network, or other appropriate configuration. As the most common type of computer network in current use is a TCP/IP (Transfer Control Protocol and Internet Protocol) network, such as the global internetwork of networks often referred to as the “Internet” with a capital “I,” that network will be used in many of the examples herein. However, it should be understood that the networks that the present invention might use are not so limited, although TCP/IP is a frequently implemented protocol.


User systems 512 might communicate with system 516 using TCP/IP and, at a higher network level, use other common Internet protocols to communicate, such as HTTP, FTP, AFS, WAP, etc. In an example where HTTP is used, user system 512 might include an HTTP client commonly referred to as a “browser” for sending and receiving HTTP messages to and from an HTTP server at system 516. Such an HTTP server might be implemented as the sole network interface between system 516 and network 514, but other techniques might be used as well or instead. In some implementations, the interface between system 516 and network 514 includes load sharing functionality, such as round-robin HTTP request distributors to balance loads and distribute incoming HTTP requests evenly over a plurality of servers. At least as for the users that are accessing that server, each of the plurality of servers has access to the MTS' data; however, other alternative configurations may be used instead.


In one embodiment, system 516, shown in FIG. 5, implements a web-based customer relationship management (CRM) system. For example, in one embodiment, system 516 includes application servers configured to implement and execute CRM software applications as well as provide related data, code, forms, webpages and other information to and from user systems 512 and to store to, and retrieve from, a database system related data, objects, and Webpage content. With a multi-tenant system, data for multiple tenants may be stored in the same physical database object, however, tenant data typically is arranged so that data of one tenant is kept logically separate from that of other tenants so that one tenant does not have access to another tenant's data, unless such data is expressly shared. In certain embodiments, system 516 implements applications other than, or in addition to, a CRM application. For example, system 516 may provide tenant access to multiple hosted (standard and custom) applications, including a CRM application. User (or third party developer) applications, which may or may not include CRM, may be supported by the application platform 518, which manages creation, storage of the applications into one or more database objects and executing of the applications in a virtual machine in the process space of the system 516.


One arrangement for elements of system 516 is shown in FIG. 6, including a network interface 520, application platform 518, tenant data storage 522 for tenant data 523, system data storage 524 for system data accessible to system 516 and possibly multiple tenants, program code for implementing various functions of system 516, and a process space 528 for executing MTS system processes and tenant-specific processes, such as running applications as part of an application hosting service. Additional processes that may execute on system 516 include database indexing processes.


Several elements in the system shown in FIG. 6 include conventional, well-known elements that are explained only briefly here. For example, each user system 512 could include a desktop personal computer, workstation, laptop, PDA, cell phone, or any wireless access protocol (WAP) enabled device or any other computing device capable of interfacing directly or indirectly to the Internet or other network connection. User system 512 typically runs an HTTP client, e.g., a browsing program, such as Microsoft's Internet Explorer browser, Netscape's Navigator browser, Opera's browser, or a WAP-enabled browser in the case of a cell phone, PDA or other wireless device, or the like, allowing a user (e.g., subscriber of the multi-tenant database system) of user system 512 to access, process and view information, pages and applications available to it from system 516 over network 514. Each user system 512 also typically includes one or more user interface devices, such as a keyboard, a mouse, trackball, touch pad, touch screen, pen or the like, for interacting with a graphical user interface (GUI) provided by the browser on a display (e.g., a monitor screen, LCD display, etc.) in conjunction with pages, forms, applications and other information provided by system 516 or other systems or servers. For example, the user interface device can be used to access data and applications hosted by system 516, and to perform searches on stored data, and otherwise allow a user to interact with various GUI pages that may be presented to a user. As discussed above, embodiments are suitable for use with the Internet, which refers to a specific global internetwork of networks. However, it should be understood that other networks can be used instead of the Internet, such as an intranet, an extranet, a virtual private network (VPN), a non-TCP/IP based network, any LAN or WAN or the like.


According to one embodiment, each user system 512 and all of its components are operator configurable using applications, such as a browser, including computer code run using a central processing unit such as an Intel Pentium® processor or the like. Similarly, system 516 (and additional instances of an MTS, where more than one is present) and all of their components might be operator configurable using application(s) including computer code to run using a central processing unit such as processor system 517, which may include an Intel Pentium® processor or the like, and/or multiple processor units. A computer program product embodiment includes a machine-readable storage medium (media) having instructions stored thereon/in which can be used to program a computer to perform any of the processes of the embodiments described herein. Computer code for operating and configuring system 516 to intercommunicate and to process webpages, applications and other data and media content as described herein are preferably downloaded and stored on a hard disk, but the entire program code, or portions thereof, may also be stored in any other volatile or non-volatile memory medium or device as is well known, such as a ROM or RAM, or provided on any media capable of storing program code, such as any type of rotating media including floppy disks, optical discs, digital versatile disk (DVD), compact disk (CD), microdrive, and magneto-optical disks, and magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data. Additionally, the entire program code, or portions thereof, may be transmitted and downloaded from a software source over a transmission medium, e.g., over the Internet, or from another server, as is well known, or transmitted over any other conventional network connection as is well known (e.g., extranet, VPN, LAN, etc.) using any communication medium and protocols (e.g., TCP/IP, HTTP, HTTPS, Ethernet, etc.) as are well known. It will also be appreciated that computer code for implementing embodiments of the present invention can be implemented in any programming language that can be executed on a client system and/or server or server system such as, for example, C, C++, HTML, any other markup language, Java™, JavaScript, ActiveX, any other scripting language, such as VBScript, and many other programming languages as are well known may be used. (Java™ is a trademark of Sun Microsystems, Inc.).


According to one embodiment, each system 516 is configured to provide webpages, forms, applications, data and media content to user (client) systems 512 to support the access by user systems 512 as tenants of system 516. As such, system 516 provides security mechanisms to keep each tenant's data separate unless the data is shared. If more than one MTS is used, they may be located in close proximity to one another (e.g., in a server farm located in a single building or campus), or they may be distributed at locations remote from one another (e.g., one or more servers located in city A and one or more servers located in city B). As used herein, each MTS could include one or more logically and/or physically connected servers distributed locally or across one or more geographic locations. Additionally, the term “server” is meant to include a computer system, including processing hardware and process space(s), and an associated storage system and database application (e.g., OODBMS or RDBMS) as is well known in the art. It should also be understood that “server system” and “server” are often used interchangeably herein. Similarly, the database object described herein can be implemented as single databases, a distributed database, a collection of distributed databases, a database with redundant online or offline backups or other redundancies, etc., and might include a distributed database or storage network and associated processing intelligence.



FIG. 6 also illustrates environment 510. However, in FIG. 6 elements of system 516 and various interconnections in an embodiment are further illustrated. FIG. 6 shows that user system 512 may include processor system 512A, memory system 512B, input system 512C, and output system 512D. FIG. 6 shows network 514 and system 516. FIG. 6 also shows that system 516 may include tenant data storage 522, tenant data 523, system data storage 524, system data 525, User Interface (UI) 530, Application Program Interface (API) 632, PL/SOQL 634, save routines 636, application setup mechanism 638, applications servers 6001-600N, system process space 602, tenant process spaces 604, tenant management process space 610, tenant storage area 612, user storage 614, and application metadata 616. In other embodiments, environment 510 may not have the same elements as those listed above and/or may have other elements instead of, or in addition to, those listed above.


User system 512, network 514, system 516, tenant data storage 522, and system data storage 524 were discussed above in FIG. 5. Regarding user system 512, processor system 512A may be any combination of one or more processors. Memory system 512B may be any combination of one or more memory devices, short term, and/or long term memory. Input system 512C may be any combination of input devices, such as one or more keyboards, mice, trackballs, scanners, cameras, and/or interfaces to networks. Output system 512D may be any combination of output devices, such as one or more monitors, printers, and/or interfaces to networks. As shown by FIG. 6, system 516 may include a network interface 520 (of FIG. 5) implemented as a set of HTTP application servers 600, an application platform 518, tenant data storage 522, and system data storage 524. Also shown is system process space 602, including individual tenant process spaces 604 and a tenant management process space 610. Each application server 600 may be configured to tenant data storage 522 and the tenant data 523 therein, and system data storage 524 and the system data 525 therein to serve requests of user systems 512. The tenant data 523 might be divided into individual tenant storage areas 612, which can be either a physical arrangement and/or a logical arrangement of data. Within each tenant storage area 612, user storage 614 and application metadata 616 might be similarly allocated for each user. For example, a copy of a user's most recently used (MRU) items might be stored to user storage 614. Similarly, a copy of MRU items for an entire organization that is a tenant might be stored to tenant storage area 612. A UI 630 provides a user interface and an API 632 provides an application programmer interface to system 516 resident processes to users and/or developers at user systems 512. The tenant data and the system data may be stored in various databases, such as one or more Oracle™ databases.


Application platform 518 includes an application setup mechanism 638 that supports application developers' creation and management of applications, which may be saved as metadata into tenant data storage 522 by save routines 636 for execution by subscribers as one or more tenant process spaces 604 managed by tenant management process 610 for example. Invocations to such applications may be coded using PL/SOQL 634 that provides a programming language style interface extension to API 632. A detailed description of some PL/SOQL language embodiments is discussed in commonly owned U.S. Provisional Patent Application 60/828,192 entitled, “PROGRAMMING LANGUAGE METHOD AND SYSTEM FOR EXTENDING APIS TO EXECUTE IN CONJUNCTION WITH DATABASE APIS,” by Craig Weissman, filed Oct. 4, 2006, which is incorporated in its entirety herein for all purposes. Invocations to applications may be detected by one or more system processes, which manage retrieving application metadata 616 for the subscriber making the invocation and executing the metadata as an application in a virtual machine.


Each application server 600 may be communicably coupled to database systems, e.g., having access to system data 525 and tenant data 523, via a different network connection. For example, one application server 6001 might be coupled via the network 514 (e.g., the Internet), another application server 600N-1 might be coupled via a direct network link, and another application server 600N might be coupled by yet a different network connection. Transfer Control Protocol and Internet Protocol (TCP/IP) are typical protocols for communicating between application servers 600 and the database system. However, it will be apparent to one skilled in the art that other transport protocols may be used to optimize the system depending on the network interconnect used.


In certain embodiments, each application server 600 is configured to handle requests for any user associated with any organization that is a tenant. Because it is desirable to be able to add and remove application servers from the server pool at any time for any reason, there is preferably no server affinity for a user and/or organization to a specific application server 600. In one embodiment, therefore, an interface system implementing a load balancing function (e.g., an F5 Big-IP load balancer) is communicably coupled between the application servers 600 and the user systems 512 to distribute requests to the application servers 600. In one embodiment, the load balancer uses a least connections algorithm to route user requests to the application servers 600. Other examples of load balancing algorithms, such as round robin and observed response time, also can be used. For example, in certain embodiments, three consecutive requests from the same user could hit three different application servers 600, and three requests from different users could hit the same application server 600. In this manner, system 516 is multi-tenant, wherein system 516 handles storage of, and access to, different objects, data and applications across disparate users and organizations.


As an example of storage, one tenant might be a company that employs a sales force where each salesperson uses system 516 to manage their sales process. Thus, a user might maintain contact data, leads data, customer follow-up data, performance data, goals and progress data, etc., all applicable to that user's personal sales process (e.g., in tenant data storage 522). In an example of a MTS arrangement, since all of the data and the applications to access, view, modify, report, transmit, calculate, etc., can be maintained and accessed by a user system having nothing more than network access, the user can manage his or her sales efforts and cycles from any of many different user systems. For example, if a salesperson is visiting a customer and the customer has Internet access in their lobby, the salesperson can obtain critical updates as to that customer while waiting for the customer to arrive in the lobby.


While each user's data might be separate from other users' data regardless of the employers of each user, some data might be organization-wide data shared or accessible by a plurality of users or all of the users for a given organization that is a tenant. Thus, there might be some data structures managed by system 516 that are allocated at the tenant level while other data structures might be managed at the user level. Because an MTS might support multiple tenants including possible competitors, the MTS should have security protocols that keep data, applications, and application use separate. Also, because many tenants may opt for access to an MTS rather than maintain their own system, redundancy, up-time, and backup are additional functions that may be implemented in the MTS. In addition to user-specific data and tenant-specific data, system 516 might also maintain system level data usable by multiple tenants or other data. Such system level data might include industry reports, news, postings, and the like that are sharable among tenants.


In certain embodiments, user systems 512 (which may be client systems) communicate with application servers 600 to request and update system-level and tenant-level data from system 516 that may require sending one or more queries to tenant data storage 522 and/or system data storage 524. System 516 (e.g. an application server 600 in system 516) automatically generates one or more SQL statements (e.g. one or more SQL queries) that are designed to access the desired information. System data storage 524 may generate query plans to access the requested data from the database.


Each database can generally be viewed as a collection of objects, such as a set of logical tables, containing data fitted into predefined categories. A “table” is one representation of a data object, and may be used herein to simplify the conceptual description of objects and custom objects according to the present invention. It should be understood that “table” and “object” may be used interchangeably herein. Each table generally contains one or more data categories logically arranged as columns or fields in a viewable schema. Each row or record of a table contains an instance of data for each category defined by the fields. For example, a CRM database may include a table that describes a customer with fields for basic contact information such as name, address, phone number, fax number, etc. Another table might describe a purchase order, including fields for information such as customer, product, sale price, date, etc. In some multi-tenant database systems, standard entity tables might be provided for use by all tenants. For CRM database applications, such standard entities might include tables for Account, Contact, Lead, and Opportunity data, each containing pre-defined fields. It should be understood that the word “entity” may also be used interchangeably herein with “object” and “table”.


In some multi-tenant database systems, tenants may be allowed to create and store custom objects, or they may be allowed to customize standard entities or objects, for example by creating custom fields for standard objects, including custom index fields. U.S. patent application Ser. No. 10/817,161, filed Apr. 2, 2004, entitled “CUSTOM ENTITIES AND FIELDS IN A MULTI-TENANT DATABASE SYSTEM,” which is hereby incorporated herein by reference, teaches systems and methods for creating custom objects as well as customizing standard objects in a multi-tenant database system. In certain embodiments, for example, all custom entity data rows are stored in a single multi-tenant physical table, which may contain multiple logical tables per organization. It is transparent to customers that their multiple “tables” are in fact stored in one large table or that their data may be stored in the same table as the data of other customers.


It should be noted that any of the different embodiments described herein may or may not be equipped with any one or more of the features set forth in one or more of the following published applications: US2003/0233404, titled “OFFLINE SIMULATION OF ONLINE SESSION BETWEEN CLIENT AND SERVER,” filed Nov. 4, 2002; US2004/0210909, titled “JAVA OBJECT CACHE SERVER FOR DATABASES,” filed Jul. 17, 2003, now issued U.S. Pat. No. 7,209,929; US2005/0065925, titled “QUERY OPTIMIZATION IN A MULTI-TENANT DATABASE SYSTEM,” filed Sep. 23, 2003; US2005/0223022, titled “CUSTOM ENTITIES AND FIELDS IN A MULTI-TENANT DATABASE SYSTEM,” filed Jul. 2, 2004; US2005/0283478, titled “SOAP-BASED WEB SERVICES IN A MULTI-TENANT DATABASE SYSTEM,” filed Jun. 16, 2004; and/or US2006/0206834, titled “SYSTEMS AND METHODS FOR IMPLEMENTING MULTI-APPLICATION TABS AND TAB SETS,” filed Mar. 8, 2005; which are each incorporated herein by reference in their entirety for all purposes.


While the invention has been described by way of example and in terms of the specific embodiments, it is to be understood that the invention is not limited to the disclosed embodiments. To the contrary, it is intended to cover various modifications and similar arrangements as would be apparent to those skilled in the art. Therefore, the scope of the appended claims should be accorded the broadest interpretation so as to encompass all such modifications and similar arrangements.

Claims
  • 1. A method of implementing a many-to-many relationship among objects defined for business entities or business activities using database tables in a database service, the method comprising: defining a custom junction object comprising a many-to-many relationship of any tuple, wherein the custom junction object includes at least (i) a first direct parent-child relationship implementing the many-to-many relationship that includes a first parent object and a plurality of child objects, and (ii) a second parent-child relationship that includes a second parent object and the plurality of child objects;storing in the database service, custom junction objects including information about related tuples using the defined custom junction object;obtaining, by running a query for a first account, a first plurality of temporally ordered entities associated with the first account of the database service, wherein the first plurality of temporally ordered entities comprises a final entity associated with a final entity date;inserting the first plurality of temporally ordered entities into a sorted list;obtaining, by running the query for a second account, a second plurality of temporally ordered entities associated with the second account, wherein the second plurality of temporally ordered entities comprises a first entity associated with a first entity date and a second entity associated with a second entity date;inserting the first entity into the sorted list in response to the first entity date not being beyond the final entity date;excluding the second entity from the sorted list in response to the second entity date being beyond the final entity date; andusing the defined custom junction object to provide a result to at least one query based on the sorted list, wherein visibility of child objects in the result is determined by visibility to a source of the first parent object and visibility to a source of the second parent object.
  • 2. The method of claim 1, further comprising defining one or more read-write security criteria associated with the custom junction object and enforcing the read-write security criteria, wherein the read-write security criteria applicable to the child objects depends on a combined evaluation of read-write security criteria applicable to both the first parent object and the second parent object.
  • 3. The method of claim 2, wherein the combined evaluation of first and second parents read-write security criteria allows a child object to be read when both the first parent object and the second parent object are allowed to be read.
  • 4. The method of claim 2, wherein the combined evaluation of first and second parents read-write security criteria allows a child object to be written when both the first parent object and the second parent object are allowed to be written.
  • 5. The method of claim 2, wherein combined evaluation of first and second parents read-write security criteria allows a child object to be written when both the first parent object and the second parent object are allowed to be read, but not written.
  • 6. The method of claim 2, wherein the combined evaluation of first and second parents read-write security criteria allows a child object to be written when at least one of the first parent object and the second parent object are allowed to be written and at least one of the first parent object and the second parent object are allowed to be read but not written.
  • 7. The method of claim 2, wherein the combined evaluation of first and second parents read-write security criteria allows a child object to be written when both the first parent object and the second parent object are allowed to be written.
  • 8. The method of claim 2, wherein the database service includes database tables defining at least one account object, a second object, and a custom junction object that links the account object and the second object as parents in a many-to-many relationship with the plurality of child objects as descendants,wherein the method further comprises:receiving a request by a user to add a further child object to the plurality of child objects;determining permission of the user to add the further child object by evaluating read-write security criteria controlling access by the user to the account object and also evaluating read-write criteria controlling access by the user to the second object;granting to the user, permission to add the further child object that exceeds the read-write security criteria controlling access by the user to at least one of the account object or to the second object; andusing the custom junction object to control visibility to the user of the further child object, wherein visibility of the further child object to the user is determined byvisibility to the user of the account object and visibility to the user of the second object, thereby ensuring that the user has visibility to only those child objects whose parent objects are visible to the user, andwherein the custom junction object is further linked to permissions data for both the account object and the second object and does not include sharing rules.
  • 9. The method of claim 8, wherein deletion of the custom junction object includes cascading deletion of the plurality of child objects.
  • 10. The method of claim 8, wherein the user inherits permission to add a further child from both the account object and the second object according to a rule that the user is granted permission to add a further child object when the user has read but not write access to both the account object and the second object.
  • 11. The method of claim 8, wherein the user inherits permission to add a further child from both the account object and the second object according to a rule that the user is granted permission to add a further child object when the user has read but not write access to one of the account object and the second object and has read-write access to another of the account object and the second object.
  • 12. The method of claim 1, wherein the custom junction object comprises a many-to-many relationship associated with a plurality of arbitrary objects associated with a single household.
  • 13. The method of claim 1, wherein the custom junction object comprises a many-to-many relationship associated with a plurality of arbitrary objects that have a business relationship.
  • 14. The method of claim 1, wherein the database service includes a multi-tenant database service.
  • 15. The method of claim 1, further comprising displaying a detail page associated with at least one parent of the custom junction object, the detail page including a custom related list showing one or more custom junction objects related to at least one parent.
  • 16. The method of claim 1, further comprising displaying a detail page associated with a household, the detail page including a list of children related to one or more accounts associated with the household.
  • 17. The method of claim 1, wherein the first parent object and the second parent object are both parent objects to each one of the plurality of child objects,wherein the method further comprises defining one or more read-write security criteria associated with the custom junction object and enforcing the read-write security criteria, wherein the read-write security criteria applicable to the child objects depends on a combined evaluation of read-write security criteria applicable to both the first parent object and the second parent object, andwherein the read-write security criteria is selectively enforced by enforcing the read-write security criteria when both the first parent object and the second parent object are publicly shared.
  • 18. A non-transitory machine-readable medium impressed with computer program instructions to implement a many-to-many relationship among objects defined for business entities or business activities using database tables in a database service, which instructions, when executed, cause one or more processors to carry out: defining a custom junction object comprising a many-to-many relationship of any tuple, wherein the custom junction object includes at least (i) a first direct parent-child relationship implementing the many-to-many relationship that includes a first parent object and a plurality of child objects, and (ii) a second parent-child relationship that includes a second parent object and the plurality of child objects;storing in the database service, custom junction objects including information about related tuples using the defined custom junction object;obtaining, by running a query for a first account, a first plurality of temporally ordered entities associated with the first account of the database service, wherein the first plurality of temporally ordered entities comprises a final entity associated with a final entity date;inserting the first plurality of temporally ordered entities into a sorted list obtaining, by running the query for a second account, a second plurality of temporally ordered entities associated with the second account, wherein the second plurality of temporally ordered entities comprises a first entity associated with a first entity date and a second entity associated with a second entity date;inserting the first entity into the sorted list in response to the first entity date not being beyond the final entity date;excluding the second entity from the sorted list in response to the second entity date being beyond the final entity date; andusing the defined custom junction object to provide a result based on the sorted list, wherein visibility of child objects in the result is determined by visibility to a source of the first parent object and visibility to a source of the second parent object.
  • 19. An apparatus, comprising: a processor; anda non-transitory computer readable memory with one or more stored sequences of computer program instructions to implement a many-to-many relationship among objects defined for business entities or business activities using database tables in a database service, which instructions, when executed by the processor, cause the processor to carry out:defining a custom junction object comprising a many-to-many relationship of any tuple, wherein the custom junction object includes at least (i) a first direct parent-child relationship implementing the many-to-many relationship that includes a first parent object and a plurality of child objects, and (ii) a second parent-child relationship that includes a second parent object and the plurality of child objects;storing in the database service, custom junction objects including information about related tuples using the defined custom junction object;obtaining, by running a query for a first account, a first plurality of temporally ordered entities associated with the first account of the database service, wherein the first plurality of temporally ordered entities comprises a final entity associated with a final entity date;inserting the first plurality of temporally ordered entities into a sorted listobtaining, by running the query for a second account, a second plurality of temporally ordered entities associated with the second account, wherein the second plurality of temporally ordered entities comprises a first entity associated with a first entity date and a second entity associated with a second entity date;inserting the first entity into the sorted list in response to the first entity date not being beyond the final entity date;excluding the second entity from the sorted list in response to the second entity date being beyond the final entity date; andusing the defined custom junction object to provide a result based on the sorted list, wherein visibility of child objects in the result is determined by visibility to a source of the first parent object and visibility to a source of the second parent object.
  • 20. A method for transmitting code for implementing a many-to-many relationship among objects defined for business entities or business activities using database tables in a multi-tenant database system on a transmission medium, the method comprising: transmitting code for defining a custom junction object comprising a many-to-many relationship of any tuple, wherein the custom junction object includes at least (i) a first direct parent-child relationship implementing the many-to-many relationship that includes a first parent object and a plurality of child objects, and (ii) a second parent-child relationship that includes a second parent object and the plurality of child objects;transmitting code for storing in the multi-tenant database system, custom junction objects including information about related tuples using the defined custom junction object;transmitting code for obtaining, by running a query for a first account, a first plurality of temporally ordered entities associated with the first account of the multi-tenant database system, wherein the first plurality of temporally ordered entities comprises a final entity associated with a final entity date;transmitting code for inserting the first plurality of ordered entities into a sorted listtransmitting code for obtaining, by running the query for a second account, a second plurality of temporally ordered entities associated with the second account, wherein the second plurality of temporally ordered entities comprises a first entity associated with a first entity date and a second entity associated with a second entity date;transmitting code for inserting the first entity into the sorted list in response to the first entity date not being beyond the final entity date;transmitting code for excluding the second entity from the sorted list in response to the second entity date being beyond the final entity date; andtransmitting code for providing a result based on the sorted list and using the defined custom junction object, wherein visibility of child objects in the result is determined by visibility to a source of the first parent object and visibility to a source of the second parent object.
CLAIM OF PRIORITY

This application is a continuation of U.S. patent application Ser. No. 12/196,876, entitled “SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR DEFINING CUSTOM JUNCTION OBJECTS IN AN ON-DEMAND DATABASE SERVICE”, filed Aug. 22, 2008, which claims the benefit of U.S. Provisional Patent Application 60/957,441 entitled “SYSTEM, METHOD AND COMPUTER PRODUCT FOR CUSTOM JUNCTION OBJECTS,” by Simon Wong et al., filed Aug. 22, 2007, the entire contents of which are incorporated herein by reference.

US Referenced Citations (176)
Number Name Date Kind
5577188 Zhu Nov 1996 A
5608872 Schwartz et al. Mar 1997 A
5649104 Carleton et al. Jul 1997 A
5680603 Bhargava et al. Oct 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
5930801 Falkenhainer Jul 1999 A
5963953 Cram et al. Oct 1999 A
6088659 Kelley Jul 2000 A
6092083 Brodersen et al. Jul 2000 A
6161149 Achacoso et al. Dec 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 Nov 2001 B1
6324693 Brodersen et al. Nov 2001 B1
6336137 Lee et al. Jan 2002 B1
D454139 Feldcamp 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
6754885 Dardinski et al. Jun 2004 B1
6763351 Subramaniam et al. Jul 2004 B1
6763501 Zhu et al. Jul 2004 B1
6768904 Kim Jul 2004 B2
6772229 Achacoso et al. Aug 2004 B1
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 et al. 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
7062502 Kesler Jun 2006 B1
7069231 Cinarkaya et al. Jun 2006 B1
7069497 Desai Jun 2006 B1
7076736 Hugh Jul 2006 B2
7181758 Chan Feb 2007 B1
7209929 Dominguez, Jr. et al. Apr 2007 B2
7269795 Whittenberger Sep 2007 B2
7289976 Kihneman et al. Oct 2007 B2
7340411 Cook Mar 2008 B2
7356482 Frankland et al. Apr 2008 B2
7401094 Kesler Jul 2008 B1
7412455 Dillon Aug 2008 B2
7508789 Chan Mar 2009 B2
7603483 Psounis et al. Oct 2009 B2
7620655 Larsson et al. Nov 2009 B2
7698160 Beaven et al. Apr 2010 B2
7774366 Fisher et al. Aug 2010 B2
7779039 Weissman et al. Aug 2010 B2
7779475 Jakobson et al. Aug 2010 B2
7851004 Hirao et al. Dec 2010 B2
8014943 Jakobson Sep 2011 B2
8015495 Achacoso et al. Sep 2011 B2
8032297 Jakobson Oct 2011 B2
8073850 Hubbard et al. Dec 2011 B1
8082301 Ahlgren et al. Dec 2011 B2
8095413 Beaven Jan 2012 B1
8095594 Beaven et al. Jan 2012 B2
8209308 Rueben et al. Jun 2012 B2
8209333 Hubbard et al. Jun 2012 B2
8275836 Beaven et al. Sep 2012 B2
8457545 Chan Jun 2013 B2
8484111 Frankland et al. Jul 2013 B2
8490025 Jakobson et al. Jul 2013 B2
8504945 Jakobson et al. Aug 2013 B2
8510045 Rueben et al. Aug 2013 B2
8510664 Rueben et al. Aug 2013 B2
8566301 Rueben et al. Oct 2013 B2
8646103 Jakobson et al. Feb 2014 B2
8756275 Jakobson Jun 2014 B2
8769004 Jakobson Jul 2014 B2
8769017 Jakobson Jul 2014 B2
9798784 Wong Oct 2017 B1
20010044791 Richter et al. Nov 2001 A1
20020072951 Lee et al. Jun 2002 A1
20020082892 Raffel et al. Jun 2002 A1
20020095408 Cheng Jul 2002 A1
20020129352 Brodersen et al. Sep 2002 A1
20020140731 Subramaniam et al. Oct 2002 A1
20020143997 Huang et al. Oct 2002 A1
20020162090 Parnell et al. Oct 2002 A1
20020165742 Robins Nov 2002 A1
20030004971 Gong et al. Jan 2003 A1
20030018705 Chen et al. Jan 2003 A1
20030018830 Chen et al. Jan 2003 A1
20030066031 Laane 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 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 Oct 2003 A1
20030189600 Gune 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
20030233404 Hopkins Dec 2003 A1
20040001092 Rothwein et al. Jan 2004 A1
20040010489 Rio Jan 2004 A1
20040015981 Coker et al. Jan 2004 A1
20040019494 Ridgeway et al. Jan 2004 A1
20040019518 Abraham et al. Jan 2004 A1
20040027388 Berg et al. Feb 2004 A1
20040128001 Levin et al. Jul 2004 A1
20040186845 Fukui Sep 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
20050065925 Weissman et al. Mar 2005 A1
20050091098 Brodersen et al. Apr 2005 A1
20050223022 Weissman et al. Oct 2005 A1
20050283478 Choi et al. Dec 2005 A1
20060021019 Hinton et al. Jan 2006 A1
20060206834 Fisher et al. Sep 2006 A1
20060206866 Eldrige Sep 2006 A1
20060282433 Dutta et al. Dec 2006 A1
20080249972 Dillon Oct 2008 A1
20090063415 Chatfield et al. Mar 2009 A1
20090100342 Jakobson Apr 2009 A1
20090177744 Marlow et al. Jul 2009 A1
20110218958 Warshavsky et al. Sep 2011 A1
20110247051 Bulumulla et al. Oct 2011 A1
20120042218 Cinarkaya et al. Feb 2012 A1
20120233137 Jakobson et al. Sep 2012 A1
20120290407 Hubbard et al. Nov 2012 A1
20130212497 Zelenko et al. Aug 2013 A1
20130247216 Cinarkaya et al. Sep 2013 A1
Foreign Referenced Citations (1)
Number Date Country
WO-03096225 Nov 2003 WO
Non-Patent Literature Citations (5)
Entry
“Flexible Support for Multiple Access Control Policies” Jajodia et al. (Jun. 2001).
“The ultimate guide to datetime data types.” Nucleus as indexed by internet archive (Apr. 15, 2004).
“Using the catalog views to see table permissions” Louis Davidson as indexed by internet archive (Jul. 4, 2007).
U.S. Appl. No. 10/817,161, filed Apr. 2, 2004.
U.S. Appl. No. 60/828,192, filed Oct. 4, 2006.
Related Publications (1)
Number Date Country
20180052895 A1 Feb 2018 US
Provisional Applications (1)
Number Date Country
60957441 Aug 2007 US
Continuations (1)
Number Date Country
Parent 12196876 Aug 2008 US
Child 15790890 US