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.
The current invention relates generally to look-ups, and more particularly to performing look-ups.
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.
Conventionally, lookups have been performed for identifying stored data. For example, lookups are generally utilized for searching tables, databases, etc. for particular data. Unfortunately, traditional techniques employed for identifying stored data with respect to lookups have exhibited various limitations.
Just by way of example, lookups have traditionally been performed by submitting a call to a data structure (e.g. database, table, etc.) storing the data which is the subject of the lookup. Thus, techniques have not been implemented with respect to lookups in which data may be automatically identified from a predetermined set of data, prior to performing the lookup. To this end, identifying data via lookups has generally required the lookup to be performed in every situation, oftentimes resulting in delay in identifying the data, an efficient usage of system resources, etc.
In accordance with embodiments, there are provided mechanisms and methods for automatically presenting selectable options in a lookup field. These mechanisms and methods for automatically presenting selectable options in a lookup field can enable more efficient identification of data via the lookup. For example, data may be identified without necessarily performing the lookup.
In an embodiment and by way of example, a method is provided for automatically presenting selectable options in a lookup field. In use, input is received in a lookup field utilized for performing lookups. Furthermore, a list of options is automatically presented for selection thereof, based on the input, such that performance of the lookup is prevented upon selection of at least one of the options.
While the present invention is described with reference to an embodiment in which techniques for automatically presenting selectable options in a lookup field 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.
General Overview
Systems and methods are provided for automatically presenting selectable options in a lookup field.
To date, identifying data via lookups has required a call to a data structure to be made. Unfortunately, using calls to data structures each time data is desired to be identified via a lookup has been inefficient. For example, requiring the lookup to be performed in every situation has oftentimes unnecessarily resulted in delay in identifying the data, an efficient usage of system resources, etc.
Thus, mechanisms and methods are provided for automatically presenting selectable options in a lookup field. These mechanisms and methods for automatically presenting selectable options in a lookup field can enable more efficient identification of data via a lookup.
Next, mechanisms and methods for automatically presenting selectable options in a lookup field will be described with reference to exemplary embodiments.
For example, the lookup field may include any field of a record (e.g. a database record) on which a lookup may be performed. For example, the lookup may be performed on the field for populating the field with data (e.g. another record) identified via the lookup. In one embodiment, the lookup field may be utilized for performing lookups on data stored in a database. Of course, the lookup field may be utilized for performing lookups on data stored in any other type of data structure (e.g. a table, etc.).
As another option, the database and/or other type of data structure may be provided by 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 (e.g. tenants). 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. Various examples of such a multi-tenant on-demand database service will be set forth in the context of different embodiments that will be described during reference to subsequent figures.
Additionally, the input received via the lookup may include any type of input capable of being received via the lookup field. In one embodiment, the input may include a single character. In another embodiment, the input may include a string (e.g. string of characters) or optionally a plurality of strings which form a phrase. To this end, the lookup criterion may optionally include text.
In one embodiment, the input may include input to be used to perform the lookup. Just by way of example, the input may include input which is to be looked up (via performance of the lookup). In this way, the input may include information (e.g. associated with an object, a record, etc.) that the user desires to lookup.
It should be noted that the input may be received in the lookup in any desired manner. For example, in one embodiment, the input may be received in the lookup field from a user utilizing a user interface. Thus, the user may enter the input in the lookup field of the user interface. As an option, the user interface may be provided by the multi-tenant on-demand database service, such that the input may be received by the multi-tenant on-demand database service.
Further, a list of options is automatically presented for selection thereof, based on the input, such that performance of the lookup is prevented upon selection of at least one of the options. See operation 104. With respect to the present description, the list of options may include any selectable options that are associated with the input. For example, the list of options may include items (e.g. records) with which the lookup field may be populated.
In one embodiment, the list of options may be generated (prior to the performance of the lookup) for automatic presentation thereof based on the input. For example, the list of options may include items that at least partially match the input. As another example, if the items include records, the list of options may include records with content (e.g. in a field thereof, etc.) that at least partially matches the input. Thus, if the record includes content with a same sequence of characters as the input, the record may be included in the list of options. In another embodiment, the list of options may be generated for automatic presentation thereof in response to receipt of the input.
In another embodiment, the list of options may be generated for automatic presentation thereof based on a predetermined set of options. The predetermined set of options may include items previously viewed within a predetermined period of time, items previously edited within a predetermined period of time, items previously looked up within a predetermined period of time, items previously searched within a predetermined period of time, and/or any other items which may be predetermined.
Optionally, the predetermined set of options may be limited to including items of a single object. For example, the single object may include a plurality of items, one including the lookup field via which the input is received. Thus, the predetermined set of options may be specific to the single object, such that each object may have a different set of predetermined options. As another option, the predetermined set of options may be limited to a predetermined number (e.g. 25, 50, etc.) of options (e.g. options most closely matching the input).
As an option, the predetermined set of options (or a reference thereto) may be stored in a cache (e.g. upon viewing, editing, etc. of such options) for retrieval and use thereof in generating the list of options. The cache may be provided by the multi-tenant on-demand database service, such that the list of options may be automatically presented using the multi-tenant on-demand database service. Accordingly, the list of options may be generated in a manner that is independent of the performance of the lookup.
As noted above, the list of options may be automatically presented (e.g. displayed) for selection thereof. For example, the list of options may be displayed in a drop down list of the user interface via which the input is received. Of course, however, the list of options may be displayed in any desired manner. As an option, the list of options may be sorted alphabetically with respect to the characters existing after the characters that matching the input. Further, a predetermined number of options may be displayed, with a scroll bar appearing for use in scrolling the list of options if the list of options includes more than the predetermined number of options.
The automatic presentation may include presenting the list of options upon receipt of a predetermined number of characters in the lookup field (e.g. 1, 2, etc.), after a predetermined amount of time, etc. In this way, the list of options may be refined based on additional input received in the lookup field (e.g. may be refined to only include items matching the input and the additional input, as entered in the lookup field, etc.). Further, the refined list of options may be automatically presented in response to the receipt of the additional input.
To this end, at least one of the options may be selected (e.g. by a user, etc.) based on the presentation thereof. The selection may be made using arrow keys to navigate through the list to an option and by selecting a tab or enter key, using a mouse, by entering in the lookup field input completely matching one of the options in the list, etc. With respect to the present description, selection of at least one of the options prevents the performance of the lookup (where the lookup would otherwise use the input received via the lookup field to identify data with which the lookup field is to be populated).
For example, the lookup field may be automatically populated with the selected option. In one embodiment where the lookup field includes a field of a record, the field of the record may be automatically populated with the selected option by storing the selected option in the field of the record. In another embodiment where the selected option includes a record, the lookup field may be automatically populated with the record by automatically creating an association (e.g. a join, a reference, etc.) between the record and another record that includes the lookup field via which the input is received. To this end, an auto-complete feature may be provided for the lookup field by automatically presenting a list of options for selection thereof by a user, such that selection of one of such options may prevent a need for the lookup to be performed.
As shown, it is determined whether a record is being created or edited. See decision 202. For example, it may be determined whether an option to create a record or edit an existing record has been received. As another example, it may be determined whether an interface for creating or editing a record is being presented to a user.
If it is determined that a record is not being created or edited, the method 200 continues to wait for creation or editing of a record to be initiated. If, however, it is determined that a record is being created or edited, it is further determined whether input has been received in a lookup field of the record. See decision 204. In one embodiment, determining whether input has been received in the lookup field may include determining whether an option to perform a lookup on a field of the record has been selected, and whether input has been entered into such record for use thereof in performing the lookup. For example, the input may include a character, a string, a phrase, etc.
If it is determined that the input has not been received, the method 200 continues to wait for input to be received. If, however, it is determined that input has been received, a list of records is generated based on the input. See operation 206. In one embodiment, the list of records may be generated by identifying records that match the input, at least in part. For example, records with fields at least partially matching the input may be identified and stored in the list of records for generating the list of records. The records determined to match the input may be selected from a predetermined set of records (e.g. stored in cache, etc.), such as records previously viewed and/or edited within a predetermined amount of time, etc.
Further, as shown in operation 208, the list of records is presented for selection of one of the records. In one embodiment, the list of records may be presented in a drop down list. Of course, however, the list of records may be presented in any manner that allows selection (by a user) of one of the records.
In decision 210 it is determined whether selection of one of the presented records is received. For example, the selection may be made by clicking on a presented record using a mouse. As another example, the selection may be made by entering in the lookup field input exactly matching the presented record. It should be noted that while selection of only one of the presented records is described herein, the selection may be of any number of the presented records.
If it is determined that selection of one of the presented records has been received, the lookup field is automatically populated with the selected record. See operation 212. In this way, the lookup field may be populated without necessarily requiring a lookup to be performed based on the input entered into the lookup field. For example, the selected record may be stored in the lookup field by storing a reference to the selected record. In this way, an association (e.g. a join) between the record which is being created/edited and the selected record may be established via the lookup field.
If it is determined that selection of one of the presented records has not been received, it is further determined whether a command to perform a lookup has been received. See decision 214. The command to perform the lookup may be received in response to a user selection of an option (e.g. user interface button) to perform the lookup.
If it is determined that a command to perform a lookup has not been received, the method 200 again determines whether selection of one of the presented records has been received (decision 210). If, however, it is determined that a command to perform a lookup has been received, the lookup is performed based on the input. See operation 216. It should be noted that the lookup may include any operation that determines whether the input is included in data on which the lookup is performed, with respect to the present description. For example, the lookup may be used to find the input in the data.
In one embodiment, the lookup may be performed by comparing the input to a single field of each of a plurality of records. For example, performing the lookup may include comparing the input to a name field of each record stored in a database, table, etc. As another example, performing the lookup may include comparing the input to a plurality of fields of each record stored in a database, table, etc. In this way, performing the lookup may include determining whether a record includes a field (e.g. name field) matching the input.
Optionally, the lookup may be performed using a search infrastructure. One example of performing a lookup using a search infrastructure is described in co-pending U.S. patent application Ser. No. 12/465,486, entitled “System, Method and Computer Program Product for Performing a Lookup Utilizing a Search Infrastructure,” filed May 13, 2009.
As shown, the user interface 300 of
Upon selection of one of the listed accounts, the selected account (e.g. name of the selected account) is stored in the lookup field, as shown in
Further, as shown in
System Overview
Environment 410 is an environment in which an on-demand database service exists. User system 412 may be any machine or system that is used by a user to access a database user system. For example, any of user systems 412 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 416, 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 416” and “system 416” 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 418 may be a framework that allows the applications of system 416 to run, such as the hardware and/or software, e.g., the operating system. In an embodiment, on-demand database service 416 may include an application platform 418 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 412, or third party application developers accessing the on-demand database service via user systems 412.
The users of user systems 412 may differ in their respective capacities, and the capacity of a particular user system 412 might be entirely determined by permissions (permission levels) for the current user. For example, where a salesperson is using a particular user system 412 to interact with system 416, that user system has the capacities allotted to that salesperson. However, while an administrator is using that user system to interact with system 416, 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 414 is any network or combination of networks of devices that communicate with one another. For example, network 414 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 412 might communicate with system 416 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 412 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 416. Such an HTTP server might be implemented as the sole network interface between system 416 and network 414, but other techniques might be used as well or instead. In some implementations, the interface between system 416 and network 414 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 416, shown in
One arrangement for elements of system 416 is shown in
Several elements in the system shown in
According to one embodiment, each user system 412 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 416 (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 417 of
According to one embodiment, each system 416 is configured to provide webpages, forms, applications, data and media content to user (client) systems 412 to support the access by user systems 412 as tenants of system 416. As such, system 416 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 412, network 414, system 416, tenant data storage 422, and system data storage 424 were discussed above in
Application platform 418 includes a search system 540 for providing a search infrastructure via which searches for records (e.g. in the tenant data storage 422) may be performed. Further, the search infrastructure provided by the search system 540 may also be utilized for performing a lookup, such that lookup search results and features may be provided by the search system 540. Application platform 418 also includes an application setup mechanism 538 that supports application developers' creation and management of applications, which may be saved as metadata into tenant data storage 422 by save routines 536 for execution by subscribers as one or more tenant process spaces 504 managed by tenant management process 510 for example. Invocations to such applications may be coded using PL/SOQL 534 that provides a programming language style interface extension to API 532. 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 516 for the subscriber making the invocation and executing the metadata as an application in a virtual machine.
Each application server 500 may be communicably coupled to database systems, e.g., having access to system data 425 and tenant data 423, via a different network connection. For example, one application server 5001 might be coupled via the network 414 (e.g., the Internet), another application server 500N-1, might be coupled via a direct network link, and another application server 500N 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 500 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 500 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 500. 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 500 and the user systems 412 to distribute requests to the application servers 500. In one embodiment, the load balancer uses a least connections algorithm to route user requests to the application servers 500. 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 500, and three requests from different users could hit the same application server 500. In this manner, system 416 is multi-tenant, wherein system 416 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 416 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 422). 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 416 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 416 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 412 (which may be client systems) communicate with application servers 500 to request and update system-level and tenant-level data from system 416 that may require sending one or more queries to tenant data storage 422 and/or system data storage 424. System 416 (e.g., an application server 500 in system 416) 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 424 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 Apr. 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 Apr. 2, 2004; US2005/0283478, titled “SOAP-BASED WEB SERVICES IN A MULTI-TENANT DATABASE SYSTEM,” filed Jun. 16, 2004; US2006/0206834, titled “SYSTEMS AND METHODS FOR IMPLEMENTING MULTI-APPLICATION TABS AND TAB SETS,” filed Mar. 8, 2005; and/or US2008/0010243, titled “METHOD AND SYSTEM FOR PUSHING DATA TO A PLURALITY OF DEVICES IN AN ON-DEMAND SERVICE ENVIRONMENT,” filed Jun. 1, 2007; 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.
Number | Name | Date | Kind |
---|---|---|---|
5577188 | Zhu | Nov 1996 | A |
5608872 | Schwartz et al. | Mar 1997 | A |
5649104 | Carleton et al. | Jul 1997 | A |
5715450 | Ambrose et al. | Feb 1998 | A |
5761419 | Schwartz et al. | Jun 1998 | A |
5805159 | Bertram et al. | Sep 1998 | A |
5819038 | Carleton et al. | Oct 1998 | A |
5821937 | Tonelli et al. | Oct 1998 | A |
5826257 | Snelling, Jr. | 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 |
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 |
6378042 | Henderson et al. | Apr 2002 | B1 |
6393605 | Loomans | May 2002 | B1 |
6405220 | Brodersen et al. | Jun 2002 | B1 |
6434550 | Warner et al. | Aug 2002 | B1 |
6446089 | Brodersen et al. | Sep 2002 | B1 |
6535909 | Rust | Mar 2003 | B1 |
6549908 | Loomans | Apr 2003 | B1 |
6553563 | Ambrose et al. | Apr 2003 | B2 |
6560461 | Fomukong et al. | May 2003 | B1 |
6574635 | Stauber et al. | Jun 2003 | B2 |
6577726 | Huang et al. | Jun 2003 | B1 |
6601087 | Zhu et al. | Jul 2003 | B1 |
6604117 | Lim et al. | Aug 2003 | B2 |
6604128 | Diec | Aug 2003 | B2 |
6609150 | Lee et al. | Aug 2003 | B2 |
6621834 | Scherpbier et al. | Sep 2003 | B1 |
6654032 | Zhu et al. | Nov 2003 | B1 |
6665648 | Brodersen et al. | Dec 2003 | B2 |
6665655 | Warner et al. | Dec 2003 | B1 |
6684438 | Brodersen et al. | Feb 2004 | B2 |
6711565 | Subramaniam et al. | Mar 2004 | B1 |
6724399 | Katchour et al. | Apr 2004 | B1 |
6728702 | Subramaniam et al. | Apr 2004 | B1 |
6728960 | Loomans | Apr 2004 | B1 |
6732095 | Warshavsky et al. | May 2004 | B1 |
6732100 | Brodersen et al. | May 2004 | B1 |
6732111 | Brodersen et al. | May 2004 | B2 |
6754681 | Brodersen et al. | Jun 2004 | B2 |
6763351 | Subramaniam et al. | Jul 2004 | B1 |
6763501 | Zhu et al. | Jul 2004 | B1 |
6768904 | Kim | Jul 2004 | B2 |
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 | Jan 2005 | B1 |
6850895 | Brodersen et al. | Feb 2005 | B2 |
6850949 | Warner et al. | Feb 2005 | B2 |
7043700 | Bertram et al. | May 2006 | B1 |
7062502 | Kesler | Jun 2006 | B1 |
7181758 | Chan | Feb 2007 | B1 |
7209929 | Dominguez, Jr. et al. | Apr 2007 | B2 |
7216292 | Snapper et al. | May 2007 | B1 |
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 |
7620655 | Larsson et al. | Nov 2009 | B2 |
7698160 | Beaven et al. | Apr 2010 | B2 |
8015495 | Achacoso et al. | Sep 2011 | B2 |
8082301 | Ahlgren et al. | Dec 2011 | B2 |
8095413 | Beaven | Jan 2012 | B1 |
8095594 | Beaven et al. | Jan 2012 | B2 |
8275836 | Beaven et al. | Sep 2012 | B2 |
8407599 | Klein et al. | Mar 2013 | B1 |
8457545 | Chan | Jun 2013 | B2 |
8484111 | Frankland et al. | Jul 2013 | B2 |
20010044791 | Richter et al. | Nov 2001 | A1 |
20020022986 | Coker et al. | Feb 2002 | A1 |
20020029161 | Brodersen et al. | Mar 2002 | A1 |
20020029376 | Ambrose et al. | Mar 2002 | A1 |
20020035577 | Brodersen et al. | Mar 2002 | A1 |
20020035673 | Roseborough et al. | Mar 2002 | A1 |
20020042264 | Kim | Apr 2002 | A1 |
20020042843 | Diec | Apr 2002 | A1 |
20020072951 | Lee et al. | Jun 2002 | A1 |
20020082892 | Raffel et al. | Jun 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 |
20040027388 | Berg et al. | Feb 2004 | A1 |
20040128001 | Levin et al. | Jul 2004 | A1 |
20040186860 | Lee et al. | Sep 2004 | A1 |
20040193510 | Catahan, Jr. 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 |
20050108344 | Tafoya et al. | May 2005 | A1 |
20050223022 | Weissman et al. | Oct 2005 | A1 |
20050283478 | Choi et al. | Dec 2005 | A1 |
20060206834 | Fisher et al. | Sep 2006 | A1 |
20070118844 | Huang et al. | May 2007 | A1 |
20070130137 | Oliver et al. | Jun 2007 | A1 |
20080010243 | Weissman et al. | Jan 2008 | A1 |
20080214150 | Ramer et al. | Sep 2008 | A1 |
20080249972 | Dillon | Oct 2008 | A1 |
20090063415 | Chatfield et al. | Mar 2009 | A1 |
20090158143 | Arav | Jun 2009 | A1 |
Entry |
---|
Harrell, Frank E. Jr. and Aaron Mackey, Details about System Specifications, [online] Jan. 12, 2002 [retrieved on Apr. 25, 2011], retrieved from the Internet URL: http://biostat.mc.vanderbilt.edu/wiki/pub/Main/ResDM/designDetails.pdf. |
U.S. Appl. No. 12/465,486, filed May 13, 2009. |
U.S. Appl. No. 60/828,192, filed Oct. 4, 2006. |