1. Field of Invention
This invention relates to managing the use of auxiliary memory devices as cache memory.
2. Related Art
Improvements to central processing unit (CPU) hardware have, in general, far outpaced advances made in disk drive memory in terms of speed of operation. As a result, a common bottleneck to improved computer performance has been the time needed to retrieve data from disk drive memory for use by the CPU. To help alleviate this problem, computer systems are commonly operated so as to store (or cache) data needed by the CPU in main system memory, e.g., RAM that is typically located on the computer motherboard and has relatively fast read/write times, especially as compared to magnetic disk memory. Thus, needed data can be moved from a disk drive to the main system memory (preferably before the data is needed by the CPU), helping to speed the computer's operation.
The inventors have appreciated that the use of auxiliary memory, e.g., memories that may or may not be located on the motherboard, in a computer system as cache memory can improve a computer system's performance, particularly if the auxiliary memory read/write time is faster than the memory(ies) on which most of the system's data is stored (often a disk drive or drives). With the more widespread use of flash memory (e.g., in the form of USB memory sticks or other similar devices), a computer system often has access to memory that operates at a faster rate than a disk drive typically employed to store the bulk of a computer's data. If such auxiliary memory has usable space, the memory can help to speed computer function by caching data from slower memories.
In accordance with an aspect of the invention, auxiliary memories that are removable from the computer system may be effectively used as cache memory. (As used herein, removable means that the memory can be ejected or otherwise disconnected from the computer without causing the computer to crash.) For example, the computer system may use a USB flash memory that a user has plugged into a USB port to cache data for use by the CPU. Management of the cached data may be performed so that even in the event that the auxiliary memory is disconnected or otherwise removed from the system, no loss of data will occur. In one embodiment, only so-called “clean” pages, e.g., blocks of data about 4 kB in size that are not subject to modification, are cached on removable and/or non-removable auxiliary memory. Thus, clean pages may have a backup on another memory, such as an internal disk drive, so that removal of the memory will not cause loss of data. Other pages that may be modified, so-called “dirty” pages, may be cached only on non-removable memory, or may also be stored on removable memory if the system is suitably equipped (e.g., has the ability to ask the user to reconnect a removable memory to the computer if the user wants the system/process to continue running or other ability to recover from the loss of the “dirty” page data).
In another aspect of the invention, the computer system may cache virtual pages on an auxiliary memory or memories. In typical caching techniques, the system caches data at a physical level, i.e., blocks of data identified by physical address in a memory (such as a disk drive) are stored on a second memory (such as a cache memory). The inventors have appreciated that this approach may have disadvantages, including inefficient use of cache memory space. For example, a particular process may only require a relatively small portion of a data block, but the memory manager will typically continue to cache the entire block despite the fact that most of the block will not be used. As another example, if a disk drive is defragmented (which essentially involves the physical rearrangement of data on a disk to free up disk space), a complicated scheme is required to relay to the cache management regarding where data to be cached has been moved on the disk so that appropriate data can be cached.
In one aspect of the invention, data may be cached on a virtual level, e.g., in a way that does not identify a cached page by its physical address on memory device, but rather by a virtual identifier that describes the identity of the cached page at a more abstract level. For example, pages may be virtually identified by a page key that includes a tuple of a process employing the page and a virtual address for the page, or a name or handle of a file that includes the page and a file offset. Other virtual page identifiers may be used as suitable. By identifying a page at a virtual level as opposed to a physical level, more efficient caching may be performed since only those pages expected to be used by the CPU need be cached, potentially avoiding the caching of data that is unlikely to be used. Also, since a process may clearly identify which page(s) are released, e.g., by file or process, the cache management system may rapidly release the corresponding data from the cache.
In another aspect of the invention, data may be cached in one or more auxiliary memories that are removable from the computer system. Such auxiliary memories may include any suitable memory type, such as flash memory, disk drive memory, etc., and may be removable from the computer system by physically disconnecting the memory from the computer system while the computer system continues to otherwise operate normally (e.g., by unplugging a flash memory stick from a computer) and/or by disabling a connection between the computer system and the auxiliary memory (e.g., by disabling a local area network connection via which the computer system communicates with an auxiliary memory). Data may be cached on the auxiliary memory in any suitable way, such as by virtual address as discussed above, and/or by physical address. In accordance with an aspect of the invention, the accuracy of data cached on a removable auxiliary memory may be verified if the auxiliary memory is disconnected from the computer system, and then reconnected.
In one aspect of the invention, a computer system includes a processor adapted to execute instructions to carry out one or more functions, and a main system memory adapted to store a plurality of pages of data that are used by the processor in performing the one or more functions. At least one auxiliary memory may be in communication with the processor and be adapted to store a plurality of pages of data for use by the processor, by the processor directly accessing the auxiliary memory and/or indirectly accessing the auxiliary memory by transferring data to be used by the processor from the auxiliary memory to main system memory. A cache manager (e.g., which may be part of a memory manager in the computer operating system) may control the caching of virtual pages of data for use by the processor on the auxiliary memory and may identify virtual pages using a virtual identifier that is not an address that defines a physical location of the virtual page on a memory. In one embodiment, virtual identifier includes a tuple of file and offset information, or a tuple of process and virtual address information. The auxiliary memory may be removable from the computer, and caching of pages may be managed so that loss of data due to removal of the memory is avoided.
In another aspect of the invention, a method of managing virtual pages cached in auxiliary memory of a computer system includes providing a computer system including a processor adapted to execute instructions to carry out one or more functions, a main system memory adapted to store a plurality of pages of data that are used by the processor in performing the one or more functions, and an auxiliary memory in (direct or indirect) communication with the processor. Virtual pages of data may be cached for use by the processor on the auxiliary memory, and the auxiliary memory may be disconnected from the computer system. In one embodiment, the auxiliary memory may be disconnected from the computer system without loss of the cached data.
In another aspect of the invention, a method of managing pages cached in memory of a computer system includes providing a computer system having a processor adapted to execute instructions to carry out one or more functions, main system memory adapted to store a plurality of pages of data that are used by the processor in performing the one or more functions, and an auxiliary memory in communication with the processor. The auxiliary memory may be adapted to store a plurality of pages of data for use by the processor and be removable from the computer system. Pages of data may be cached for use by the processor on the auxiliary memory, and the auxiliary memory disconnected from the computer system. The auxiliary memory may be reconnected to the computer system, and pages cached on the auxiliary memory may be verified to be consistent with corresponding page data stored in another memory of the computer system.
These and other aspects of the invention will be apparent from the following detailed description and claims.
Aspects of the invention are described with reference to illustrative embodiments and the following drawings in which like numerals reference like elements, and wherein:
Aspects of the invention are described below with reference to illustrative embodiments. However, it should be appreciated that aspects of the invention are not limited to any of the particular embodiments. For example, embodiments are described below regarding a general purpose programmable computer with one or more auxiliary memories. However, it should be appreciated that aspects of the invention may be employed in any suitable environment, such as where auxiliary memory used as cache memory are linked by a network connection to the computer.
In this illustrative embodiment, the computer 10 includes a central processing unit (CPU or processor) 1 and main system memory 2 that the processor 1 uses for performing its functions. The main system memory 2 may be located on a motherboard with the processor 1 and may have a relatively high read and/or write speed so that data exchanges with the processor 1 can be performed rapidly, e.g., may include RAM that the processor 1 uses to cache data for use in performing various operations. The computer 10 may also include one or more auxiliary memory devices 3, e.g., memories 3 that are not part of the main system memory and may or may not be located on a motherboard with the processor 1. Although the auxiliary memory devices 3 may function as cache memory in accordance with aspects of the invention, these devices 3 are not limited to functioning as a conventional cache memory. For example, the computer 10 may include as auxiliary memory 3 one or more disk drives 3a where a majority of data used by the computer 10 is stored, an optical memory 3b, and a flash memory device 3c. Other auxiliary memory may be provided, such as volatile or non-volatile RAM of any suitable form. Some of the memories 3 may be located within an outer casing of the computer 10, such as the disk drive 3a and the optical memory 3b, whereas others, such as the flash memory 3c may be located outside of the outer casing of the computer 10. Also, some of the memories, such as the disk drive 3a and the optical memory 3b, may not be removable from the computer 10, whereas other of the auxiliary memory, such as the flash memory device 3c, may be removable (e.g., by unplugging the flash memory 3c at a USB port, PCMCIA connection, a memory card reader or other connection to the computer 10). In some embodiments, auxiliary memory 3 may be provided via a network connection to the computer 10 (e.g., by a network server and/or client on the network), and in such cases the auxiliary memory 3 may be removable from the computer 10, i.e., can be physically disconnected from the computer and/or communication with the memory 3 can be disabled.
In accordance with one aspect of the invention, the computer 10 may store cache data on a removable auxiliary memory 3, such as the flash memory 3c. For example, a memory manager 4, which may be part of the operating system for the computer 10, may direct data to be used by the processor 1 that is located on the disk drive 3a to be cached on the flash memory 3c. The faster read and/or write time of the flash memory 3c as compared to the disk drive 3a may help to speed operation of the computer 10 and/or applications executed by the computer 10 (e.g., by reducing operation time perceived by a user), particularly if the main system memory 2 is full or otherwise cannot be used in an efficient way. The memory manager 4 may operate so that pages that are “in use”, i.e., pages that can be modified by an application without operating system intervention, are cached only at the main system memory 2. However, other data may be cached on the auxiliary memory 3. The memory manager 4 may also operate so that only “clean” pages are cached on removable auxiliary memory 3. That is, only pages that are not modified or will not be modified whether by operating system intervention or not are stored on removable auxiliary memory 3. In this way, if the auxiliary memory 3 is removed, the memory manager 4 may resort to the copy of the page on the disk drive 3a or other memory. As for “dirty” pages, i.e., pages that may be or are modified, the memory manager 4 may cache such pages only on non-removable auxiliary memory 3 (or, of course, main system memory 2). In this way, the computer 10 will not lose modified pages due to removal of the auxiliary memory 3.
In accordance with another aspect of the invention, cached pages stored on removable (or non-removable) auxiliary memory 3 may be encrypted. This approach may help to ensure privacy of cached information (such as credit card numbers, bank accounts, passwords, etc.) that is stored on removable auxiliary memory 3, e.g., in case that sensitive information is cached on a removable memory 3 and the memory 3 is removed, taking the sensitive data with it. By encrypting the cached data, it may be difficult or impossible to recover the information from the removable memory 3 without the necessary encryption key or other information needed to recover the encrypted data. One possible way to encrypt cached pages is to generate a random key and encrypt the page(s) using the key and a suitable encryption algorithm. In another example, the key may be salted based on the specific device offset the page is being written to.
In another aspect of the invention, cached pages on auxiliary memory 3 may be compressed. For example, compression ratios of approximately 2:1 or 3:1, depending on the type of data or other factors may be possible, thereby reducing the amount of space needed to cache data. Cached pages that originate from a file, termed “file pages” herein, may experience a compression ratio of 2:1. Cached pages that cannot be shared and that originate from the virtual address space of a process, termed “private pages” herein, may experience a 3:1 compression ratio. As with all other aspects of the invention which may be combined with other aspects in any suitable way, compression of cached pages may be combined with encryption. In fact, in some embodiments, encryption of the cached data may result in compression of the data as well as encryption.
In another aspect of the invention, bytes of data on auxiliary memory 3 may be shared by multiple cached pages. For example, multiple pages containing the same data can be stored in the same location on the auxiliary memory 3 to further optimize space usage.
In another aspect of the invention, a data authenticity indicator may be generated and used to verify that a cached page (or pages) on an auxiliary memory remains unchanged after communication between the computer system and the auxiliary memory is interrupted (e.g., the auxiliary memory has been “removed” from the computer system). Communication with the auxiliary memory 3 may be interrupted in a variety of ways, such as by the computer 10 powering down, crashing, experiencing a power failure, hibernating, etc., a network connection being cut and/or the auxiliary memory 3 being removed from the computer 10. In such cases, the memory manager 4 cannot be assured that the cached data on the auxiliary memory 3 (or data on the source memory from which the cached data was obtained) has not been maliciously changed or otherwise modified without making some kind of verification. In one embodiment, a hash of cached data (or other cryptographic authenticity indicator for the data) on the auxiliary memory 3 may be generated, e.g., after each write of cached data to the auxiliary memory 3, and used in the case of communication interruption to verify that the cached data on the auxiliary memory 3 after reconnection to the computer 10 remains unchanged from before the communication interruption and/or to verify that cached data at the source memory (such as a disk drive) has not changed. The hash may be determined for each page, for each region of the auxiliary memory 3 and/or the entire memory 3. Before entering a sleep state, each memory 3 and/or the memory manager 4 may mark all of the regions of the memory 3 having cached data so that those regions can be hash-verified after the sleep state is terminated. It may be important to ensure that the hash algorithm is cryptographically strong so that one can be reasonably certain that a hash match provides a suitable guarantee that there has been no alteration of data. In another embodiment, the memory manager 4 may maintain a list of changes to data on a source memory so that the memory manager 4 can determine whether there are any differences between the data on the source memory and corresponding cached data on the auxiliary memory 3, and if so, either discard the cached data or update the data so the cached data reflects changes that have occurred. Of course, it will be understood that another technique that may be used to determine differences between cached data on a removed auxiliary memory 3 and data on a source memory is a comparison of the relevant data to determine whether any differences exist. If differences exist, the cached data may be updated using data from the source memory, the source data may be restored (in the case that the cached data on the removed auxiliary memory 3 is determined to be an appropriate data set for use), or the cached data may be discarded.
In another aspect of the invention, data cached on an auxiliary memory may be cached at a virtual level. For example, the memory manager 4 may identify cached pages by a page key that does not include a physical address for the page on a memory and does not include a physical address for a larger block of data on a memory that includes the page. In one embodiment, pages may be identified by a tuple of the page's file identifier and file offset (e.g., for pages originating from a file) or a tuple of a process using the page and the page's virtual address within the process (e.g., for pages originating from a process). The memory manager 4, which may control the caching of data in a main system memory, may include a cache manager 41 that manages the caching of virtual pages on one or more auxiliary memories 3. (Alternately, the cache manager 41 may be a separate component from the memory manager 4 that interacts with the memory manager 4.) In this embodiment, communication between the memory manager 4 and the cache manager 41 uses page keys to identify pages, and pages may be organized in auxiliary memories 3 in respective stores (i.e., an organizational arrangement for pages and information regarding pages). A policy manager (which may or may not be part of the memory manager 4) may make the decisions regarding which pages are placed in stores 31 on auxiliary memories 3 and when. These decisions may be made based on various factors, including store location, store read/write speed, store size, store removability, page identity, page access history, page compressibility, and others. For example, if the memory manager 4 and/or policy manager determines that caching a set of pages on an auxiliary memory 3 having a read/write speed greater than a disk memory would improve performance of the system, the memory manager 4 may direct the pages expected to be used by the processor 1 be copied to the auxiliary memory 3. In one embodiment shown schematically in
When retrieving a page from a store 31 (e.g., so that an application can use the page) or removing a page from a store 31, the memory manager 4 provides the page key to the cache manager 41. In response, the cache manager 41 may search the PageMap 32 for the corresponding Page keys, identify the store(s) 31 and location(s) for the page, and provide the page to the memory manager 4. A retrieved page may be placed in main system by the memory manager 4, e.g., so that an application can access the page. If the page is not present, e.g., because an auxiliary memory 3 having the cached page has been removed, the cache manager 41 may indicate a failed operation to the memory manager 4. The memory manager 4 may then resort to other copies of the page. Modified pages or pages that are to be modified generally are removed from stores 31 on auxiliary memory 3 because those copies on the stores 31 will become out of date. The cache manager 41 may remove pages from a store 31 without any input/output being required with the respective auxiliary memory 3, e.g., by updating the PageMap 32. With this arrangement, the memory manager 4 may maintain a relatively small amount of information regarding pages, e.g., the page key and a “present bit” which indicates whether a page is present in a store or not, since the cache manager 41 may maintain sufficient information regarding page location, etc.
Aspects, including embodiments described above, can be implemented in any of numerous ways. For example, the embodiments may be implemented using hardware, software or a combination thereof. When implemented in software, the software code can be executed on any suitable processor or collection of processors, whether provided in a single computer or distributed among multiple computers. It should be appreciated that any component or collection of components that perform the functions described above can be generically considered as one or more controllers that control the above-discussed functions. The one or more controllers can be implemented in numerous ways, such as with dedicated hardware, or with general purpose hardware (e.g., one or more processors) that is programmed using microcode or software to perform the functions recited above.
In this respect, it should be appreciated that one implementation of the embodiments of the present invention comprises at least one computer-readable medium (e.g., a computer memory, a floppy disk, a compact disk, a tape, etc.) encoded with a computer program (i.e., a plurality of instructions), which, when executed on a processor, performs the above-discussed functions of embodiments in accordance with aspects of the present invention. The computer-readable medium can be transportable such that the program stored thereon can be loaded onto any computer environment resource to implement the aspects of the present invention discussed herein. In addition, it should be appreciated that the reference to a computer program which, when executed, performs the above-discussed functions, is not limited to an application program running on a host computer. Rather, the term computer program is used herein in a generic sense to reference any type of computer code (e.g., software or microcode) that can be employed to program a processor to implement the above-discussed aspects of the present invention. It should be appreciated that in accordance with several embodiments of the present invention wherein processes are implemented in a computer readable medium, the computer implemented processes may, during the course of their execution, receive input manually (e.g., from a user).
While aspects of the invention have been described with reference to various illustrative embodiments, the invention is not limited to the embodiments described. Thus, it is evident that many alternatives, modifications, and variations of the embodiments described will be apparent to those skilled in the art. Accordingly, embodiments of the invention as set forth herein are intended to be illustrative, not limiting. Various changes may be made without departing from the invention.
Number | Name | Date | Kind |
---|---|---|---|
4476526 | Dodd | Oct 1984 | A |
4612612 | Woffinden et al. | Sep 1986 | A |
4945474 | Elliott | Jul 1990 | A |
4972316 | Dixon | Nov 1990 | A |
4979108 | Crabbe | Dec 1990 | A |
5088026 | Bozman et al. | Feb 1992 | A |
5175834 | Sawai | Dec 1992 | A |
5263136 | DeAguiar | Nov 1993 | A |
5297258 | Hale | Mar 1994 | A |
5307497 | Feigenbaum | Apr 1994 | A |
5394531 | Smith | Feb 1995 | A |
5398325 | Chang et al. | Mar 1995 | A |
5420998 | Horning | May 1995 | A |
5454098 | Pisello | Sep 1995 | A |
5463739 | Albaugh | Oct 1995 | A |
5524230 | Sakaue | Jun 1996 | A |
5551002 | Rosich | Aug 1996 | A |
5557770 | Bhide | Sep 1996 | A |
5561783 | Vanka | Oct 1996 | A |
5572660 | Jones | Nov 1996 | A |
5574877 | Dixit et al. | Nov 1996 | A |
5603001 | Sukegawa | Feb 1997 | A |
5611067 | Okamoto | Mar 1997 | A |
5652857 | Shimoi | Jul 1997 | A |
5666532 | Saks | Sep 1997 | A |
5717954 | Grieff | Feb 1998 | A |
5720029 | Kern | Feb 1998 | A |
5740434 | Eastep | Apr 1998 | A |
5751932 | Horst | May 1998 | A |
5754782 | Masada | May 1998 | A |
5754888 | Yang | May 1998 | A |
5764877 | Lomet | Jun 1998 | A |
5806074 | Souder | Sep 1998 | A |
5809280 | Chard | Sep 1998 | A |
5809543 | Byers et al. | Sep 1998 | A |
5832515 | Ledain | Nov 1998 | A |
5845293 | Veghte et al. | Dec 1998 | A |
5875466 | Wakerly | Feb 1999 | A |
5897638 | Lasser | Apr 1999 | A |
5897660 | Reinders | Apr 1999 | A |
5900022 | Kranich | May 1999 | A |
5900870 | Malone | May 1999 | A |
5923838 | Hongo | Jul 1999 | A |
5943692 | Marberg | Aug 1999 | A |
5996054 | Ledain | Nov 1999 | A |
6000006 | Bruce | Dec 1999 | A |
6018433 | Thayne | Jan 2000 | A |
6018746 | Hill | Jan 2000 | A |
6026027 | Terrell | Feb 2000 | A |
6047291 | Anderson | Apr 2000 | A |
6073232 | Kroeker | Jun 2000 | A |
6092160 | Marsters | Jul 2000 | A |
6098075 | Becraft | Aug 2000 | A |
6101601 | Matthews | Aug 2000 | A |
6108004 | Medl | Aug 2000 | A |
6112024 | Almond | Aug 2000 | A |
6122685 | Bachmat | Sep 2000 | A |
6128627 | Mattis | Oct 2000 | A |
6138125 | DeMoss | Oct 2000 | A |
6148368 | DeKoning | Nov 2000 | A |
6185629 | Simpson | Feb 2001 | B1 |
6189071 | Bachmat | Feb 2001 | B1 |
6199195 | Goodwin | Mar 2001 | B1 |
6209088 | Reneris | Mar 2001 | B1 |
6230233 | Lofgren | May 2001 | B1 |
6237065 | Banerjia | May 2001 | B1 |
6240414 | Beizer | May 2001 | B1 |
6247026 | Waldo | Jun 2001 | B1 |
6249841 | Sikes | Jun 2001 | B1 |
6272534 | Guha | Aug 2001 | B1 |
6275436 | Tobita | Aug 2001 | B1 |
6298428 | Munroe et al. | Oct 2001 | B1 |
6301635 | Bothwell | Oct 2001 | B2 |
6311232 | Cagle | Oct 2001 | B1 |
6314433 | Mills | Nov 2001 | B1 |
6317806 | Audityan | Nov 2001 | B1 |
6321234 | Debrunner | Nov 2001 | B1 |
6338056 | Dessloch | Jan 2002 | B1 |
6338126 | Ohran | Jan 2002 | B1 |
6345000 | Wong | Feb 2002 | B1 |
6360330 | Mutalik | Mar 2002 | B1 |
6366996 | Hobson | Apr 2002 | B1 |
6370534 | Odom | Apr 2002 | B1 |
6370541 | Chou | Apr 2002 | B1 |
6378043 | Girkar | Apr 2002 | B1 |
6401093 | Anand | Jun 2002 | B1 |
6408058 | Lanet | Jun 2002 | B1 |
6418510 | Lamberts | Jul 2002 | B1 |
6425057 | Cherkasova | Jul 2002 | B1 |
6434682 | Ashton | Aug 2002 | B1 |
6438750 | Anderson | Aug 2002 | B1 |
6454159 | Takushima | Sep 2002 | B1 |
6477564 | Freyssinet | Nov 2002 | B1 |
6505205 | Kothuri | Jan 2003 | B1 |
6513051 | Bolosky | Jan 2003 | B1 |
6516380 | Kenchammana-Hoskote | Feb 2003 | B2 |
6519597 | Cheng | Feb 2003 | B1 |
6535949 | Parker | Mar 2003 | B1 |
6539456 | Stewart | Mar 2003 | B2 |
6542904 | Crus | Apr 2003 | B2 |
6556983 | Altschuler | Apr 2003 | B1 |
6557077 | Ghosh | Apr 2003 | B1 |
6560702 | Gharda | May 2003 | B1 |
6567889 | DeKoning | May 2003 | B1 |
6578046 | Chang | Jun 2003 | B2 |
6615313 | Kato | Sep 2003 | B2 |
6629201 | Dempsey | Sep 2003 | B2 |
6636942 | Greco | Oct 2003 | B2 |
6640278 | Nolan | Oct 2003 | B1 |
6647472 | Atkinson | Nov 2003 | B2 |
6651141 | Adrangi | Nov 2003 | B2 |
6671699 | Black | Dec 2003 | B1 |
6671757 | Muller | Dec 2003 | B1 |
6684229 | Luong | Jan 2004 | B1 |
6687158 | Yano | Feb 2004 | B2 |
6694336 | Multer | Feb 2004 | B1 |
6714935 | Delo | Mar 2004 | B1 |
6718361 | Basani | Apr 2004 | B1 |
6721863 | Endo | Apr 2004 | B1 |
6738789 | Multer | May 2004 | B2 |
6742097 | Woo | May 2004 | B2 |
6751658 | Haun | Jun 2004 | B1 |
6757696 | Multer | Jun 2004 | B2 |
6760736 | Waldo | Jul 2004 | B2 |
6769050 | Ware | Jul 2004 | B1 |
6771536 | Li | Aug 2004 | B2 |
6772178 | Mandal | Aug 2004 | B2 |
6782453 | Keltcher | Aug 2004 | B2 |
6788612 | Hsu | Sep 2004 | B2 |
6871271 | Ohran | Mar 2005 | B2 |
6877081 | Herger | Apr 2005 | B2 |
6879266 | Dye | Apr 2005 | B1 |
6901499 | Aasheim | May 2005 | B2 |
6910106 | Sechrest et al. | Jun 2005 | B2 |
6918022 | Li | Jul 2005 | B2 |
6928521 | Burton | Aug 2005 | B1 |
6930919 | Lee | Aug 2005 | B2 |
6938116 | Kim | Aug 2005 | B2 |
6941423 | Coulson | Sep 2005 | B2 |
6959318 | Tso | Oct 2005 | B1 |
6996660 | Moore | Feb 2006 | B1 |
7007072 | Guha | Feb 2006 | B1 |
7010645 | Hetzler | Mar 2006 | B2 |
7017037 | Fortin | Mar 2006 | B2 |
7036040 | Nicholson | Apr 2006 | B2 |
7039765 | Wilkes | May 2006 | B1 |
7043610 | Horn et al. | May 2006 | B2 |
7057942 | Suda | Jun 2006 | B2 |
7062675 | Kemeny | Jun 2006 | B1 |
7065627 | Dayan | Jun 2006 | B2 |
7068575 | Gabryjelski | Jun 2006 | B2 |
7082495 | DeWhitt | Jul 2006 | B2 |
7082499 | Kamitani et al. | Jul 2006 | B2 |
7143120 | Oks | Nov 2006 | B2 |
7171532 | Kodama | Jan 2007 | B2 |
7185155 | Sechrest | Feb 2007 | B2 |
7231497 | Trika | Jun 2007 | B2 |
7284149 | Fisher et al. | Oct 2007 | B1 |
7366740 | Sleeman | Apr 2008 | B2 |
7366866 | Cochran | Apr 2008 | B2 |
7380090 | Koseki | May 2008 | B2 |
7395401 | Sanders | Jul 2008 | B2 |
7409537 | Tsang | Aug 2008 | B2 |
7412369 | Gupta | Aug 2008 | B1 |
7412562 | Garney | Aug 2008 | B2 |
7451353 | Grimsrud | Nov 2008 | B2 |
7490197 | Kirshenbaum | Feb 2009 | B2 |
7631140 | Saito | Dec 2009 | B2 |
7644239 | Ergan | Jan 2010 | B2 |
7698513 | Sechrest | Apr 2010 | B2 |
7774508 | Nakamura | Aug 2010 | B2 |
7805571 | Kirshenbaum | Sep 2010 | B2 |
7814261 | Lee | Oct 2010 | B2 |
7818701 | Kolokowsky | Oct 2010 | B1 |
7945734 | Lahcanski | May 2011 | B2 |
7953774 | Cong | May 2011 | B2 |
8006037 | Kirshenbaum | Aug 2011 | B2 |
8032707 | Iyigun | Oct 2011 | B2 |
8032723 | Sechrest | Oct 2011 | B2 |
8108450 | Cong | Jan 2012 | B2 |
8135914 | Iyigun | Mar 2012 | B2 |
8255645 | Ergan | Aug 2012 | B2 |
20010007123 | Seguchi | Jul 2001 | A1 |
20010007999 | Rasmussen | Jul 2001 | A1 |
20010047462 | Dimitroff | Nov 2001 | A1 |
20020004876 | Timmer | Jan 2002 | A1 |
20020073276 | Howard | Jun 2002 | A1 |
20020083275 | Kawamoto | Jun 2002 | A1 |
20020087797 | Adrangi | Jul 2002 | A1 |
20020091702 | Mullins | Jul 2002 | A1 |
20020108017 | Kenchammana-Hoskote | Aug 2002 | A1 |
20020143521 | Call | Oct 2002 | A1 |
20020152422 | Sharma | Oct 2002 | A1 |
20020156970 | Stewart | Oct 2002 | A1 |
20020171966 | Ottesen | Nov 2002 | A1 |
20020178326 | Ohta | Nov 2002 | A1 |
20020198891 | Li | Dec 2002 | A1 |
20020199075 | Jacobs | Dec 2002 | A1 |
20030009538 | Shah | Jan 2003 | A1 |
20030074550 | Wilks | Apr 2003 | A1 |
20030101320 | Chauvel | May 2003 | A1 |
20030110357 | Nguyen | Jun 2003 | A1 |
20030154314 | Mason | Aug 2003 | A1 |
20030154337 | Ohno | Aug 2003 | A1 |
20030158839 | Faybishenko | Aug 2003 | A1 |
20030177305 | Hetrick | Sep 2003 | A1 |
20030191916 | McBrearty | Oct 2003 | A1 |
20030202377 | Harari | Oct 2003 | A1 |
20030212660 | Kerwin | Nov 2003 | A1 |
20030212857 | Pacheco | Nov 2003 | A1 |
20040003003 | McCartney | Jan 2004 | A1 |
20040003223 | Fortin | Jan 2004 | A1 |
20040010639 | Inoue | Jan 2004 | A1 |
20040015504 | Ahad | Jan 2004 | A1 |
20040019762 | Fukuoka et al. | Jan 2004 | A1 |
20040024795 | Hind | Feb 2004 | A1 |
20040034765 | O'Connell | Feb 2004 | A1 |
20040044776 | Larkin | Mar 2004 | A1 |
20040059747 | Olarig | Mar 2004 | A1 |
20040068627 | Sechrest | Apr 2004 | A1 |
20040078508 | Rivard | Apr 2004 | A1 |
20040093463 | Shang | May 2004 | A1 |
20040103238 | Avraham | May 2004 | A1 |
20040107200 | Sjogren | Jun 2004 | A1 |
20040136259 | Klint | Jul 2004 | A1 |
20040153694 | Nicholson | Aug 2004 | A1 |
20040162950 | Coulson | Aug 2004 | A1 |
20040168018 | Aasheim | Aug 2004 | A1 |
20040172576 | Yoshii | Sep 2004 | A1 |
20040174631 | Tanaka | Sep 2004 | A1 |
20040221089 | Sato | Nov 2004 | A1 |
20040230743 | Ware | Nov 2004 | A1 |
20040243612 | Bailey | Dec 2004 | A1 |
20050005188 | Hsu | Jan 2005 | A1 |
20050021907 | Shimada | Jan 2005 | A1 |
20050111260 | Nazarian | May 2005 | A1 |
20050125708 | Simon | Jun 2005 | A1 |
20050138283 | Garney | Jun 2005 | A1 |
20050141284 | Futatsuyama | Jun 2005 | A1 |
20050145923 | Chen | Jul 2005 | A1 |
20050149750 | Lisanke | Jul 2005 | A1 |
20050160223 | Chen | Jul 2005 | A1 |
20050172067 | Sinclair | Aug 2005 | A1 |
20050193160 | Bhatt et al. | Sep 2005 | A1 |
20050204091 | Kilbuck | Sep 2005 | A1 |
20050228964 | Sechrest | Oct 2005 | A1 |
20050235119 | Sechrest | Oct 2005 | A1 |
20050239494 | Klassen | Oct 2005 | A1 |
20050246487 | Ergan et al. | Nov 2005 | A1 |
20050251617 | Sinclair | Nov 2005 | A1 |
20050262378 | Sleeman | Nov 2005 | A1 |
20050286855 | Saitou | Dec 2005 | A1 |
20060010293 | Schnapp | Jan 2006 | A1 |
20060074953 | Dettinger | Apr 2006 | A1 |
20060075185 | Azzarito | Apr 2006 | A1 |
20060080553 | Hall | Apr 2006 | A1 |
20060087893 | Nishihara | Apr 2006 | A1 |
20060090031 | Kirshenbaum et al. | Apr 2006 | A1 |
20060106889 | Mannby | May 2006 | A1 |
20060112195 | Aoyama | May 2006 | A1 |
20060112215 | Kim et al. | May 2006 | A1 |
20060136472 | Jujjuri | Jun 2006 | A1 |
20060136664 | Trika | Jun 2006 | A1 |
20060155931 | Birrell et al. | Jul 2006 | A1 |
20060177067 | Kim | Aug 2006 | A1 |
20060236034 | Pomaranski et al. | Oct 2006 | A1 |
20060248276 | Kilian et al. | Nov 2006 | A1 |
20060248387 | Nicholson | Nov 2006 | A1 |
20060277359 | Faber | Dec 2006 | A1 |
20070005882 | Gallagher | Jan 2007 | A1 |
20070011405 | Adusumilli | Jan 2007 | A1 |
20070043787 | Cannon | Feb 2007 | A1 |
20070043929 | Safford et al. | Feb 2007 | A1 |
20070061511 | Faber | Mar 2007 | A1 |
20070073764 | Oks | Mar 2007 | A1 |
20070150966 | Kirschner et al. | Jun 2007 | A1 |
20070156954 | Trika | Jul 2007 | A1 |
20070162700 | Fortin | Jul 2007 | A1 |
20070207800 | Daley | Sep 2007 | A1 |
20070208910 | Koseki | Sep 2007 | A1 |
20070233939 | Kim | Oct 2007 | A1 |
20070294474 | Panabaker | Dec 2007 | A1 |
20080010401 | Royer, Jr. | Jan 2008 | A1 |
20080010415 | Sawdey | Jan 2008 | A1 |
20080162485 | Long | Jul 2008 | A1 |
20080172519 | Shmulevich et al. | Jul 2008 | A1 |
20080183958 | Cheriton | Jul 2008 | A1 |
20090144495 | Kirshenbaum | Jun 2009 | A1 |
20090150335 | Latorre et al. | Jun 2009 | A1 |
20090150599 | Bennett | Jun 2009 | A1 |
20090150611 | Fortin | Jun 2009 | A1 |
20090287890 | Bolosky | Nov 2009 | A1 |
20100070701 | Iyigun | Mar 2010 | A1 |
20100070747 | Iyigun | Mar 2010 | A1 |
20100082550 | Cong | Apr 2010 | A1 |
20100199043 | Sechrest | Aug 2010 | A1 |
20100199063 | Sechrest | Aug 2010 | A1 |
20100217929 | Kirshenbaum | Aug 2010 | A1 |
20110197016 | Cong | Aug 2011 | A1 |
20110276743 | Kirshenbaum | Nov 2011 | A1 |
20110314202 | Iyigun | Dec 2011 | A1 |
20120047323 | Sareen | Feb 2012 | A1 |
20120102265 | Cong | Apr 2012 | A1 |
20120173824 | Iyigun | Jul 2012 | A1 |
Number | Date | Country |
---|---|---|
1266229 | Sep 2000 | CN |
1465009 | Dec 2003 | CN |
0 547 992 | Jun 1993 | EP |
0712067 | May 1996 | EP |
0744697 | Nov 1996 | EP |
01-303547 | Dec 1989 | JP |
02-039256 | Feb 1990 | JP |
03-294942 | Dec 1991 | JP |
04-246746 | Sep 1992 | JP |
05-062329 | Mar 1993 | JP |
05-094353 | Apr 1993 | JP |
05-158797 | Jun 1993 | JP |
05-225066 | Sep 1993 | JP |
05-282889 | Oct 1993 | JP |
06-035802 | Feb 1994 | JP |
06-083708 | Mar 1994 | JP |
06-231043 | Aug 1994 | JP |
06-236351 | Aug 1994 | JP |
07-253935 | Oct 1995 | JP |
08-263380 | Oct 1996 | JP |
09-106366 | Apr 1997 | JP |
09-146710 | Jun 1997 | JP |
10-040170 | Feb 1998 | JP |
10-091488 | Apr 1998 | JP |
10-154101 | Jun 1998 | JP |
11-316699 | Nov 1999 | JP |
11-338641 | Dec 1999 | JP |
2001-027967 | Jan 2001 | JP |
2001-067258 | Mar 2001 | JP |
2001-250315 | Sep 2001 | JP |
2002-259186 | Sep 2002 | JP |
2003-076498 | Mar 2003 | JP |
2003-196032 | Jul 2003 | JP |
2003-280950 | Oct 2003 | JP |
2004-021370 | Jan 2004 | JP |
2004-054845 | Feb 2004 | JP |
2004-272324 | Sep 2004 | JP |
2005-044010 | Feb 2005 | JP |
2007-007185 | Jan 2007 | JP |
10-1999-0019377 | Mar 1999 | KR |
10-2000-0039727 | Jul 2000 | KR |
2010317 | Mar 1994 | RU |
479194 | Mar 2002 | TW |
502165 | Sep 2002 | TW |
WO 9318461 | Sep 1993 | WO |
WO 9726600 | Jul 1997 | WO |
WO 0111486 | Feb 2001 | WO |
WO 0157675 | Aug 2001 | WO |
WO 0175581 | Oct 2001 | WO |
WO 0201364 | Jan 2002 | WO |
Entry |
---|
Archer, Tom, “ReadyBoost—Using Your USB Key to Speed Up Windows Vista,” Apr. 2006, http://blogs.msdn.com/b/tomarcher/archive/2006/04/14/576548.aspx. |
Archer, Tom and Ayers, Matt, “ReadyBoost Q&A,” Jun. 2006, http://blogs.msdn.com/b/tomarcher/archive/2006/06/02/615199.aspx. |
CDRinfo, “Microsoft Explains Vista ReadyBoost,” Nov. 2006, http://cdr- info.com/Sections/News/Details.aspx?NewsId=19077. |
Vitter, External Memory Algorithms, PODS, 1998, pp. 119-128. |
Ekman et al., TLB and Snoop Energy-Reduction using Virtual Caches in Low-Power Chip-Multiprocessors, ISLPED, Aug. 2002, pp. 243-246. |
EP Supplementary Search Report, Reference FB24240, Application No. 09813565.0-1229 / 2329360 PCT/US2009056419, Apr. 3, 2012. |
International Search Report from PCT/US2009/056419, reference 325076-03 WO, Mar. 12, 2010. |
International Search Report from PCT/US2009/063127, reference 325668-02 WO, May 31, 2010. |
Zhu, “Power Aware Storage Cache Management”, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801. May 2005. |
Bisson, “A Hybrid Disk-Aware Spin-Down Algorithm with 110 Subsystem Support”, Performance, Computing, and Communications Conference, Apr. 11-13, 2007. |
“Non-Volatile Memory Host Controller Interface (NVMHCI) 1.0”. Apr. 14, 2008. 65 Pages. |
Greenan, “CompulsiveFS: Making NVRAM Suitable for Extremely Reliable Storage”. Feb. 13-16, 2007. |
Darden, “Data Integrity: The Dell|EMC Distinction”, May 2002. 5 Pages. |
CN Notice on the First Office Action for Application No. 200980136912.9, Jan. 14, 2013. |
Ohn, “Path conscious caching of B+ tree indexes in a shared disks cluster”, ScienceDirect, Dec. 4, 2006. |
EP Communication for Application No. 09826570.5-1229 / 2353081 PCT/US2009063127, reference FB24586, May 29, 2012. |
CN Notice on the First Office Action for Application No. 200980145878.1, Jan. 29, 2013. |
Budiu, “A Dual-Disk File System: ext4”, Apr. 16, 1997. |
CN Notice on the First Office Action for Application No. 200980137190.9, Oct. 24, 2012. |
CN Notice on the Second Office Action for Application No. 200980137190.9, Mar. 20, 2013. |
Dove, “Windows XP for embedded applications”, Jul. 10, 2008. |
EP Communication for Application No. 09814983.4-2224/2329361 PCT/US2009055198, Reference FB24231, Oct. 10, 2012. |
iSCSI, “Performance evaluations of iSCSI implementation”, printed Jan. 10, 2008. |
JP Notice of Rejection for Application No. 2011-527865, Oct. 16, 2012. |
Matthews, “Improving File System Performance With Adpative Methods”, Fall 1999. |
Mitchell, “Managing Cache Coherence in Multiprocessor Computer Systems”, printed Jul. 10, 2008. |
Nieplocha, “ARMCI: A Portable Aggregate Remote Memory Copy Interface”, Oct. 30, 2000. |
Novell Documentation: NetWare 6, “NSS Features and Benefits”, printed Jul. 10, 2008. |
PCT International Search Report and Written Opinion for Application No. PCT/US2009/055198, reference 324268-02 WO, Feb. 26, 2010. |
Rosenblum, “The Design and Implementation of a Log-Structured File System”, Proceedings of the 13th ACM Symposium on Operating Systems Principles, Jul. 24, 1991. |
Anderson, “A Case for Buffer Servers”. Proceedings of the Seventh Workshop on Hot Topics in Operating Systems, Mar. 28-30, 1999. |
Andrews, “Combining Language and Database Advances in an Object-Oriented Development Environment”, Conference on Object-Oriented Programming Systems, Languages, and Applications(OOPSLA'87), Oct. 4-8, 1987. |
Beard, “Multilevel and Graphical Views of Metadata”, Fifth International Forum on Research and Technology Advances in Digital Libraries, Apr. 22-24, 1998. |
Beitner, “Multimedia Support and Authoring in Microcosm: an extended model”, 1994. |
Berg, “How Do I Create Persistent Java Objects?”, Dr. Dobb's Journal, Apr. 1997. |
Bhattacharya, “Coordinating Backup/Recovery and Data Consistency Between Database and File Systems”, Proceedings of the 2002 ACM SIGMOND International Conference on Management of Data, Jun. 3-6, 2002. |
Billiris, “The Performance of Three Database Storage Structures for Managing Large Objects”, Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, Jun. 2-5, 1992. |
Booch, “Object-Oriented Analysis and Design with Applications”, The Benjainin/Cummings Publishing Company, Inc., 1994. |
Bracchi, “Binary Logical Associations in Data Modelling”, Modelling in Data Base Management Systems, Proceedings of the IFIP Working Conference on Modelling in Data Base Management Systems, Jan. 5-8, 1976. |
Bullock, “Recovery of Data Pages After Partial Page Writes”, IBM Technical Disclosure Bulletin, Aug. 1, 1991. |
Bunernan, “Inheritance and Persistence in Database Programming Languages”, Proceedings of the 1986 ACM SIGMOD international Conference on Management of Data, May 28-30, 1986. |
Cammarata, “Extending a Relational Database with Deferred Referential Integrity Checking and Intelligent Joins”, Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, May 31-Jun. 2. 1989. |
Chien, “Concurrent Aggregates (CA): Design and Experience with a Concurrent Object-Oriented Language Based on Aggregates”. Journal of Parallel and Distributed Computing, Mar. 1995. |
Chryssostornidis; “Geometric Modeling Issues in Computer Aided Design of Marine Structures”, Marine Technology Society Journal, vol. 22, No. 2, Dec. 1988. |
Ciccozz , “Microsoft Press Computer Dictionary”, Third Edition, 1997. |
CN Notice on First Office Action for Application No. 200510083792.4, Feb. 1, 2008. |
CN Notice on First Office Action for Application No. 200510116208.0, Jun. 6, 2008. |
CN The Second Office Action for Application No. 200510083792.4, Jun. 27, 2008. |
CN The First Office Action for Application No. 200680047384.6, Jan. 22, 2010. |
CN Decision on Rejection for Application No. 200680047384.6, Nov. 11, 2010. |
“Computervision Launches Design Automation Development Platform for Windows, UNIX Desktop Applications”, PR Newswire, Jan. 10, 1995. |
D'Andrea, “UniSQL's Next-Generation Object-Relational Database Management System”, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, vol. 25, No. 3, Sep. 1996. |
Darby, “Object Serialization in Java 1.1: Making Objects Persistent”, WEB Techniques, Sep. 1997. |
“Developer's Guide to Apple Data Detectors—For Version 1.0.2”, Apple Computer, Inc., Dec. 1, 1997. |
Dietrich, Jr., “TGMS: An Object-Oriented System for Programming Geometry”, Software-Practice and Experience, Oct. 1989. |
Dobashi, “Skylight for Interior Lighting Design”, Eurographics '94 Conference Proceedings, vol. 13, No. 3, 1994. |
Dorsch, “Accel signs with IBM to buy Album PCB unit—Accel Technologies acquires the assets to Altium's P-CAD business unit”, LookSmart's FindArticles, Electronic News, Jan. 16, 1995. |
EP Communication for Application No. 05103697.8-2201, Reference EP34979TE900dfi, May 21, 2007. |
EP Communication for Application No. 05109295.5-2201, Reference EP3683ORK900dfi, Jun. 8, 2007. |
EP Communication for Application No. 03022573.4-1229, Reference EP28554-/df, Aug. 2, 2007. |
EP Communication for Application No. 05103697.8-2201, Reference EP349791-E900dfi, Oct. 26, 2007. |
EP Communication for Application No. 03022573.4-1229, Reference EP28554-/df, Nov. 8, 2007. |
EP Communication for Application No. 05103690.3-2201, Reference EP34981TE900kap, Apr. 24, 2008. |
EP Communication for Application No. 05103697.8-2201, Reference EP34979TE900dfi, Jun. 17, 2008. |
EP Communication for Application No. 03022573.4-1229, Reference EP28554-/df, Oct. 6, 2008. |
EP Communication for Application No. 05103697.8-2201, Reference EP34979TE900dfi, Nov. 7, 2008. |
EP Supplementary Search Report for Application No. 06839426, May 4, 2009. |
EP Summons to attend or proceedings for Application No. 05109295.5-2201/1650666, Reference EP36830RK900dfi, Mar. 8, 2012. |
EP Communication for Application No. 09813565.0-1229/2329360 PCT/US2009056419, Apr. 3, 2012. |
EP Communication for Application No. 09826570.5 229/2353081 PCTIUS2009063127, Reference FB24586, May 29, 2012. |
EP Decision to refuse a European Patent for Application No. 05109295.5-2201, Reference EP3683ORK900dfi, Aug. 7, 2012. |
EP Provision of the minutes for Application No. 05109295.5-2201, Reference EP3683ORK900dfi, Aug. 7, 2012. |
Fegaras, “Optimizing Object Queries Using an Effective Calculus”, ACM Transactions on Database Systems, vol. 25, No. 4, Dec. 2000. |
Findler, “Contract Soundness for Object-Oriented Languages”, Proceedings of the 2001 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, Oct. 14-18, 2001. |
Foley, “Computer Graphics: Principles and Practices”, Second Edition, Addison-Wesley Publishing Company, Chapter 5, pp. 201-227, 1990. |
Fox, “Invention: The phantom car”, NewScientist.com, Aug. 17, 2005. |
Friis-Christensen; “Requirements and Research Issues in Geographic Data Modeling”, Proceedings of the 9th ACM International Symposium on Advances in Geographic Information Systems, Nov. 9-10, 2001. |
Fuh, “Implementation of SQL3 Structured Types with Inheritance and Value Substitutability”, Proceedings of 25th International Conference on Very Large Data Bases (VLDB '99), Sep. 7-10, 1999. |
Garret, Jr., “An Object-Oriented Environment for Representing Building Design and Construction Data”, Advanced Construction Technology Center, Mar. 15, 1989. |
Gosciriski, “Distributed Operating Systems: The logical Design”, Addison-Wesley Publishers Ltd., 1991. |
Harrison, “Structure Editors: User-Defined Type Values and Type Inference”, International Conference on Software Methods and Tools (SMT 2000), Nov. 6-9, 2000. |
Haverlock, “Object Serialization, Java, and C++”, Dr. Dobb 's Journal, Aug. 1, 1998. |
Hay, “Data Model Patterns: Convention of Thought”, Dorset House Publishing, Chapter 4 (pp. 46-67), and Chapter 12 (pp. 235-259), 1996. |
Hernandez, “The Merge/Purge Problem for Large Databases”, Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, May 22-25, 1995. |
Hsiao, “DLFM: A Transactional Resource Manager”, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000. |
“Improved Recovery from Partial Page Writes of Data Pages”, IBM Technical Disclosure Bulletin, vol. 36, No. 5, May 1993. |
“Referential Integrity Implementation Details and Advantages”, IBM Technical Disclosure Bulletin, vol. 38, No. 3, Mar. 1995. |
JP Notice of Rejection for Application No. 2005-135274, Sep. 24, 2010. |
JP Notice of Rejection for Application No. 2005-134492, Jan. 25, 2011. |
JP Notice of Rejection for Application No. 2005-306948, Mar. 11, 2011. |
JP Notice of Rejection for Application No. 2005-135274, Sep. 9, 2011. |
JP Notice of Reasons for Rejection for Application No. 2008-545888, Apr. 19, 2012. |
JP Notice of Reasons for Rejection for Application No. 2008-545888, Aug. 29, 2012. |
Kaneko, “Design of 3D CG Data Model of “Move” Animation Database System”, Advanced Database Research and Development Series, Proceedings of the Second Far-East Workshop On Future Database Systems, Apr. 26-28, 1992. |
Kaneko, “Towards Dynamics Animation on Object-Oriented Animation Database System 'MOVE'”, Advanced Database Research and Development Series. Proceedings of the Third International Symposium on Database Systems for Advanced Applications, Apr. 6-8, 1993. |
Katz, “Toward a Unified Framework for Version Modeling in Engineering Databases”, ACM Computing Surveys, vol. 22, No. 4, Dec. 1990. |
Kawabe, “A Framework for 3D Modeling: Constraint-Based Description and Non-Manifold Geometric Modeling”, Organization of Engineering Knowledge for Product Modelling in Computer Integrated Manufacturing, A Collection of Contributions Based on Lectures Presented at the 2nd Toyota Conference, Oct. 2-5, 1988. |
Kempfer, “CAD Jumps on Windows 3.1 Bandwagon”, Computer Aided Engineering, Nov. 1993. |
Khan, “A Performance Evaluation of Storing XML Data in Relational Database Management Systems”, Third International Workshop on Web Information and Data Management (WIM 2001), Nov. 9, 2001. |
Khoshafian, “Object Identity”, Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'86), Sep. 1986. |
Kiesling, “ODBC in UNIX Environments”, Dr. Dobb's Journal, Dec. 2002. |
King, “TriStarp—An Investigation into the Implementation and Exploitation of Binary Relational Storage Structures”, Proceedings of the 8th British National Conference On Data Bases (BNCOD-8), Jul. 9-11, 1990. |
Krouse, “Geometric Models for CAD/CAM”, Machine Design, Jul. 24, 1980. |
Larsen, “Improve Programming Performance with Intel® Flash Memory Enhanced Factory Programming,” Intel Corporation, printed May 9, 2006. |
LeBlanc, “Design Data Storage and Extraction Using Objects”, Concurrent Engineering: Research and Applications, Mar. 1993. |
Leontiev, “On Type Systems for Object-Oriented Database Programming languages”, ACM Computing Surveys, vol. 34, No. 4, Dec. 2002. |
Levy, “Incremental Recovery in Main Memory Database Systems”, IEEE Transactions on Knowledge and Data Engineering, vol. 4, No. 6, Dec. 1992. |
Lim, “Transaction Processing in Mobile, Heterogeneous Database Systems”, IEEE Transactions on Knowledge and Data Engineering, vol. 14, No. 6, Nov./Dec. 2002. |
Mallet, “Myrtle: A set-oriented meta-interpreter driven by a “relational” trace for deductive databases debugging”, Jan. 1999. |
Mariani, “Oggetto: An Object Oriented Database Layered on a Triple Store”, The Computer Journal, vol. 35, No. 2, Apr. 1992. |
McMahon, “SED—A Non-interactive Text Editor”, Bell laboratories, Jan. 10, 1979. |
“Mechanical Design Software”, Computer-Aided Engineering, Dec. 1993. |
Melton, “SQL and Management of External Data”, ACM SIGMOD Record, vol. 30, No. 1, Mar. 2001. |
Mitchell, “The logic of Architecture”, Massachusetts Institute of Technology, pp. 139-143. Apr. 26, 1990. |
Motoazabu, “IEEE1394: A Dream interface at the Turning Pont”, PC User, Softbank Publishing Corporation, Oct. 24, 1999. |
Navathe, “Evolution of Data Modeling for Databases”, Communications of the ACM, vol. 35, No. 9, Sep. 1992. |
Nelson, “Generic Support for Caching and Disconnected Operation”, 4th Workshop on Workstation Operating Systems (WWOS-IV), Oct. 14-15, 1993. |
Nijssen, “Conceptual Schema and Relational Database Design: A Fact Oriented Approach”, Prentice Hall, pp. 9-33, 42-43, 48-51, and 156-171, Jun. 1989. |
“Oracle9i SQL Reference”, Release 2 (9.2), Oct. 2002. |
Orenstein, “Query Processing in the ObjectStore Database System”, Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, Jun. 2-5, 1992. |
Ottogalli, “Visualisation of Distributed Applications for Performance Debugging”, International Conference on Computational Science (ICCS 2001), May 28-30, 2001. |
Pachet, “A Combinatorial Approach to Content-based Music Selection”, Proceedings of the IEEE International Conference on Multimedia Computing and Systems (ICMCS 1999), vol. 1, Jun. 7-11, 1999. |
Papiani, “A Distributed Scientific Data Archive Using the Web, XML and SQL/MED”, SIGMOD Record, Vol. 28, No. 3, Sep. 1999. |
PCT International Search Report and Written Opinion for Application No. PCT/US2006/048402, Reference 314396.02 WO, May 8, 2007. |
Ponnekanti, “Online Index Rebuild”, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000. |
Powell, “Object, References, Identifiers and Equality White Paper”, SunSoft, OMG TC Document No. 93.7.5, Jul. 2, 1993. |
Prosise, “2-D Drafting: Why Pay More?”, PC Magazine, Feb. 23, 1993. |
Ramsey, “An Algebraic Approach to File Synchronization”, Proceedings of the Joint 8th European Software Engineering Conference (ESEC), and the 9th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-9) , Sep. 10-14, 2001. |
Read III, “Developing the Next Generation Cockpit Display System”, Proceedings of the IEEE 1996 National Aerospace and Electronics Conference (NAECON), May 20-23, 1996. |
Reiner, “Benefits of X-based Three-Tier Client/Server Model with ESRI Applications”, Virtual Solutions, 1995. |
Rouse, “CAD Pioneers Are Still Trailblazing”, Machine Design, vol. 59, No. 25, Oct. 22, 1987. |
Roussopoulos, “Using Semantic Networks for Data Base Management”, Proceedings of the First International Conference on Very Large Data Bases (VLDB'75), Sep. 22-24, 1975. |
RU Official Action for Application No. 2003129662, Nov. 11, 2007. |
“Optimization of CF Host Operation,” SanDisk® Corporation, Feb. 28, 2005. |
Santos, “Computer Aided Mechanicai Engineering Design Environment for Concurrent Design Process”, Proceedings of the 1993 ITEC Workshop on Concurrent Engineering, Simulation in Concurrent Engineering, May 4-6, 1993. |
Seshadri, “Enhanced abstract data types in object-relational databases”, The VLB Journal, The International Journal on Very Large Databases, vol. 7, No. 3, Aug. 1998. |
Sirnoes, “A RISC-Microcontroller Based Photovoltaic System for Illumination Applications”, Fifteenth Annual IEEE Applied Power Electronics Conference and Exposition (APEC 2000), Feb. 6-10, 2000. |
Simon, “Strategic Database Technology. Management for the Year 2000”, Morgan Kaufmann Publishers, Inc., pp. 3-33, 55-69, May 1995. |
Singhal, “DDB: An Object Oriented Design Data Manager for VLSI CAD”, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, May 26-28, 1993. |
“Optimizing Program/Erase Times”, Spansion™, Sep. 2, 2004. |
Sreekanth, “A Specification EnvirOnMent for Configuring a Discrete-Part Manufacturing System Simulation Infrastructure”, International Conference on Systems, Man and Cybernetics, Systems Engineering in the Service of Humans, Oct. 17-20, 1993. |
Sreenath, “A hybrid computation environment for multibody simulation”, Mathematics and Computers in Simulation, vol. 34, Issue 2, Aug. 1992. |
Stevens, “Value in 3-D”, Industry Week, Jan. 8, 1996. |
Stonebraker, “The Case for Partial Indexes”, SIGMO Record, vol. 18, No. 4, Dec. 1989. |
Strickland, “Intersection of Relational and Object”, Proceedings of the AM/FM International Conference XVII, Mar. 14-17, 1994. |
Sutherland, “The Hybrid Object-Relational Architecture (HORA): An Integration of Object-Oriented and Relational Technology”, Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing, States of the Art and Practice, Feb. 14-16, 1993. |
Suzuki, “Geometric Modeling for Modeling Products”, Proceedings of the Third International Conference on Engineering Graphics and Descriptive Geometry, vol. 2, Jul. 11-16, 1988. |
Taylor, “An Integrated Robot System Architecture”, Proceedings of the IEEE, vol. 71, No. 7, Jul. 1983. |
TW Search Report for Application No. 094114140, Nov. 22, 2011. |
Varlarnis, “Bridging XML-Schema and relational databases. A system for generating and manipulating relational databases using valid XML documents”, Proceedings of the 2001 ACM Symposium on Document Engineering, Nov. 9-10, 2001. |
Watanabe, “Knowledge Integration for Architectural Design”, Knowledge-Based Computer-Aided Architectural Design, Jul. 1994. |
Waugh, “Specifying metadata standards for metadata tool configuration”, Computer Networks and ISDN Systems, Proceedings of the Seventh International World Wide Web Conference, Apr. 14-18, 1998. |
Wilcox, “Object Databases: Object methods in distributed computing” Dr. Dobbs Journal, Nov. 1994. |
Wold, “Content-Based Classification, Search, and Retrieval of Audio”, IEEE MultiMedia, vol. 3, Issue 3, Sep. 1996. |
Yoshikawa, “XRel: A Path-Based Approach to Storage and Retrieval of XML Documents Using Relational Databases”, ACM Transactions on Internet Technology, vol. 1, No. 1, Aug. 2001. |
CA Examiner's Report for Application No. 2,523,761, Feb. 26, 2013. |
IL Notification of Defects in Patent Application No. 191502, Feb. 17, 2013. |
JP Notice of Rejection for Application No. 2012-111004, May 14, 2013. |
Number | Date | Country | |
---|---|---|---|
20090150611 A1 | Jun 2009 | US |