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.
One or more implementations relate generally to providing users with clean data. More particularly, it relates to providing clean, complete and accurate business data to business entities.
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.
Used mainly in databases, data cleaning is the process of identifying incomplete and/or incorrect parts of the data and then replacing, modifying, or deleting this “dirty” data. The actual process of data cleaning may involve removing typographical errors or validating and correcting values against a known list of entities. The validation may be strict, such as rejecting any address that does not have a valid postal code, or fuzzy, such as correcting records that partially match existing, known records. Some data cleaning solutions will clean data by cross checking with a validated data set. Data enhancement, where data is made more complete by adding related information, is a common data cleaning practice, such as appending addresses with phone numbers related to that address. In the business world, incorrect data can be costly. Many companies use customer information databases that record data like contact information, addresses, and preferences. For instance, if customer addresses are inconsistent, the company will suffer the cost of resending mail or even losing customers. Much of an average company's customer contact data goes bad annually. Accordingly, it is desirable to provide techniques that enable a database system to clean data in a customer relationship management system.
In accordance with embodiments, there are provided systems and methods for cleaning data in a customer relationship management system. A system receives multiple records from an on-demand system. For example, a customer relationship management system receives records for Apple® Inc. from an on-demand system. The system identifies a record from the multiple records as matching a record stored for a customer relationship management system. For example, the customer relationship management system identifies employee records for Apple® Inc. from the on-demand system that match the employee records stored for Apple® Inc. in the customer relationship management system. The system determines whether to update the stored record using the identified record. For example, the customer relationship management system sends a matching record alert to a system user, receives a user request to view a comparison of matching records, displays a comparison of the matching records to the user, and enables the user to select which customer relationship management records to update using the records received from the on-demand system. In another example, if an administrator for the customer relationship management system selects a blank auto-fill default option, the customer relationship management system automatically updates a blank record stored in the customer relationship management system using a record received from the on-demand system. The system updates the stored record using the identified record. For example, the customer relationship management system updates the employee records stored for Apple® Inc. in the customer relationship management system that differ from the records received for Apple® Inc. from the on-demand system. Accordingly, systems and methods are provided which enable a system to clean data in a customer relationship management system.
While one or more implementations and techniques are described with reference to an embodiment in which cleaning data in a customer relationship management system is implemented in a system having an application server providing a front end for an on-demand database service capable of supporting multiple tenants, the one or more implementations and techniques are not limited to multi-tenant databases nor deployment on application servers. Embodiments may be practiced using other database architectures, i.e., ORACLE®, DB2® by IBM 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. The one or more implementations 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 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 do not necessarily address any of these deficiencies. In other words, different embodiments 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.
In the following drawings like reference numbers are used to refer to like elements. Although the following figures depict various examples, the one or more implementations are not limited to the examples depicted in the figures.
General Overview
Systems and methods are provided for cleaning data in a customer relationship management system.
As used herein, the term multi-tenant database system refers to those systems in which various elements of hardware and software of the database system may be shared by one or more customers. For example, 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. As used herein, the term query plan refers to a set of steps used to access information in a database system.
Next, mechanisms and methods for cleaning data in a customer relationship management system will be described with reference to example embodiments.
The following detailed description will first describe a method for cleaning data in a customer relationship management system.
Next, screen shots illustrating frames of example user interface screens are described.
In block 102, multiple records are received from an on-demand system. For example and without limitation, this can include the database system receiving business records for many different business entities from the on-demand system Data.com®.
In block 104, a record from the multiple records is identified as matching a record stored for a customer relationship management system. By way of example and without limitation, this can include the database system identifying employee records for Apple® Inc. from Data.com® that match the employee records stored for Apple® Inc. in the customer relationship management system provided by Salesfore.com®.
In block 106, a determination is made whether to update the stored record using the identified record. In embodiments, this may include the database system sending a matching record alert to a system user, receiving a user request to view a comparison of matching records, displaying a comparison of the matching records to the user, and enabling the user to select which customer relationship management records to update using the records received from the on-demand system. If an administrator for the customer relationship management system selects a blank auto-fill default option, the database system may also automatically update a blank record stored in the customer relationship management system using a record received from the on-demand system. If a determination is made to update the stored record using the identified record, the method 100 continues to block 108. If a determination is made to not update the stored record using the identified record, the method 100 terminates.
In block 108, the stored record is updated using the identified record. For example and without limitation, the database system updates the employee records stored for Apple® Inc. in the customer relationship management system provided by Salesfore.com® that differ from the records received for Apple® Inc. from Data.com®. In another example, the database system updates the blank employee records stored for Apple® Inc. in the customer relationship management system provided by Salesfore.com® with the records received for Apple® Inc. from Data.com®.
The method 100 may be repeated as desired. Although this disclosure describes the blocks 102-108 executing in a particular order, the blocks 102-108 may be executed in a different order.
The frames 200, 210, 220, and 230 may be part of a larger display screen that includes fields for users to enter commands to create, retrieve, edit, and store records. The database system may output a display screen that includes the frames 200, 210, 220, and 230 in response to a search based on search criteria input via a user interface. Because the frames 200, 210, 220, and 230 are samples, the frames 200, 210, 220, and 230 could vary greatly in appearance. For example, the relative sizes and positioning of the text is not important to the practice of the present disclosure. The frames 200, 210, 220, and 230 can be depicted by any visual display, but are preferably depicted by a computer screen. The frames 200, 210, 220, and 230 could also be output as a report and printed or saved in electronic format, such as PDF. The frames 200, 210, 220, and 230 can be part of a personal computer system and/or a network, and operated from system data received by the network, and/or on the Internet. The frames 200, 210, 220, and 230 may be navigable by a user. Typically, a user can employ a touch screen input or a mouse input device to point-and-click to a location on the frames 200, 210, 220, and 230 to manage the text on the frame 200, 210, 220, and 230, such as a selection that enables a user to edit the text. Alternately, a user can employ directional indicators, or other input devices such as a keyboard. The text depicted by the frames 200, 210, 220, and 230 are examples, as the frames 200, 210, 220, and 230 may include a much greater amount of text. The frames 200, 210, 220, and 230 may also include fields in which a user can input textual information.
System Overview
Environment 310 is an environment in which an on-demand database service exists. User system 312 may be any machine or system that is used by a user to access a database user system. For example, any of user systems 312 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
An on-demand database service, such as system 316, 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 316” and “system 316” 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 318 may be a framework that allows the applications of system 316 to run, such as the hardware and/or software, e.g., the operating system. In an embodiment, on-demand database service 316 may include an application platform 318 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 312, or third party application developers accessing the on-demand database service via user systems 312.
The users of user systems 312 may differ in their respective capacities, and the capacity of a particular user system 312 might be entirely determined by permissions (permission levels) for the current user. For example, where a salesperson is using a particular user system 312 to interact with system 316, that user system has the capacities allotted to that salesperson. However, while an administrator is using that user system to interact with system 316, 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 314 is any network or combination of networks of devices that communicate with one another. For example, network 314 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 one or more implementations might use are not so limited, although TCP/IP is a frequently implemented protocol.
User systems 312 might communicate with system 316 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 312 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 316. Such an HTTP server might be implemented as the sole network interface between system 316 and network 314, but other techniques might be used as well or instead. In some implementations, the interface between system 316 and network 314 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 316, shown in
One arrangement for elements of system 316 is shown in
Several elements in the system shown in
According to one embodiment, each user system 312 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 316 (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 317, 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 316 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 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 316 is configured to provide webpages, forms, applications, data and media content to user (client) systems 312 to support the access by user systems 312 as tenants of system 316. As such, system 316 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.
User system 312, network 314, system 316, tenant data storage 322, and system data storage 324 were discussed above in
Application platform 318 includes an application setup mechanism 438 that supports application developers' creation and management of applications, which may be saved as metadata into tenant data storage 322 by save routines 436 for execution by subscribers as one or more tenant process spaces 404 managed by tenant management process 410 for example. Invocations to such applications may be coded using PL/SOQL 34 that provides a programming language style interface extension to API 432. A detailed description of some PL/SOQL language embodiments is discussed in commonly owned U.S. Pat. No. 7,730,478 entitled, METHOD AND SYSTEM FOR ALLOWING ACCESS TO DEVELOPED APPLICATIONS VIA A MULTI-TENANT ON-DEMAND DATABASE SERVICE, by Craig Weissman, filed Sep. 21, 2007, which is incorporated in its entirety herein for all purposes. Invocations to applications may be detected by one or more system processes, which manages retrieving application metadata 416 for the subscriber making the invocation and executing the metadata as an application in a virtual machine.
Each application server 400 may be communicably coupled to database systems, e.g., having access to system data 325 and tenant data 323, via a different network connection. For example, one application server 4001 might be coupled via the network 314 (e.g., the Internet), another application server 400N-1 might be coupled via a direct network link, and another application server 400N 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 400 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 400 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 400. 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 400 and the user systems 312 to distribute requests to the application servers 400. In one embodiment, the load balancer uses a least connections algorithm to route user requests to the application servers 400. 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 400, and three requests from different users could hit the same application server 400. In this manner, system 316 is multi-tenant, wherein system 316 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 316 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 322). 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 316 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 316 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 312 (which may be client systems) communicate with application servers 400 to request and update system-level and tenant-level data from system 316 that may require sending one or more queries to tenant data storage 322 and/or system data storage 324. System 316 (e.g., an application server 400 in system 316) 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 324 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. 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. Pat. No. 7,779,039, 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.
While one or more implementations have been described by way of example and in terms of the specific embodiments, it is to be understood that one or more implementations are 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.
This application claims the benefit of U.S. Provisional Patent Application 61/701,428 entitled SYSTEM AND METHOD FOR CLEANING DATA IN AN ON-DEMAND SYSTEM, by Pawan Nachnani, et al., filed Sep. 14, 2012, the entire contents of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5577188 | Zhu | Nov 1996 | A |
5608872 | Schwartz | Mar 1997 | A |
5649104 | Carleton | Jul 1997 | A |
5715450 | Ambrose et al. | Feb 1998 | A |
5761419 | Schwartz | Jun 1998 | A |
5819038 | Carleton | 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 |
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 |
6219648 | Jones 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 | Jul 2003 | B1 |
6604117 | Lim et al. | Aug 2003 | B2 |
6604128 | Diec | Aug 2003 | B2 |
6609150 | Lee et al. | Aug 2003 | B2 |
6621834 | Scherpbier | Sep 2003 | B1 |
6654032 | Zhu | 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 et al. | 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 | 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 |
6865268 | Matthews et al. | Mar 2005 | B1 |
7062502 | Kesler | Jun 2006 | B1 |
7069497 | Desai | Jun 2006 | B1 |
7340411 | Cook | Mar 2008 | B2 |
7356482 | Frankland et al. | Apr 2008 | B2 |
7376680 | Kettler et al. | May 2008 | B1 |
7401094 | Kesler | Jul 2008 | B1 |
7529728 | Weissman et al. | May 2009 | B2 |
7580850 | Lurie | Aug 2009 | B2 |
7603483 | Psounis et al. | Oct 2009 | B2 |
7620655 | Larsson | Nov 2009 | B2 |
7698160 | Beaven et al. | Apr 2010 | B2 |
7708202 | Hawkins | May 2010 | B2 |
7730478 | Weissman | Jun 2010 | B2 |
7770039 | DuBose | Aug 2010 | B2 |
7779039 | Weissman | Aug 2010 | B2 |
7779475 | Jakobson et al. | Aug 2010 | B2 |
7814052 | Bezar et al. | Oct 2010 | B2 |
7827138 | Salmon et al. | Nov 2010 | B2 |
7851004 | Hirao et al. | Dec 2010 | B2 |
7930314 | Gupta | Apr 2011 | B2 |
7933587 | Swan | Apr 2011 | B1 |
8010663 | Firminger et al. | Aug 2011 | B2 |
8014943 | Jakobson | Sep 2011 | B2 |
8015495 | Achacoso et al. | Sep 2011 | B2 |
8032297 | Jakobson | Oct 2011 | B2 |
8082301 | Ahlgren et al. | Dec 2011 | B2 |
8095413 | Beaven et al. | Jan 2012 | B1 |
8095594 | Beaven et al. | Jan 2012 | B2 |
8200705 | Wang et al. | Jun 2012 | B2 |
8209308 | Jakobson et al. | Jun 2012 | B2 |
8224830 | Bidlack | Jul 2012 | B2 |
8275836 | Beaven et al. | Sep 2012 | B2 |
8484111 | Frankland et al. | Jul 2013 | B2 |
8490025 | Jakobson et al. | Jul 2013 | B2 |
8504945 | Jakobson 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 |
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 |
20020133392 | Angel 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 | Robbins | Nov 2002 | A1 |
20020198775 | Ryan | Dec 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 |
20030204427 | Gune et al. | Oct 2003 | A1 |
20030206192 | Chen et al. | Nov 2003 | A1 |
20040001092 | Rothwein et al. | Jan 2004 | A1 |
20040015981 | Coker et al. | Jan 2004 | A1 |
20040027388 | Berg et al. | Feb 2004 | A1 |
20040107189 | Burdick et al. | Jun 2004 | A1 |
20040107203 | Burdick et al. | Jun 2004 | A1 |
20040128001 | Levin et al. | Jul 2004 | A1 |
20040179672 | Pagel et al. | Sep 2004 | A1 |
20040181512 | Burdick et al. | 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 |
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 |
20050108041 | White | May 2005 | A1 |
20050283753 | Ho et al. | Dec 2005 | A1 |
20060004869 | Yuster et al. | Jan 2006 | A1 |
20070078950 | Hopkins et al. | Apr 2007 | A1 |
20070088741 | Brooks et al. | Apr 2007 | A1 |
20070130130 | Chan et al. | Jun 2007 | A1 |
20070130137 | Oliver et al. | Jun 2007 | A1 |
20080126333 | Bezar et al. | May 2008 | A1 |
20080162509 | Becker | Jul 2008 | A1 |
20080162544 | Weissman et al. | Jul 2008 | A1 |
20090063415 | Chatfield et al. | Mar 2009 | A1 |
20090083652 | Krasner et al. | Mar 2009 | A1 |
20090100342 | Jakobson | Apr 2009 | A1 |
20090177744 | Marlow et al. | Jul 2009 | A1 |
20090299811 | Verfuerth et al. | Dec 2009 | A1 |
20100030995 | Wang et al. | Feb 2010 | A1 |
20100063959 | Doshi et al. | Mar 2010 | A1 |
20100121923 | Cvetkovic | May 2010 | A1 |
20100179860 | Noel et al. | Jul 2010 | A1 |
20100192067 | Casalaina | Jul 2010 | A1 |
20100223100 | Lee | Sep 2010 | A1 |
20100223284 | Brooks et al. | Sep 2010 | A1 |
20100232585 | Lyman | Sep 2010 | A1 |
20100235322 | Kuruganti | Sep 2010 | A1 |
20100235495 | Petersen et al. | Sep 2010 | A1 |
20100250565 | Tobin et al. | Sep 2010 | A1 |
20100299663 | Weissman et al. | Nov 2010 | A1 |
20100299664 | Taylor | Nov 2010 | A1 |
20100332447 | Bezar et al. | Dec 2010 | A1 |
20110082864 | Banister | Apr 2011 | A1 |
20110082890 | Banister | Apr 2011 | A1 |
20110099042 | Yerkes | Apr 2011 | A1 |
20110113057 | Lee | May 2011 | A1 |
20110113071 | Lee et al. | May 2011 | A1 |
20110113072 | Lee et al. | May 2011 | A1 |
20110137940 | Gradin et al. | Jun 2011 | A1 |
20110145805 | Taylor et al. | Jun 2011 | A1 |
20110209094 | Gasn et al. | Aug 2011 | A1 |
20110225185 | Gupta | Sep 2011 | A1 |
20110225217 | Plax | Sep 2011 | A1 |
20110225500 | Casalaina et al. | Sep 2011 | A1 |
20110225506 | Casalaina et al. | Sep 2011 | A1 |
20110238622 | Walters | Sep 2011 | A1 |
20110238705 | Baker | Sep 2011 | A1 |
20110246449 | Collins et al. | Oct 2011 | A1 |
20110282907 | Ramsey et al. | Nov 2011 | A1 |
20110283224 | Ramsey et al. | Nov 2011 | A1 |
20110295910 | Ziemann et al. | Dec 2011 | A1 |
20110302221 | Tobin et al. | Dec 2011 | A1 |
20110307695 | Slater | Dec 2011 | A1 |
20120016621 | Tan et al. | Jan 2012 | A1 |
20120023107 | Nachnani et al. | Jan 2012 | A1 |
20120059795 | Hersh et al. | Mar 2012 | A1 |
20120072464 | Cohen | Mar 2012 | A1 |
20120086544 | Kemp | Apr 2012 | A1 |
20120089562 | Deremigio | Apr 2012 | A1 |
20120101985 | Kemp et al. | Apr 2012 | A1 |
20120109887 | Ziemann et al. | May 2012 | A1 |
20120143819 | Tan | Jun 2012 | A1 |
20120233137 | Jakobson et al. | Sep 2012 | A1 |
20120259894 | Varley | Oct 2012 | A1 |
20130110565 | Means et al. | May 2013 | A1 |
20130117228 | Appleman | May 2013 | A1 |
20130218948 | Jakobson | Aug 2013 | A1 |
20130218949 | Jakobson | Aug 2013 | A1 |
20130218966 | Jakobson | Aug 2013 | A1 |
20130290690 | Nucci | Oct 2013 | A1 |
20140052695 | Cohen et al. | Feb 2014 | A1 |
Entry |
---|
Chiu, Dickson K. W., et al., “An Event Driven Approach to Customer Relationship Management in e-Brokerage Industry”, HICSS 2003, IEEE Computer Society, Jan. 6-9, 2003, 10 pages. |
Cunningham, Colleen, et al., “Data Warehouse Design to Support Customer Relationship Management Analyses”, Dolap '04, Washington, DC, Nov. 12-13, 2004, pp. 14-22. |
Shanks, Graeme, et al., “A Framework for Understanding Customer Relationship Management Systems Benefits”, Communications of the Association for Information Systems, vol. 25, Article 26, Sep. 2009, 28 pages. |
Hai, Henry, et al., “SaaS and Integration Best Practices”, FUJITSU Sci. Tech. J., vol. 45, No. 3, Jul. 2009, pp. 257-264. |
Microsoft Computer Dictionary, 5th Edition, Microsoft Press, Redmond, WA, © 2002, pp. 351, 385 and 513. |
Weissman, Craig D., et al., “The Design of the Force.com Multitenant Internet Application Development Platform”, SIGMOD '09, Providence, RI, Jun. 29-Jul. 2, 2009, pp. 889-896. |
Pippal, Sanjeev, et al., “An Efficient Schema Shared Approach for Cloud based Multitenant Database with Authentication & Authorization Framework”, 3PGCIC 2011, Barcelona, Spain, Oct. 26-28, 2011, pp. 213-218. |
Jacobs, Dean, et al., “Ruminations on Multi-Tenant Databases”, BTW 2007, Aachen, Germany, Mar. 2007, 8 pages. |
Pippal, Sanjeev, et al., “Secure and Efficeint Multitenant Database for an Ad hoc Cloud”, IWSSC 2011, Milan, Italy, Sep. 5-8, 2011, pp. 46-50. |
Fang, Shaoquan, et al., “A Comparison of Multi-Tenant Data Storage Solutions for a Software-as-a-Service”, ICCSE 2011, Singapore, Aug. 3-5, 2011, pp. 95-98. |
Peterson, Zachary, et al., “Ext3cow: A Time-Shifting System for Regulatory Compliance”, ACM Transactions on Storage, vol. 1, No. 2, May 2005, pp. 190-212. |
Microsoft Computer Dictionary, 5th Edition, Microsoft Press, Redmond, WA, © 2002, pp. 442-443. |
Rao, G. Siva Nageswara, et al., “Removing Inconsistensies and Errors from Original Data Sets through Data Cleansing”, IJETAE, vol. 2, Issue 3, Mar. 2012, pp. 112-115. |
Faruquie, Tanveer A., et al., “Data Cleansing as a Transient Service”, ICDE 2010, Long Beach, CA Mar. 1-6, 2010, pp. 1025-1036. |
Talburt, John, et al., “Customer-Centric InformationQuality Management”, CCIQM Work Group ACXIOM Corp., MITIQ Management Program and Cambridge Research Group, May 24, 2004, pp. 1-9. |
“Oracle Customer Hub”, Oracle Data Sheet, Copyright © 2007, Oracle Corp., pp. 1-13. |
U.S. Appl. No. 13/998,890. |
U.S. Appl. No. 13/987,075. |
U.S. Appl. No. 13/987,074. |
U.S. Appl. No. 13/998,065. |
U.S. Appl. No. 13/986,744. |
U.S. Appl. No. 13/986,251. |
Number | Date | Country | |
---|---|---|---|
20140081908 A1 | Mar 2014 | US |
Number | Date | Country | |
---|---|---|---|
61701428 | Sep 2012 | US |