Patent Grant
9626370
Modern data processing systems, such as general purpose computer systems, allow the users of such systems to create a variety of different types of data files. For example, a typical user of a data processing system may create text files with a word processing program such as Microsoft Word or may create an image file with an image processing program such as Adobe's PhotoShop. Numerous other types of files are capable of being created or modified, edited, and otherwise used by one or more users for a typical data processing system. The large number of the different types of files that can be created or modified can present a challenge to a typical user who is seeking to find a particular file which has been created.
Modern data processing systems often include a file management system which allows a user to place files in various directories or subdirectories (e.g. folders) and allows a user to give the file a name. Further, these file management systems often allow a user to find a file by searching for the file's name, or the date of creation, or the date of modification, or the type of file. An example of such a file management system is the Finder program which operates on Macintosh computers from Apple Computer, Inc. of Cupertino, Calif. Another example of a file management system program is the Windows Explorer program which operates on the Windows operating system from Microsoft Corporation of Redmond, Wash. Both the Finder program and the Windows Explorer program include a find command which allows a user to search for files by various criteria including a file name or a date of creation or a date of modification or the type of file. However, this search capability searches through information which is the same for each file, regardless of the type of file. Thus, for example, the searchable data for a Microsoft Word file is the same as the searchable data for an Adobe PhotoShop file, and this data typically includes the file name, the type of file, the date of creation, the date of last modification, the size of the file and certain other parameters which may be maintained for the file by the file management system.
Certain presently existing application programs allow a user to maintain data about a particular file. This data about a particular file may be considered metadata because it is data about other data. This metadata for a particular file may include information about the author of a file, a summary of the document, and various other types of information. A program such as Microsoft Word may automatically create some of this data when a user creates a file and the user may add additional data or edit the data by selecting the “property sheet” from a menu selection in Microsoft Word. The property sheets in Microsoft Word allow a user to create metadata for a particular file or document. However, in existing systems, a user is not able to search for metadata across a variety of different applications using one search request from the user. Furthermore, existing systems can perform one search for data files, but this search does not also include searching through metadata for those files.
Existing systems have the ability to generate an index database of the full content of files, but the process of generating the index does not, in existing systems, attempt to control the indexing process based upon a power state of the data processing system.
Methods for managing data in a data processing system and systems for managing data described herein.
At least some of these methods and systems include the ability to modify how indexing of files (to create an index database) is performed in view of the power state of the systems. These methods and systems may, for example, use different logical queues for indexing tasks that are assigned different priorities, at least when the systems are in certain power states.
These various methods and systems may provide for improved power consumption performance while also providing the ability to maintain databases which a user can use to search for data. In one aspect of the invention, an exemplary method includes determining a power state of a data processing system and establishing a first set of indexing queues or importation queues if the data processing system is in a first power state and establishing a second set of indexing queues or importation queues if the data processing system is in a second power state. The second set of queues may comprise at least two queues and the first set of queues is only one queue in certain embodiments. Indexing tasks in the first set of indexing queues have a higher priority than at least some of the indexing tasks in the second set of indexing queues in certain embodiments. Typically, the first power state is a higher power state, such as when the data processing system is powered by an alternating current source, and the second power state is a lowered powered state such as when the system is powered by a battery.
In another aspect of the present inventions, an exemplary method includes processing requests for indexing files or importation of files at a first priority when a data processing system is in a first power consumption state, and processing requests for indexing of at least some files or importation of at least some files at a second priority when a data processing system is in a second power consumption state.
In another aspect of the inventions described herein, an exemplary method includes determining whether a data processing system is a lower power consumption state, and determining whether, if the data processing system is in a lower power consumption state, an indexing or importation operation is of a first type or a second type, and performing indexing or importation at a first priority if the indexing operation or importation operation is of the first type, and performing indexing or importation at a second priority if the indexing operation or importation operation is of the second type, where in the first priority is a higher priority than the second priority. In one implementation of this exemplary method, the importation or indexing operation is of the first type when importation or indexing is required as a result of a contemporaneous change by a user to a file, and the indexing operation or importation operation is of the second type when indexing or importation is required as a result of an initial index of a volume or a re-index of a removable volume that has files that have been modified since the removable volume was last mounted by the data processing system.
In another aspect of the inventions described herein, an exemplary method includes receiving an indication (e.g. one or more indicators) of a power state (e.g. battery powered only or AC powered, etc.) of a data processing system (e.g. a general purpose computer system or an MP3 music player, etc.) and determining how to process indexing tasks in response to the indication. Typically, in this exemplary method, the determining is performed automatically based upon the indication and may include assigning different processing priorities to different indexing tasks (e.g. background indexing or user initiated indexing of files just changed by a user) which may be stored in different indexing queues which are stored in non-volatile memory, such as a hard drive.
In another aspect of the inventions, an exemplary method limits power consumption by performing indexing operations (or metadata importing/exporting operations) in a sequence which is determined by storage locations; this exemplary method may include determining storage locations of files to be indexed in indexing queues and determining one or more sequences of indexing operations based on the storage locations. For example, if a first set of files to be indexed is on a first storage device having a first spindle (which rotates the media storing the first set of files) and a second set of files to be indexed is on a second storage device (e.g. another hard drive) having a second spindle (which rotates the media storing the second set of files), then a sequence of indexing operations specifies that if the first spindle is spinning and the second spindle is not spinning, the first set of files is to be indexed before beginning to index the second set of files. As a further example, indexing operations may be organized in a sequence to cause the indexing operations to continue indexing files in the same partition as other files currently being indexed before beginning to index files in another partition. As yet another example, indexing operations may be organized in a sequence to cause the indexing operations to continue indexing files of the same user before beginning to index files of another user.
Other aspects of the present inventions include various data processing systems which perform these methods and machine readable media which perform various methods described herein.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.
The subject invention will be described with reference to numerous details set forth below, and the accompanying drawings will illustrate the invention. The following description and drawings are illustrative of the invention and are not to be construed as limiting the invention. Numerous specific details are described to provide a thorough understanding of the present invention. However, in certain instances, well known or conventional details are not described in order to not unnecessarily obscure the present invention in detail.
The present description includes material protected by copyrights, such as illustrations of graphical user interface images. The owners of the copyrights, including the assignee of the present invention, hereby reserve their rights, including copyright, in these materials. 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 file or records, but otherwise reserves all copyrights whatsoever. Copyright Apple Computer, Inc. 2004.
As shown in
It will be apparent from this description that aspects of the present invention may be embodied, at least in part, in software. That is, the techniques may be carried out in a computer system or other data processing system in response to its processor, such as a microprocessor, executing sequences of instructions contained in a memory, such as ROM 107, RAM 105, mass storage 106 or a remote storage device. In various embodiments, hardwired circuitry may be used in combination with software instructions to implement the present invention. Thus, the techniques are not limited to any specific combination of hardware circuitry and software nor to any particular source for the instructions executed by the data processing system. In addition, throughout this description, various functions and operations are described as being performed by or caused by software code to simplify description. However, those skilled in the art will recognize what is meant by such expressions is that the functions result from execution of the code by a processor, such as the microprocessor 103.
Comparing and Use of Metadata Across a Variety of Application Programs
The method of
The method of
One particular field which may be useful in the various metadata formats would be a field which includes an identifier of a plug in or other software element which may be used to capture metadata from a data file and/or export metadata back to the creator application.
Various different software architectures may be used to implement the functions and operations described herein. The following discussion provides one example of such an architecture, but it will be understood that alternative architectures may also be employed to achieve the same or similar results. The software architecture shown in
The software architecture 400 also includes a file system directory 417 for the metadata. This file system directory keeps track of the relationship between the data files and their metadata and keeps track of the location of the metadata object (e.g. a metadata file which corresponds to the data file from which it was extracted) created by each importer. In one exemplary embodiment, the metadata database is maintained as a flat file format as described below, and the file system directory 417 maintains this flat file format. One advantage of a flat file format is that the data is laid out on a storage device as a string of data without references between fields from one metadata file (corresponding to a particular data file) to another metadata file (corresponding to another data file). This arrangement of data will often result in faster retrieval of information from the metadata database 415.
The software architecture 400 of
The method of
It will be appreciated that the notification, if done through the OS kernel, is a global, system wide notification process such that changes to any file will cause a notification to be sent to the metadata processing software. It will also be appreciated that in alternative embodiments, each application program may itself generate the necessary metadata and provide the metadata directly to a metadata database without the requirement of a notification from an operating system kernel or from the intervention of importers, such as the importers 413. Alternatively, rather than using OS kernel notifications, an embodiment may use software calls from each application to a metadata processing software which receives these calls and then imports the metadata from each file in response to the call.
As noted above, the metadata database 415 may be stored in a flat file format in order to improve the speed of retrieval of information in most circumstances. The flat file format may be considered to be a non-B tree, non-hash tree format in which data is not attempted to be organized but is rather stored as a stream of data. Each metadata object or metadata file will itself contain fields, such as the fields shown in the examples of
A flexible query language may be used to search the metadata database in the same way that such query languages are used to search other databases. The data within each metadata file may be packed or even compressed if desirable. As noted above, each metadata file, in certain embodiments, will include a persistent identifier which uniquely identifies its corresponding data file. This identifier remains the same even if the name of the file is changed or the file is modified. This allows for the persistent association between the particular data file and its metadata.
User Interface Aspects
Various different examples of user interfaces for inputting search parameters and for displaying search results are provided herein. It will be understood that some features from certain embodiments may be mixed with other embodiments such that hybrid embodiments may result from these combinations. It will be appreciated that certain features may be removed from each of these embodiments and still provide adequate functionality in many instances.
The combination of text entry region 709 and the search parameter menu bar allow a user to specify a search query or search parameters. Each of the configurable pull down menus presents a user with a list of options to select from when the user activates the pull down menu. As shown in
It will also be appreciated that the various options in the pull down menus may depend upon the fields within a particular type of metadata file. For example, the selection of “images” to be searched may cause the various fields present in the metadata for an image type file to appear in one or more pull down menus, allowing the user to search within one or more of those fields for that particular type of file. Other fields which do not apply to “images” types of files may not appear in these menus in order reduce the complexity of the menus and to prevent user confusion.
Another feature of the present invention is shown in
The window 1001 includes an additional feature which may be very useful while analyzing a search result. A user may select individual files from within the display region 1005 and associate them together as one collection. Each file may be individually marked using a specific command (e.g. pressing the right button on a mouse and selecting a command from a menu which appears on the screen, which command may be “add selection to current group”) or similar such commands. By individually selecting such files or by selecting a group of files at once, the user may associate this group of files into a selected group or a “marked” group and this association may be used to perform a common action on all of the files in the group (e.g. print each file or view each file in a viewer window or move each file to a new or existing folder, etc.). A representation of this marked group appears as a folder in the user-configurable portion 1003A. An example of such a folder is the folder 1020 shown in the user-configurable portion 1003A. By selecting this folder (e.g. by positioning a cursor over the folder 1020 and pressing and releasing a mouse button or by pressing another button) the user, as a result of this selection, will cause the display within the display region 1005 of the files which have been grouped together or marked. Alternatively, a separate window may appear showing only the items which have been marked or grouped. This association or grouping may be merely temporary or it may be made permanent by retaining a list of all the files which have been grouped and by keeping a folder 1020 or other representations of the grouping within the user-configurable side bar, such as the side bar 1003A. Certain embodiments may allow multiple, different groupings to exist at the same time, and each of these groupings or associations may be merely temporary (e.g. they exist only while the search results window is displayed), or they may be made permanent by retaining a list of all the files which have been grouped within each separate group. It will be appreciated that the files within each group may have been created from different applications. As noted above, one of the groupings may be selected and then a user may select a command which performs a common action (e.g. print or view or move or delete) on all of the files within the selected group.
The window 1201 shown in
A column 1211 of window 1201 allows a user to select various search parameters by selecting one of the options which in turn causes the display of a submenu that corresponds to the selected option. In the case of
The window 1301 shown in
The search results user interface shown in
It will be appreciated that this method may employ various alternatives. For example, a window may appear after the command option 2232 or 2233 has been selected, and this window asks for a name for the new folder. This window may display a default name (e.g. “new folder”) in case the user does not enter a new name. Alternatively, the system may merely give the new folder or new storage facility a default path name. Also, the system may merely create the new folder and move or copy the items into the new folder without showing the new window as shown in
Indexing the full text content of files, such as user files, can be a huge power drain particularly when a large number of files need to be indexed or when the content of the files requiring indexing is large. When a data processing system is operating in a high power mode, such as when it is connected to an alternating current source, and there is no requirement or need to place the data processing system in a lower power mode, there is no need to restrain or inhibit indexing for power consumption control. However, when the data processing system is operating on a battery supply rather than an alternating current source (e.g. AC power) or when the user or the system has caused the system to enter a lower power consumption state (e.g. the system has automatically caused the system to enter a lower power consumption state to reduce the operating temperature of the system), then it may be desirable to restrain indexing or importation of files into an indexed database or metadata database respectively. Typically, the indexing of a content of files occurs in at least one of the following situations: (1) as a result of a user driven change such as when a file has just been modified by a user; (2) as a background process to initially index volumes or to re-index files that have been modified since the disks or volumes were last seen by the system; or (3) as a result of a scan or sweep of a volume, which scan or sweep may be scheduled (e.g. scheduled in time) or not scheduled. Similarly, importation of metadata from a file may occur in at least one of the following situations: (1) as a result of the user driven change, such as when a file has just been modified by a user; (2) as a background process to initially import metadata from files on a volume or to update the files that may have been modified since the volume was last seen by the system, such as in the case when the volume is a removable hard drive which sometimes is connected to the system; or (3) as a result of a scan or sweep of a volume, which scan or sweep may be scheduled (e.g. scheduled in time) or not scheduled. The reduction of power consumption by a system will tend to maximize the battery life of a battery which is supplying power to a system or will reduce the amount of heat generated by the system in situations when the heat generated by the system needs to be reduced.
Generally, power consumption may be reduced by achieving, at least partially, at least one or more of the following goals: (1) doing minimal input/output operations when running on batteries; (2) not spinning up a hard disk drive when it is not spinning; (3) not keeping the drive spinning longer than it would otherwise have to spin. One exemplary embodiment uses the following technique to attempt to satisfy at least some of these goals. When indexing or importation is needed as a result of the user making a change, the disk is by definition already spinning and the data is typically in a disk cache so in many embodiments, the indexing or importation is done as soon as possible in order to achieve the first and third goals. When indexing or importation is due to a background indexing or importation, the system will let indexing or importation continue for a period of time, e.g. for two minutes, after the user action or for some other period of time if the disk or hard drive is still spinning in order to allow any short reconciliation scan or operation to complete but not allow an initial scan to make import/output operations for lengthy periods of time which might defeat the first and third goals.
Power consumption may also be reduced by performing indexing operations (and/or metadata importing/exporting operations which add or modify metadata in a metadata database) in a sequence which is determined, at least in part, by storage locations. This technique can reduce the amount of movement of the read/write head of a disk drive and thus reduce the amount of power consumption by a data processing system. An exemplary method which uses this technique may include determining storage locations of files to be indexed in indexing queues and determining one or more sequences of indexing operations based on the storage locations. This exemplary method may also be employed separately or in combination with one or more of the other methods described herein. The storage locations may be based on one or more levels of storage hierarchy. For example, if the first set of files to be indexed is on a first storage device, which has a first spindle (which rotates the media storing the first set of files), and a second set of files to be indexed is on a second storage device (e.g. another hard drive) which has a second spindle (which rotates the media storing the second set of files), then a sequence of indexing operations specifies that if the first spindle is spinning and the second spindle is not spinning, the first set of files is to be indexed before beginning to index the second set of files. Thus, the indexing tasks in an indexing queue can be examined to determine the associated storage locations and the sequence of the tasks can be based, at least in part, on the storage locations. The indexing tasks in the indexing queue can be processed in such a sequence. As a further example, indexing operations may be organized in a sequence to cause the indexing operations to continue indexing files in the same partition (e.g. on a hard drive storage media) as other files which are also stored in that partition and are currently being indexed before beginning to index files in another partition. As yet another example, indexing operations may be organized in a sequence to cause the indexing operations to continue indexing files of the same user (if those files are currently being indexed) before beginning to index files of another user; this particular example is based on an assumption that, in many cases, the same user's files will be stored in close proximity to each other (in terms of storage locations). These methods may also be employed, to reduce power consumption, when harvesting (e.g. importing) metadata for incorporation into a metadata database.
Power consumption may also be controlled by delaying indexing or metadata harvesting if there is heavy disk activity caused by other (non-indexing and non-metadata related) software. Also, a system may prioritize input/output (I/O) requests between indexing tasks and non-indexing tasks, wherein the I/O requests for non-indexing tasks receive a higher priority than the I/O requests for indexing tasks. A similar prioritization of I/O requests may be implemented for metadata related tasks and non-metadata related tasks which are given a higher priority than the metadata related tasks.
Power consumption may also be reduced by coalescing notifications (which are used to activate indexing and/or metadata harvesting) and/or determining an order to scan for files to index (or harvest metadata from). Further details regarding methods for coalescing notifications and determining an order to scan and other techniques which may be used in conjunction with power management methods are described in the U.S. patent application filed by inventors Yan Arrouye, Dominic Oiampaolo and Andrew Carol and entitled “Methods and Systems for Managing Data”, U.S. patent application Ser. No. 11/112,422, now issued as U.S. Pat. No. 7,693,856, which application is also incorporated herein by reference. Power consumption may also be reduced by intelligently indexing files in a variety of ways described in the U.S. patent application filed by inventors Yan Arrouye, Dominic Giampaolo, Andrew Carol, and Steven Zellers and entitled “Methods and Systems for Managing Data”, U.S. patent application Ser. No. 11/112,280, now issued as U.S. Pat. No. 8,131,674, which application is also incorporated herein by reference.
The method of
It will be understood that a system's power state may be indicated by one or more states or parameters or measurements, including whether the system is powered by only a battery or whether the system is powered by AC power, or what the battery's state is (full of charge, half-full, nearly empty) or the heat of the system or the heat in one or more parts of the system, etc.
In the foregoing specification, the invention has been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications may be made thereto without departing from the broader spirit and scope of the invention as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.
This application is a continuation of U.S. application Ser. No. 14/012,232 filed Aug. 28, 2013, now issued as U.S. Pat. No. 9,201,491, which is a continuation of U.S. patent application Ser. No. 11/112,062, filed on Apr. 22, 2005, now issued as U.S. Pat. No. 8,538,997, which is a continuation-in-part of U.S. patent application Ser. No. 10/877,584, filed on Jun. 25, 2004, now issued as U.S. Pat. No. 7,730,012. This application also claims priority to U.S. Provisional Patent Application No. 60/643,087 filed on Jan. 7, 2005, which provisional application is incorporated herein by reference in its entirety; this application claims the benefit of the provisional's filing date under 35 U.S.C. §119(e). This present application hereby claims the benefit of these earlier filing dates under 35 U.S.C. §120.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4270182 | Asija | May 1981 | A |
| 4425615 | Swenson et al. | Jan 1984 | A |
| 4704703 | Fenwick | Nov 1987 | A |
| 4736308 | Heckel | Apr 1988 | A |
| 4939507 | Beard et al. | Jul 1990 | A |
| 4985863 | Fujisawa et al. | Jan 1991 | A |
| 5008853 | Bly et al. | Apr 1991 | A |
| 5072412 | Henderson, Jr. et al. | Dec 1991 | A |
| 5228123 | Heckel | Jul 1993 | A |
| 5241671 | Reed et al. | Aug 1993 | A |
| 5319745 | Vinsonneau et al. | Jun 1994 | A |
| 5355497 | Cohen-Levy | Oct 1994 | A |
| 5392428 | Robins | Feb 1995 | A |
| 5392430 | Chen et al. | Feb 1995 | A |
| 5412809 | Tam et al. | May 1995 | A |
| 5504852 | Thompson-Rohrlich | Apr 1996 | A |
| 5544360 | Lewak et al. | Aug 1996 | A |
| 5557722 | DeRose et al. | Sep 1996 | A |
| 5557793 | Koerber | Sep 1996 | A |
| 5592608 | Weber et al. | Jan 1997 | A |
| 5623681 | Rivette et al. | Apr 1997 | A |
| 5644657 | Capps et al. | Jul 1997 | A |
| 5644776 | DeRose et al. | Jul 1997 | A |
| 5644786 | Gallagher et al. | Jul 1997 | A |
| 5659735 | Parrish et al. | Aug 1997 | A |
| 5666538 | DeNicola | Sep 1997 | A |
| 5708806 | DeRose et al. | Jan 1998 | A |
| 5710844 | Capps et al. | Jan 1998 | A |
| 5761678 | Bendert et al. | Jun 1998 | A |
| 5787296 | Grimsrud et al. | Jul 1998 | A |
| 5828376 | Solimene et al. | Oct 1998 | A |
| 5832500 | Burrows | Nov 1998 | A |
| 5845301 | Rivette et al. | Dec 1998 | A |
| 5890147 | Peltonen et al. | Mar 1999 | A |
| 5944829 | Shimoda | Aug 1999 | A |
| 5968710 | Burrows | Oct 1999 | A |
| 5983248 | DeRose et al. | Nov 1999 | A |
| 6012053 | Pant et al. | Jan 2000 | A |
| 6055543 | Christensen et al. | Apr 2000 | A |
| 6067541 | Raju et al. | May 2000 | A |
| 6072784 | Agrawal et al. | Jun 2000 | A |
| 6101511 | DeRose et al. | Aug 2000 | A |
| 6101512 | DeRose et al. | Aug 2000 | A |
| 6105044 | DeRose et al. | Aug 2000 | A |
| 6115717 | Mehrota et al. | Sep 2000 | A |
| 6119118 | Kain, III et al. | Sep 2000 | A |
| 6134167 | Atkinson | Oct 2000 | A |
| 6185574 | Howard et al. | Feb 2001 | B1 |
| 6216123 | Robertson et al. | Apr 2001 | B1 |
| 6317806 | Audityan et al. | Nov 2001 | B1 |
| 6353823 | Kumar | Mar 2002 | B1 |
| 6363386 | Soderberg et al. | Mar 2002 | B1 |
| 6370562 | Page et al. | Apr 2002 | B2 |
| 6374260 | Hoffert et al. | Apr 2002 | B1 |
| 6389412 | Light | May 2002 | B1 |
| 6400892 | Smith | Jun 2002 | B1 |
| 6401097 | McCotter et al. | Jun 2002 | B1 |
| 6408301 | Patton et al. | Jun 2002 | B1 |
| 6418535 | Kulakowski et al. | Jul 2002 | B1 |
| 6427211 | Watts, Jr. | Jul 2002 | B2 |
| 6434548 | Emens et al. | Aug 2002 | B1 |
| 6457017 | Watkins et al. | Sep 2002 | B2 |
| 6466237 | Miyao et al. | Oct 2002 | B1 |
| 6473794 | Guheen et al. | Oct 2002 | B1 |
| 6480835 | Light | Nov 2002 | B1 |
| 6496877 | Greenberg et al. | Dec 2002 | B1 |
| 6535869 | Housel, III | Mar 2003 | B1 |
| 6564225 | Brogliatti et al. | May 2003 | B1 |
| 6567805 | Johnson et al. | May 2003 | B1 |
| 6613101 | Mander et al. | Sep 2003 | B2 |
| 6621941 | Syeda-Mahmood et al. | Sep 2003 | B1 |
| 6665657 | Dibachi | Dec 2003 | B1 |
| 6671772 | Cousins | Dec 2003 | B1 |
| 6704739 | Craft et al. | Mar 2004 | B2 |
| 6847959 | Arrouye et al. | Jan 2005 | B1 |
| 6892313 | Codilian et al. | May 2005 | B1 |
| 6910106 | Sechrest et al. | Jun 2005 | B2 |
| 6947959 | Gill | Sep 2005 | B1 |
| 6961815 | Kistler et al. | Nov 2005 | B2 |
| 7120806 | Codilian et al. | Oct 2006 | B1 |
| 7127670 | Bendik | Oct 2006 | B2 |
| 7185155 | Sechrest et al. | Feb 2007 | B2 |
| 7191349 | Kaushik et al. | Mar 2007 | B2 |
| 7392253 | Gursky et al. | Jun 2008 | B2 |
| 7398281 | Atchison et al. | Jul 2008 | B2 |
| 7426647 | Fleck et al. | Sep 2008 | B2 |
| 7461271 | Penning et al. | Dec 2008 | B2 |
| 7609472 | Atkinson | Oct 2009 | B2 |
| 7660783 | Reed | Feb 2010 | B2 |
| 7672962 | Arrouye et al. | Mar 2010 | B2 |
| 7693856 | Arrouye et al. | Apr 2010 | B2 |
| 7698513 | Sechrest et al. | Apr 2010 | B2 |
| 7730012 | Arrouye et al. | Jun 2010 | B2 |
| 8032561 | Nadj | Oct 2011 | B1 |
| 8103792 | Tasman | Jan 2012 | B2 |
| 8370395 | Gupta | Feb 2013 | B1 |
| 8799324 | Ngo | Aug 2014 | B2 |
| 20010054042 | Watkins et al. | Dec 2001 | A1 |
| 20020040442 | Ishidera | Apr 2002 | A1 |
| 20020046224 | Bendik | Apr 2002 | A1 |
| 20020049738 | Epstein | Apr 2002 | A1 |
| 20020169771 | Melmon et al. | Nov 2002 | A1 |
| 20020184195 | Qian | Dec 2002 | A1 |
| 20020184496 | Lehmeier et al. | Dec 2002 | A1 |
| 20030001880 | Holtz et al. | Jan 2003 | A1 |
| 20030018622 | Chau | Jan 2003 | A1 |
| 20030061209 | Raboczi et al. | Mar 2003 | A1 |
| 20030074352 | Raboczi et al. | Apr 2003 | A1 |
| 20030084087 | Berry | May 2003 | A1 |
| 20030084359 | Bresniker et al. | May 2003 | A1 |
| 20030088567 | Rosenfelt et al. | May 2003 | A1 |
| 20030088573 | Stickler | May 2003 | A1 |
| 20030100999 | Markowitz | May 2003 | A1 |
| 20030117907 | Kang | Jun 2003 | A1 |
| 20030122873 | Dieberger et al. | Jul 2003 | A1 |
| 20030122874 | Dieberger et al. | Jul 2003 | A1 |
| 20030135828 | Dockter et al. | Jul 2003 | A1 |
| 20030135840 | Szabo et al. | Jul 2003 | A1 |
| 20030140035 | Burrows | Jul 2003 | A1 |
| 20030144990 | Benelisha et al. | Jul 2003 | A1 |
| 20030158855 | Farnham et al. | Aug 2003 | A1 |
| 20030196094 | Hillis et al. | Oct 2003 | A1 |
| 20030200218 | Tijare et al. | Oct 2003 | A1 |
| 20030200234 | Koppich et al. | Oct 2003 | A1 |
| 20040041538 | Sklovsky | Mar 2004 | A1 |
| 20040068627 | Sechrest et al. | Apr 2004 | A1 |
| 20040098540 | Itoh et al. | May 2004 | A1 |
| 20040109255 | Walz | Jun 2004 | A1 |
| 20040193596 | Defelice et al. | Sep 2004 | A1 |
| 20040230572 | Omoigui | Nov 2004 | A1 |
| 20050015712 | Plastina et al. | Jan 2005 | A1 |
| 20050066207 | Fleck et al. | Mar 2005 | A1 |
| 20050071701 | Luick | Mar 2005 | A1 |
| 20050086659 | Huras et al. | Apr 2005 | A1 |
| 20050108001 | Aarskog | May 2005 | A1 |
| 20050228964 | Sechrest et al. | Oct 2005 | A1 |
| 20050235119 | Sechrest et al. | Oct 2005 | A1 |
| 20050267894 | Camahan | Dec 2005 | A1 |
| 20050289193 | Arrouye et al. | Dec 2005 | A1 |
| 20060031263 | Arrouye et al. | Feb 2006 | A1 |
| 20060200446 | Gursky et al. | Sep 2006 | A1 |
| 20070081197 | Omoigui | Apr 2007 | A1 |
| 20070088751 | DeFelice et al. | Apr 2007 | A1 |
| 20070100818 | DeFelice et al. | May 2007 | A1 |
| 20070100899 | Arrouye et al. | May 2007 | A1 |
| 20070112809 | Arrouye et al. | May 2007 | A1 |
| 20070174310 | Arrouye et al. | Jul 2007 | A1 |
| 20080244289 | LeProwse et al. | Oct 2008 | A1 |
| 20080288802 | Fleck et al. | Nov 2008 | A1 |
| 20100095088 | Vorbach | Apr 2010 | A1 |
| 20100145949 | Arrouye et al. | Jun 2010 | A1 |
| Number | Date | Country |
|---|---|---|
| WO 8903089 | Apr 1989 | WO |
| WO 0148870 | Jun 2001 | WO |
| WO 03060774 | Jul 2003 | WO |
| WO 03090056 | Oct 2003 | WO |
| Entry |
|---|
| U.S. Appl. No. 10/407,853, filed Apr. 4, 2003, titled “Method And Apparatus For Tagging And Locating Audio Data”, by Inventor Nikhil Bhatt, 51 pages (specification and drawings). |
| U.S. Appl. No. 10/461,642, filed Jun. 13, 2003, titled “Domain Specific Search Engine”, by Inventor Nikhil Bhatt, 72 pages (specification and drawings). |
| U.S. Appl. No. 10/873,661, filed Jun. 21, 2004, titled “Methods and Apparatuses for Operating a Data Processing System,” by Inventors Bas Ording and Donald Lindsay, 91 pages (specification and drawings). |
| PCT Chapter I International Preliminary Report On Patentability (IPRP Chapter I) PCT/US2005/022536 mailed Dec. 28, 2006. (16 Pages). |
| PCT Invitation To Pay Additional Fees For PCT International Appln No. PCT/US2005/022536, mailed Nov. 16, 2005 (5 pages). |
| PCT International Search Report And Written Opinion for PCT International Appln No. PCT/US2005/022536 mailed Feb. 27, 2006. (23 pages). |
| Baeza-Yates R.A., et al., “New Approaches to Information Management: Attribute-Centric Data Systems”, String Processing and Information Retrieval, 2000. Spire 2000, Proceedings, Seventh International Symposium on Sep. 27-29, 2000, Piscataway, NJ, USA, IEEE, Sep. 27, 2000 (Sep. 27, 2000), pp. 17-27, XP010517584. |
| Bowman, C.M., “A File For Information Management”, Proceedings Of the ISMM International Conference, Intelligent Information Management Systems. Proceedings of ISMM Symposium, Jun. 1, 1994 (Jun. 1, 1994), pp. 66-71, XP002224131. |
| Caban, Pipo, et al., “Improved Downloading Capabilities For Internet Browsers And File Management Capabilities For Windows Explorer To Minimize User Intervention”, Research Disclosure, Mason Publications, Hampshire, GB, vol. 473, No. 23, Sep. 2003 (Sep. 2003), 3 pages. |
| Giampaolo, Dominic, “Practical File System Design with the Be File System”, 1999 Cover Page and Table Of Contents (p. 1-7), Chapters 4&5 (pp. 45-98) and Index (pp. 225-247), Morgan Kaufmann Publishers, San Francisco, CA. |
| Grimes, Richard, “Revolutionary File Storage System Lets Users Search And Manage Files Based On Content”, MSDN Magazine, Jan. 2004, ( 6 pages). |
| Welch, Kevin P., “Find Files Under Presentation Manager And Windows With A Handy Utility”, Microsoft Systems Journal, vol. 4, No. 5, Sep. 1989, pp. 81-88. |
| Duquette, C. “Intelligent Controllers Use Cache to Reduce Seek Time and Latency”, Computer Technology Review, vol. 4, No. 1, Feb. 1984, pp. 277-286. |
| Tandiary, “Batrun: Utilizing Idle Workstations for Large-Scale Computing,” 1996, IEE, pp. 41-48. |
| Number | Date | Country | |
|---|---|---|---|
| 20160154813 A1 | Jun 2016 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60643087 | Jan 2005 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14012232 | Aug 2013 | US |
| Child | 14929045 | US | |
| Parent | 11112062 | Apr 2005 | US |
| Child | 14012232 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10877584 | Jun 2004 | US |
| Child | 11112062 | US |
