Methods and systems for processing media files

Information

  • Patent Grant
  • 9311408
  • Patent Number
    9,311,408
  • Date Filed
    Thursday, December 12, 2013
    10 years ago
  • Date Issued
    Tuesday, April 12, 2016
    8 years ago
Abstract
Systems and methods for processing media files are described. In one embodiment, one or more events are captured having associated event data and associated with a client device, wherein each event is associated with an article and at least one of the articles is a media file, wherein at least one of the events is captured in real time upon the occurrence of the event, at least some of the event data and articles associated with the events are indexed and stored, a search query is received, and the at least one media file is determined as relevant to the search query.
Description
FIELD OF THE INVENTION

The invention generally relates to search engines. More particularly, the invention relates to methods and systems for processing media files.


BACKGROUND OF THE INVENTION

Users generate and access a large number of articles, such as emails, web pages, word processing documents, media files, spreadsheet documents, instant messenger messages, and presentation documents, using a client device, such as a personal computer, personal digital assistant, or mobile phone. Some articles are stored on one or more storage devices coupled to, accessible by, or otherwise associated with the client device(s). Users sometimes wish to search the storage device(s) for articles.


Conventional client-device search applications may significantly degrade the performance of the client device. For example, certain conventional client-device search applications typically use batch processing to index all articles, which can result in noticeably slower performance of the client device during the batch processing. Additionally, batch processing occurs only periodically. Therefore, when a user performs a search, the most recent articles are sometimes not included in the results. Moreover, if the batch processing is scheduled for a time when the client device is not operational and is thus not performed for an extended period of time, the index of articles associated with the client device can become outdated. Conventional client-device search applications can also need to rebuild the index at each batch processing or build new partial indexes and perform a merge operation that can use a lot of client-device resources. Conventional client-device search applications also sometimes use a great deal of system resources when operational, resulting in slower performance of the client device.


Additionally, conventional client-device search applications can require an explicit search query from a user to generate results, and may be limited to examining file names or the contents of a particular application's files.


SUMMARY

Embodiments of the present invention comprise methods and systems for processing media files. In one embodiment, one or more events are captured having associated event data and associated with a client device, wherein each event is associated with an article and at least one of the articles is a media file, wherein at least one of the events is captured in real time upon the occurrence of the event, at least some of the event data and articles associated with the events are indexed and stored, a search query is received, and the at least one media file is determined as relevant to the search query. The media file can be one or more of an audio file, a video file, an image file, some combination, or a scripted timeline presentation of different media files.


This exemplary embodiment is mentioned not to limit or define the invention, but to provide an example of an embodiment of the invention to aid understanding thereof. Exemplary embodiments are discussed in the Detailed Description, and further description of the invention is provided there. Advantages offered by the various embodiments of the present invention may be further understood by examining this specification.





BRIEF DESCRIPTION OF THE DRAWINGS

These and other features, aspects, and advantages of the present invention are better understood when the following Detailed Description is read with reference to the accompanying drawings, wherein:



FIG. 1 is a diagram illustrating an exemplary environment in which one embodiment of the present invention may operate;



FIG. 2 is a flow diagram illustrating an exemplary method of capturing, indexing, and storing an event associated with a client device in one embodiment of the present invention; and



FIG. 3 is a flow diagram illustrating an exemplary method of processing a search query according to one embodiment of the present invention.





DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS

Embodiments of the present invention comprise methods and systems for processing media files.


System Architecture

Referring now to the drawings in which like numerals indicate like elements throughout the several figures, FIG. 1 is a block diagram illustrating an exemplary environment for implementation of an embodiment of the present invention. While the environment shown in FIG. 1 reflects a client-side search engine architecture embodiment, other embodiments are possible. The system 100 shown in FIG. 1 includes multiple client devices 102a-n that can communicate with a server device 150 over a network 106. The network 106 shown in FIG. 1 comprises the Internet. In other embodiments, other networks, such as an intranet, may be used instead. Moreover, methods according to the present invention may operate within a single client device that does not communicate with a server device or a network.


The client devices 102a-n shown in FIG. 1 each include a computer-readable medium 108. The embodiment shown in FIG. 1 includes a random access memory (RAM) 108 coupled to a processor 110. The processor 110 executes computer-executable program instructions stored in memory 108. Such processors may include a microprocessor, an ASIC, state machines, or other processor, and can be any of a number of suitable computer processors, such as processors from Intel Corporation of Santa Clara, Calif. and Motorola Corporation of Schaumburg, Ill. Such processors include, or may be in communication with, media, for example computer-readable media, which stores instructions that, when executed by the processor, cause the processor to perform the steps described herein. Embodiments of computer-readable media include, but are not limited to, an electronic, optical, magnetic, or other storage or transmission device capable of providing a processor, such as the processor 110 of client 102a, with computer-readable instructions. Other examples of suitable media include, but are not limited to, a floppy disk, CD-ROM, DVD, magnetic disk, memory chip, ROM, RAM, an ASIC, a configured processor, all optical media, all magnetic tape or other magnetic media, or any other medium from which a computer processor can read instructions. Also, various other forms of computer-readable media may transmit or carry instructions to a computer, including a router, private or public network, or other transmission device or channel, both wired and wireless. The instructions may comprise code from any suitable computer-programming language, including, for example, C, C++, C#, Visual Basic, Java, Python, Perl, and JavaScript.


Client devices 102a-n can be coupled to a network 106, or alternatively, can be stand alone machines. Client devices 102a-n may also include a number of external or internal devices such as a mouse, a CD-ROM, DVD, a keyboard, a display device, or other input or output devices. Examples of client devices 102a-n are personal computers, digital assistants, personal digital assistants, cellular phones, mobile phones, smart phones, pagers, digital tablets, laptop computers, Internet appliances, and other processor-based devices. In general, the client devices 102a-n may be any type of processor-based platform that operates on any suitable operating system, such as Microsoft® Windows® or Linux, capable of supporting one or more client application programs. For example, the client device 102a can comprise a personal computer executing client application programs, also known as client applications 120. The client applications 120 can be contained in memory 108 and can include, for example, a word processing application, a spreadsheet application, an email application, an instant messenger application, a presentation application, an Internet browser application, a calendar/organizer application, a video playing application, an audio playing application, an image display application, a file management program, an operating system shell, and other applications capable of being executed by a client device. Client applications may also include client-side applications that interact with or accesses other applications (such as, for example, a web-browser executing on the client device 102a that interacts with a remote e-mail server to access e-mail).


The user 112a can interact with the various client applications 120 and articles associated with the client applications 120 via various input and output devices of the client device 102a. Articles include, for example, word processor documents, spreadsheet documents, presentation documents, emails, instant messenger messages, database entries, calendar entries, appointment entries, task manager entries, source code files, and other client application program content, files, messages, items, web pages of various formats, such as HTML, XML, XHTML, Portable Document Format (PDF) files, and media files, such as image files, audio files, and video files, or any other documents or items or groups of documents or items or information of any suitable type whatsoever.


The user's 112a interaction with articles, the client applications 120, and the client device 102a creates event data that may be observed, recorded, analyzed or otherwise used. An event can be any occurrence possible associated with an article, client application 120, or client device 102a, such as playing an audio file, editing a video file, uploading an image file, inputting text in an article, displaying an article on a display device, sending an article, receiving an article, manipulating an input device, opening an article, saving an article, printing an article, closing an article, opening a client application program, closing a client application program, idle time, processor load, disk access, memory usage, bringing a client application program to the foreground, changing visual display details of the application (such as resizing or minimizing) and any other suitable occurrence associated with an article, a client application program, or the client device whatsoever. Additionally, event data can be generated when the client device 102a interacts with an article independent of the user 112a, such as when receiving an email or performing a scheduled task.


The memory 108 of the client device 102a can also contains a capture processor 124, a queue 126, and a search engine 122. The client device 102a can also contain or is in communication with a data store 140. The capture processor 124 can capture events and pass them to the queue 126. The queue 126 can pass the captured events to the search engine 122 or the search engine 122 can retrieve new events from the queue 126. In one embodiment, the queue 126 notifies the search engine 122 when a new event arrives in the queue 126 and the search engine 122 retrieves the event (or events) from the queue 126 when the search engine 122 is ready to process the event (or events). When the search engine receives an event it can be processed and can be stored in the data store 140. The search engine 122 can receive an explicit query from the user 112a or generate an implicit query and it can retrieve information from the data store 140 in response to the query. In another embodiment, the queue is located in the search engine 122. In still another embodiment, the client device 102a does not have a queue and the events are passed from the capture processor 124 directly to the search engine 122. According to other embodiments, the event data is transferred using an information exchange protocol. The information exchange protocol can comprise, for example, any suitable rule or convention facilitating data exchange, and can include, for example, any one of the following communication mechanisms: Extensible Markup Language-Remote Procedure Calling protocol (XML/RPC), Hypertext Transfer Protocol (HTTP), Simple Object Access Protocol (SOAP), shared memory, sockets, local or remote procedure calling, or any other suitable information exchange mechanism.


The capture processor 124 can capture an event by identifying and compiling event data associated with an event. Examples of events include playing an audio file, editing a video file, uploading an image file, sending or receiving an email message, a user viewing a web page, saving a word processing document, printing a spreadsheet document, inputting text to compose or edit an email, opening a presentation application, closing an instant messenger application, entering a keystroke, moving the mouse, and hovering the mouse over a hyperlink. An example of event data captured by the capture processor 124 for an event involving the playing of an audio file by the user 112a can include the title of the file, the location of the file, the date the file was saved to the client device, the data contained in the file, the quality of the file, the format of the file, and a pointer to the location of the file.


In the embodiment shown in FIG. 1, the capture processor 124 comprises multiple capture components. For example, the capture processor 124 shown in FIG. 1 comprises a separate capture component for each client application in order to capture events associated with each application. The capture processor 124 can also comprises a separate capture component that monitors overall network activity in order to capture event data associated with network activity, such as the receipt or sending of an audio or video stream, such as Unicast, Multicast or broadcast. The capture processor 124 shown in FIG. 1 also can comprise a separate client device capture component that monitors overall client device performance data, such as processor load, idle time, disk access, the client applications in use, and the amount of memory available. The capture processor 124 shown in FIG. 1 also comprises a separate capture component to monitor and capture keystrokes input by the user and a separate capture component to monitor and capture items, such as text, displayed on a display device associated with the client device 102a. An individual capture component can monitor multiple client applications and multiple capture components can monitor different aspects of a single client application.


In one embodiment, the capture processor 124, through the individual capture components, can monitor activity on the client device and can capture events by a generalized event definition and registration mechanism, such as an event schema. Each capture component can define its own event schema or can use a predefined one. Event schemas can differ depending on the client application or activity the capture component is monitoring. Generally, the event schema can describe the format for an event, for example, by providing fields for event data associated with the event (such as the time of the event) and fields related to any associated article (such as the title) as well as the content of any associated article (such as the document body). An event schema can describe the format for any suitable event data that relates to an event. For example, an event schema for an audio file event, such as a song in mp3 format played by the user 112a, can include the title of the song, the artist of the song, the album title, the genre of the song, the location of the file, the data in the file that was saved to the client device, the source where the file was acquired from, the quality of the file, the format of the file, the ownership information of the file, the Digital Rights Management (DRM) information, and other suitable information. An event schema for a video, such as a home movie being viewed by the user 112a can include the title of the file, the date the file was created, a date the file was edited (if any), the date the file was saved to the client device, the format of the file, the location of the file, the individuals who appear in the file, annotated information on the file, and links to similar files. Links to similar files can be based on time, source, themes or genres, individuals appearing in the file, and other suitable linking information. An event schema for an image file being saved by a user can include the title of the image file, the time saved, the location of the image file, the format of the image file, a license associated with the file, the location where the image was taken, the quality of the image, the camera aspects of the image, such as lens, focus, lighting and flash. More generally, an event schema can describe the state of the system around the time of the event. For example, an event schema can contain a URL for a web page event associated with a previous web page that the user navigated from. In addition, event schema can describe fields with more complicated structure like lists. For example, an event schema can contain fields that list multiple recipients. An event schema can also contain optional fields so that an application can include additional event data if desired.


The capture processor 124 can capture events occurring presently (or “real-time events”) and can capture events that have occurred in the past (or “historical events”). Real-time events can be “indexable” or “non-indexable”. In one embodiment, the search engine 122 indexes indexable real-time events, but does not index non-indexable real-time events. The search engine 122 may determine whether to index an event based on the importance of the event. Indexable real-time events can be more important events associated with an article, such as viewing a web page, loading or saving a file, and receiving or sending an instant message or email. Non-indexable events can be deemed not important enough by the search engine 122 to index and store the event, such as moving the mouse or selecting a portion of text in an article. Non-indexable events can be used by the search engine 122 to update the current user state. While all real-time events can relate to what the user is currently doing (or the current user state), indexable real-time events can be indexed and stored in the data store 140. Alternatively, the search engine 122 can index all real-time events. Real-time events can include, for example, sending or receiving an article, such as email, examining a portion of an article, such as selecting a portion of text or moving a mouse over a portion of a web page, changing an article, such as editing a video file, closing an article, such as closing a media player application or changing an audio file being listened to, loading, saving, opening, or viewing an article, such as an image file, listening to or saving an mp3 file or other audio/video file, or updating the metadata of an article, such as book marking a web page, printing a presentation document, deleting a word processing document, or moving a spreadsheet document.


Historical events are similar to indexable real-time events except that the event occurred before the installation of the search engine 122 or was otherwise not captured, because, for example, the search engine 122 was not operational for a period of time while the client device 102a was operational or because no capture component existed for a specific type of historical event at the time the event took place. Examples of historical events include the user's saved word processing documents, media files, presentation documents, calendar entries, and spreadsheet documents, the emails in a user's inbox, and the web pages book marked by the user. The capture processor 124 can capture historical events by periodically crawling the memory 108 and any associated data storage device for events not previously captured by the capture processor 124. The capture processor 124 can also capture historical events by requesting certain client applications, such as a web browser or an email application, to retrieve articles and other associated information. For example, the capture processor 124 can request that the web browser application obtain all viewed web pages by the user or request that the email application obtain all email messages associated with the user. These articles may not currently exist in memory 108 or on a storage device of the client device 102a. For example, the email application may have to retrieve emails from a server device. In one embodiment, the search engine 122 indexes historical events.


In the embodiment shown in FIG. 1, events captured by the capture processor 124 are sent to the queue 126 in the format described by an event schema. The capture processor 124 can also send performance data to the queue 126. Examples of performance data include current processor load, average processor load over a predetermined period of time, idle time, disk access, the client applications in use, and the amount of memory available. Performance data can also be provided by specific performance monitoring components, some of which may be part of the search engine 122, for example. The performance data in the queue 126 can be retrieved by the search engine 122 and the capture components of the capture processor 124. For example, capture components can retrieve the performance data to alter how many events are sent to the queue 126 or how detailed the events are that are sent (fewer or smaller events when the system is busy) or how frequently event are sent (events are sent less often when the system is busy or there are too many events waiting to be processed). The search engine 122 can use performance data to determine when it indexes various events and when and how often it issues implicit queries.


In one embodiment, the queue 126 holds events until the search engine 122 is ready to process an event or events. Alternatively, the queue 126 uses the performance data to help determine how quickly to provide the events to the search engine 122. The queue 126 can comprise one or more separate queues including a user state queue and an index queue. The index queue can queue indexable events, for example. Alternatively, the queue 126 can have additional queues or comprise a single queue. The queue 126 can be implemented as a circular priority queue using memory mapped files. The queue can be a multiple-priority queue where higher priority events are served before lower priority events, and other components may be able to specify the type of events they are interested in. Generally, real-time events can be given higher priority than historical events, and indexable events can be given higher priority than non-indexable real-time events. Other implementations of the queue 126 are possible. In another embodiment, the client device 102a does not have a queue 126. In this embodiment, events are passed directly from the capture processor 124 to the search engine 122. In other embodiments, events can be transferred between the capture components and the search engine using suitable information exchange mechanisms such as: Extensible Markup Language-Remote Procedure Calling protocol (XML/RPC), Hypertext Transfer Protocol (HTTP), Simple Object Access Protocol (SOAP), shared memory, sockets, local or remote procedure calling, or any other suitable information exchange mechanism.


The search engine 122 can contain an indexer 130, a query system 132, and a formatter 134. The query system 132 can retrieve real-time events and performance data from the queue 126. The query system 132 can use performance data and real-time events to update the current user state and generate an implicit query. An implicit query can be an automatically generated query based on the current user state. The query system 132 can also receive and process explicit queries from the user 112a. Performance data can also be retrieved by the search engine 122 from the queue 126 for use in determining the amount of activity possible by the search engine 122.


In the embodiment shown in FIG. 1, indexable real-time events and historical events (indexable events) are retrieved from the queue 126 by the indexer 130. Alternatively, the queue 126 may send the indexable events to the indexer 130. The indexer 130 can index the indexable events and can send them to the data store 140 where they are stored. The data store 140 can be any type of computer-readable media and can be integrated with the client device 102a, such as a hard drive, or external to the client device 102a, such as an external hard drive or on another data storage device accessed through the network 106. The data store can be one or more logical or physical storage areas. In one embodiment, the data store 140 can be in memory 108. The data store 140 may facilitate one or a combination of methods for storing data, including without limitation, arrays, hash tables, lists, and pairs, and may include compression and encryption. In the embodiment shown in FIG. 1, the data store comprises an index 142, a database 144 and a repository 146.


In the embodiment shown in FIG. 1, when the indexer 130 receives an event, the indexer 130 can determine, from the event, terms (if any) associated with the event, the time of the event (if available), images (if any) associated with the event, and/or other information defining the event. The indexer 130 can also determine if the event relates to other events and associate the event with related events. For example, for a media file event, the indexer 130 can associate the media file event with other versions (if any) associated with the media file event. The media file events can be associated with each other in an associated events object, which can be stored in the data store 140. The indexer 130 may further identify and compile event data from external sources, such as local and global databases, websites, and a network search engine, allowing the indexer 130 to augment the available information or event data associated with the event. For example, if a user plays a song and the media file containing the song only has title information associated with it, the indexer 130 can determine the lyrics, artist, year, genre, album, and album image for external sources and associate this data with the event.


The indexer 130 can send and incorporate the terms and times, associated with the event in the index 142 of the data store 140. The event can be sent to the database 144 for storage and the content of the associated article and any associated images can be stored in the repository 146. The associated events object can be stored in the database 144.


In the embodiment shown in FIG. 1, a user 112a can input an explicit query into a search engine interface displayed on the client device 102a, which is received by the search engine 122. The search engine 122 can also generate an implicit query based on a current user state, which can be determined by the query system 132 from real-time events. Based on the query, the query system 132 can locate relevant information in the data store 140 and provide a result set. In one embodiment, the result set comprises article identifiers for articles associated with the client applications 120 or client articles. Client articles include articles associated with the user 112a or client device 102a, such as the user's emails, word processing documents, instant messenger messages, previously viewed web pages and any other article or portion of an article associated with the client device 102a or user 112a. An article identifier may be, for example, a Uniform Resource Locator (URL), a file name, a link, an icon, a path for a local file, or other suitable information that may identify an article. In another embodiment, the result set also comprises article identifiers for articles located on the network 106 or network articles located by a search engine on a server device. Network articles include articles located on the network 106 not previously viewed or otherwise referenced by the user 112a, such as web pages not previously viewed by the user 112a.


The formatter 134 can receive the search result set from the query system 132 of the search engine 122 and can format the results for output to a display processor 128. In one embodiment, the formatter 134 can format the results in XML, HTML, or tab delineated text. The display processor 128 can be contained in memory 108 and can control the display of the result set on a display device associated with the client device 102a. The display processor 128 may comprise various components. For example, in one embodiment, the display processor 128 comprises a Hypertext Transfer Protocol (HTTP) server that receives requests for information and responds by constructing and transmitting Hypertext Markup Language (HTML) pages. In one such embodiment, the HTTP server comprises a scaled-down version of the Apache Web server. The display processor 128 can be associated with a set of APIs to allow various applications to receive the results and display them in various formats. The display APIs can be implemented in various ways, including as, for example, DLL exports, COM interface, VB, JAVA, or .NET libraries, or a web service.


Through the client devices 102a-n, users 112a-n can communicate over the network 106, with each other and with other systems and devices coupled to the network 106. As shown in FIG. 1, a server device 150 can be coupled to the network 106. In the embodiment shown in FIG. 1, the search engine 122 can transmit a search query comprised of an explicit or implicit query or both to the server device 150. The user 112a can also enter a search query in a search engine interface, which can be transmitted to the server device 150 by the client device 102a via the network 106. In another embodiment, the query signal may instead be sent to a proxy server (not shown), which then transmits the query signal to server device 150. Other configurations are also possible.


The server device 150 can include a server executing a search engine application program, such as the Google™ search engine. In other embodiments, the server device 150 can comprise a related information server or an advertising server. Similar to the client devices 102a-n, the server device 150 can include a processor 160 coupled to a computer-readable memory 162. Server device 150, depicted as a single computer system, may be implemented as a network of computer processors. Examples of a server device 150 are servers, mainframe computers, networked computers, a processor-based device, and similar types of systems and devices. The server processor 160 can be any of a number of computer processors, such as processors from Intel Corporation of Santa Clara, Calif. and Motorola Corporation of Schaumburg, Ill. In another embodiment, the server device 150 may exist on a client-device. In still another embodiment, there can be multiple server devices 150.


Memory 162 contains the search engine application program, also known as a network search engine 170. The search engine 170 can locate relevant information from the network 106 in response to a search query from a client device 102a. The search engine 170 then can provide a result set to the client device 102a via the network 106. The result set can comprise one or more article identifiers. An article identifier may be, for example, a Uniform Resource Locator (URL), a file name, a link, an icon, a path for a local file, or anything else that identifies an article. In one embodiment, an article identifier can comprise a URL associated with an article.


In one embodiment, the server device 150, or related device, has previously performed a crawl of the network 106 to locate articles, such as web pages, stored at other devices or systems coupled to the network 106, and indexed the articles in memory 162 or on another data storage device. It should be appreciated that other methods for indexing articles in lieu of or in combination with crawling may be used, such as manual submission.


It should be noted that other embodiments of the present invention may comprise systems having different architecture than that which is shown in FIG. 1. For example, in some other embodiments of the present invention, the client device 102a is a stand-alone device and is not connected to a network. The system 100 shown in FIG. 1 is merely exemplary, and is used to explain the exemplary methods shown in FIGS. 2 through 3.


Process

Various methods in accordance with embodiments of the present invention may be carried out. For example, in one embodiment, one or more events are captured having associated event data and associated with a client device, wherein each event is associated with an article and at least one of the articles is a media file, wherein at least one of the events is captured in real time upon the occurrence of the event, at least some of the event data and articles associated with the events are indexed and stored, a search query is received, and the at least one media file is determined as relevant to the search query. An event with an associated media file article may be referred to as a media file event. The media files can be audio files, a video files, image files, some combination, or a scripted timeline presentation of different media files.


The search query can be an explicit query or an implicit query. In one embodiment, capturing the event associated with the media file can comprise monitoring a media application to determine event data associated with the event and compiling the event from at least some of the event data. Capturing the event associated with the media file can comprise determining event data external to the media file. The event data external to the media file can be determined based at least in part on one or more of a local database, a global database, a web page, and a network search engine. Capturing the event associated with the media file can also comprise determining text that identifies the media file and including the text as event data associated with the event. In one embodiment, indexing the event associated with the media file can comprise associating the media file event with associated events. The associated event can comprise a different version of the event.


According to one embodiment, capturing the event associated with the media file can comprise identifying the event based at least in part on one or more of network activity, system activity, and media application activity. Capturing the event associated with the media file can comprise identifying the event based at least in part on a display area associated with a media application and identifying at least some of the event data by analyzing the display area. Capturing the event associated with the media file can comprise identifying the event based at least in part on calls to input or output devices and identifying at least some of the event data by analyzing the calls.



FIG. 2 illustrates an exemplary method 200 that provides a method for capturing, indexing, and storing an event. This exemplary method is provided by way of example, as it will be appreciated from the foregoing description of exemplary embodiments that there are a variety of ways to carry out methods according to the present invention. The method 200 shown in FIG. 2 can be executed or otherwise performed by any of various systems. The method 200 is described below as carried out by the system 100 shown in FIG. 1 by way of example, and various elements of the system 100 are referenced in explaining the example method of FIG. 2. However, it will be appreciated that the invention is not limited to a particular system, such as that described with reference to FIG. 1.


In 202, the capture processor 124 captures an event. The event can be a media file event, such as an audio, video, or image file event, a combination media file event, or a scripted timeline presentation of different media files event that may have auxiliary associated content, such as subtitles, optional audio tracks and director commentary, or can be a non-media file event, such as an email, instant messenger, web page or presentation event. The event can be a real-time event or can be a historical event. The capture processor 124 can capture a real-time event by identifying and compiling event data associated with the event upon the occurrence of the event. The capture processor 124 can capture a historical event, for example, by crawling the memory 108 or associated data storage device of the client device 112a for previously uncaptured articles or receiving articles or data from client applications and identifying and compiling event data associated with the event. Such a crawl may be requested by the user, may be performed at certain intervals, or may occur upon some other suitable condition. The capture processor 124 may have separate capture components for each client application, network monitoring, performance data capture, keystroke capture, and display capture. For example, the capture processor 124 may have a different capture component associated with each media application or each type of media application. Alternatively, a single capture component may be used to capture media file events.


In one embodiment, the capture component can use a generalized event definition mechanism, such as an event schema that it has previously defined and registered with the client device 102a, to capture or express the event. For example, an event schema for an audio file event, such as a song in mp3 format played by the user 112a, can include the title of the song, the artist of the song, the album title, the genre of the song, the location of the file, the data the file was saved to the client device, the quality of the file, the format of the file, and a pointer to the location of the file. An event schema for a video, such as a home movie being viewed by the user 112a can include the title of the file, the date the file was created, a date the file was edited (if any), the date the file was saved to the client device, the format of the file, the location of the file, and a pointer to the location of the file. An event schema for an image file being saved by a user can include the title of the image file, the time saved, the location of the image file, the format of the image file, and a pointer to the location of the image file.


The capture processor 124 can identify and compile event data according to the format described by the relevant event schema in order to capture the event. Event data for a media file event can be included in associated metadata from the file, such as ID3 tags in a music file. The event data for a media file event can also be determined from sources external to the media file, such as a local or global database or a network search engine. For example, event data for an audio media file event, such as a song, can be determined by looking up information about the song, such as, for example, artist, title, genre, album cover art, and lyrics, based on some identifier. This lookup may be done using the network search engine 170. Alternatively, the lookup may be done using a database associated with the client-device 102a. The identifier can be, for example, a unique value based on the wavelength, length or other information associated with the audio media file, the name of the file, metadata within the file, or a fingerprint that has been added to the file. This identification and compilation of event data can occur in real time as the events are occurring or can occur during a crawl of the user's files. In one embodiment, the capture processor 124 can determine or generate text that can identify the audio portion of a media file and include this text as event data in the event. This text can be used in indexing the event. For an audio media file event, such as a song, for example, in one embodiment, the capture processor 124 can determine from an external source, such as a web site, the lyrics associated with the song in a text format and compile this text as event data associated with the media file event.


In one embodiment, the capture processor 124 can identify a media file event by network activity, such as detection of the downloading of an audio file from an associated network by monitoring network traffic or with a browser plug-in. The capture processor 124 can identify a media file event by system activity. For example, the capture processor 124 can determine that a media application is in use, such as through use of an Application Programming Interface (API) with the media application, monitoring calls to an audio or video driver, or monitoring display calls to a display area, such as a window, associated with the media application. The capture processor 124 can capture event data by monitoring calls to an input or output device or driver, such as a microphone or speaker. Additionally, the capture processor 124 can extract event data associated with the media file from a display area associated with the media application. For example, the display area may contain metadata about an audio file being played, such as the title, artist, and other information. As another example, the display area can be analyzed to identify images that are likely to be photographs based on the distribution and variation in pixel intensity across sections of the screen. Whereas typical items on a display device, such as text and borders, contain sharp edges, photographs may contain smooth variations in pixel values, for example. The amount of compression possible on a segment of the screen may also help identify a photograph, because photographs may be less compressible. These features combined with the typical size of photographs on the display device, can allow the identification and extraction of photos. Analyzing the display area associated with a display device may be advantageous because identifying the media file alone may not allow identification of all desired event data, and analysis of the media application alone may not allow access to the event data for the media file.


In 204, the capture processor 124 determines whether the event captured is an indexable event. As explained above, some real-time events may not be indexed (non-indexable real-time events). In one embodiment, non-indexable real-time events are used to update the current user state and are, for example, examining a portion of an article, changing an article, and closing an article. In this embodiment, non-indexable events are not indexed or sent for storage by the indexer 130. Indexable events can be indexable real-time events or historical events. For example, in one embodiment, the playing, viewing or editing of a media file can be considered an indexable event. Opening a media application may be considered a non-indexable event.


If an indexable event is determined, then, in 206, the event can be sent by the capture processor 124 to the queue 126 with an indication that it is an indexable event. In the embodiment shown, indexable real-time events are sent to both a user state queue and an index queue within queue 126 and historical events are sent to the index queue within the queue 126. Alternatively, indexable real-time events may not be sent to the user state queue to save computational time. The capture processor 124 can send the event in a form described by an event schema to the queue 126. If the event is determined to be a non-indexable event, then, in 206, the non-indexable event can be sent by the capture processor 124 to the user state queue of the queue 126 with an indication that it is not to be indexed.


In one embodiment, the queue 126 holds the event until the search engine is ready to receive it. Based on the event data, the event can be prioritized on the queue 126 for handling. For example, in one embodiment, historical events are given a lower priority for processing by the queue 126 than real-time events. In one embodiment, when the indexer 130 is ready to process another event, it can retrieve an event or events from the index queue in the queue 126. The query system 132 can retrieve an event or events from the user state queue of the queue 126, when it is ready to update the user state. In another embodiment, a queue is not used and events are sent directly to the search engine 122 from the capture processor 124.


In 208, the event is indexed. In one embodiment, the indexer 130 indexes the event and can retrieve an event from the queue 126 when it is ready to process the event. In one embodiment, the indexer 130 determines if the event is a duplicate event and if not assigns an Event ID to the event. The indexer 130 can also associate the event with related events. For example, if the user 112a edits an image file and saves it with the same filename, thus overwriting the original file, the revised image file can be associated to the original image file by the indexer 130 through an associated events object. In the embodiment shown in FIG. 2, the indexer determines indexable terms associated with the event, dates and times associated with the event, and other data associated with the event from the event schema.


In 210, the event can be stored in the database 144 and the content of the event can be stored in the repository 146. The event, such as a media file event can be stored in the data store 140. In the embodiment shown in FIG. 2, the associated media file can be stored in the repository 146. The event and associated events object can be stored in the database 144. In one embodiment, the Event ID from the event is associated with terms in the index 142 that equate to the indexable terms of the event. For example, for an audio file event given an event ID “17” (for example) associated with an audio file of a David Bowie song entitled “Let's Dance”, the event ID, 17, can be associated with the terms “David”, “Bowie”, and “Dance” in the index 142.



FIG. 3 illustrates an exemplary method 300 that provides a method for processing a search query, in accordance with one embodiment. This exemplary method is provided by way of example, as it will be appreciated from the foregoing description of exemplary embodiments that there are a variety of ways to carry out methods according to the present invention. The method 300 shown in FIG. 3 can be executed or otherwise performed by any of various systems. The method 300 is described below as carried out by the system 100 shown in FIG. 1 by way of example, various elements of the system 100 are referenced in the example method of FIG. 3.


In 302, the query system 132 receives a search query. The query can be an explicit query or an implicit query. An explicit query can be generated by a user inputting query terms into a search engine interface displayed on the client device 102a. An implicit query can be generated by the query system 132 based on a current user state. For example, the user 112a can enter the terms “David Bowie” into a search engine interface and the query system 132 can generate a search query based on the input terms. Alternatively, the user 112a can input the terms “David Bowie” in an email the user 112a is drafting. The capture processor 124 can capture this contextual event and it can be received by the query system 132. The query system 132 can generate a search query based on the terms captured in this contextual event.


In 304, the query system 132 locates articles relevant to the search query. The query system 132 can locate relevant articles by matching the terms of the search query with terms located in the index 142. For example, the query system 132 can match the terms of the query with terms in the index 142. From the matched terms, the query system 132 can determine events, stored in the database 144, associated with the terms through event IDs associated with the matched terms. From these events, the query system 132 can determine articles associated with the events. The articles can be stored in the repository 146. For the search query “David Bowie,” for example, the query system 132 can locate various articles from various client applications that contain the query terms, such as, audio files, video files, image files, emails, instant messenger messages, previously viewed web pages, and other articles matched to the terms of the query. The query can also designate a time and the query system 132 can locate articles that are relevant to the query time. The query system 132 can also retrieve network articles, such as web pages, from a search engine 170 that are relevant to the query.


In 306, the query system 132 generates a search result set based on the located articles. In one embodiment, the query system 132 can sort and rank the located articles based on a variety of signals indicating the user's 112a preference for the articles. The search result set can contain a ranked list of article identifiers for articles associated with a variety of different client applications 120 and article identifiers for network articles. Each link can also contain a summary of the article as well as an image associated with the article. The result set can contain media files, such as audio, video, and image files and other articles (non-media files), such as emails, instant messenger messages, and web pages. For example, for the query “David Bowie”, the result set may contain audio files of songs by David Bowie, video files of music videos from David Bowie, image files of David Bowie, emails and instant messenger messages discussing David Bowie, and web sites relating to David Bowie.


In 308, the search result set is formatted by the formatter 134. In one embodiment, the formatter 134 formats the result set in XML or HTML. In 310, the search result set is output, such as displayed on the client device 102a, by the display processor 128. For example, the search result set can be displayed on the display device associated with the client device 102a. If the search result set was generated in response to an implicit query the display processor 128 can determine an appropriate time to display the implicit search result set. The user 112a can then select an article identifier for an article and cause the output of the associated article on the display device.


The environment shown reflects a client-side search engine architecture embodiment. Other embodiments are possible, such as a stand-alone client device or a network search engine.


While the above description contains many specifics, these specifics should not be construed as limitations on the scope of the invention, but merely as exemplifications of the disclosed embodiments. Those skilled in the art will envision many other possible variations that are within the scope of the invention.

Claims
  • 1. A system for processing media files comprising: a processor for executing computer program code; anda non-transitory computer-readable storage medium storing executable computer program code for: monitoring at least one application for occurrences of events wherein at least one event is associated with a media file;capturing the at least one event upon the occurrence of the event by queuing event data associated with the at least one event at a position in the queue; andindexing and storing at least some of the event data and the media file associated with the at least one event at a time after the occurrence of the at least one event, wherein the time is based on performance data indicating a readiness to process the at least one event and the position in the queue.
  • 2. The system of claim 1, wherein capturing the at least one event associated with the media file comprises monitoring a media application to determine event data associated with the at least one event and compiling the at least one event from at least some of the event data.
  • 3. The system of claim 1, wherein capturing the at least one event associated with the media file comprises determining event data external to the media file.
  • 4. The system of claim 1, wherein capturing the at least one event associated with the media file comprises determining text that identifies the media file and including the text as event data associated with the at least one event.
  • 5. The system of claim 1, wherein indexing at least some of the event data associated with the media file comprises associating the at least one event with a different version of the at least one event.
  • 6. The system of claim 1, wherein capturing the at least one event associated with the media file comprises identifying the at least one event based at least in part on one or more of network activity, system activity, and media application activity.
  • 7. The system of claim 1, wherein capturing the at least one event associated with the media file comprises identifying the at least one event based at least in part on a display area associated with a media application and identifying at least some of the event data by analyzing the display area.
  • 8. A computer-implemented method for processing media files, the method comprising: monitoring, at one or more processors, at least one application for occurrences of events wherein at least one event is associated with a media file;capturing the at least one event upon the occurrence of the event by queuing event data associated with the at least one event at a position in the queue; andindexing and storing at least some of the event data and the media file associated with the at least one event at a time after the occurrence of the at least one event, wherein the time is based on performance data indicating a readiness to process the at least one event and the position in the queue.
  • 9. The method of claim 8, wherein capturing the at least one event associated with the media file comprises monitoring a media application to determine event data associated with the at least one event and compiling the at least one event from at least some of the event data.
  • 10. The method of claim 8, wherein capturing the at least one event associated with the media file comprises determining event data external to the media file.
  • 11. The method of claim 8, wherein capturing the at least one event associated with the media file comprises determining text that identifies the media file and including the text as event data associated with the at least one event.
  • 12. The method of claim 8, wherein indexing at least some of the event data associated with the media file comprises associating the at least one event with a different version of the at least one event.
  • 13. The method of claim 8, wherein capturing the at least one event associated with the media file comprises identifying the at least one event based at least in part on one or more of network activity, system activity, and media application activity.
  • 14. The method of claim 8, wherein capturing the at least one event associated with the media file comprises identifying the at least one event based at least in part on a display area associated with a media application and identifying at least some of the event data by analyzing the display area.
  • 15. A computer readable medium configured to store instructions, the instructions when executed by a processor cause the processor to: monitor at least one application for occurrences of events wherein at least one event is associated with a media file;capture the at least one event upon the occurrence of the event by queuing event data associated with the at least one event at a position in the queue; andindex and store at least some of the event data and the media file associated with the at least one event at a time after the occurrence of the at least one event, wherein the time is based on performance data indicating a readiness to process the at least one event and the position in the queue.
  • 16. The computer readable medium of claim 15 wherein capturing the at least one event associated with the media file comprises monitoring a media application to determine event data associated with the at least one event and compiling the at least one event from at least some of the event data.
  • 17. The computer readable medium of claim 15, wherein capturing the at least one event associated with the media file comprises determining event data external to the media file.
  • 18. The computer readable medium of claim 15, wherein capturing the at least one event associated with the media file comprises determining text that identifies the media file and including the text as event data associated with the at least one event.
  • 19. The computer readable medium of claim 15, wherein indexing at least some of the event data associated with the media file comprises associating the at least one event with a different version of the at least one event.
  • 20. The computer readable medium of claim 15 wherein capturing the at least one event associated with the media file comprises identifying the at least one event based at least in part on a display area associated with a media application and identifying at least some of the event data by analyzing the display area.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of allowed U.S. application Ser. No. 13/323,693, which is a continuation of U.S. Pat. No. 8,099,407, granted Jan. 17, 2012, which is herein incorporated by reference in its entirety.

US Referenced Citations (276)
Number Name Date Kind
4410957 Cason et al. Oct 1983 A
5280612 Lorie et al. Jan 1994 A
5305205 Weber Apr 1994 A
5321838 Hensley et al. Jun 1994 A
5539809 Mayer et al. Jul 1996 A
5555346 Gross et al. Sep 1996 A
5566336 Futatsugi et al. Oct 1996 A
5592378 Cameron et al. Jan 1997 A
5623652 Vora et al. Apr 1997 A
5701469 Brandli et al. Dec 1997 A
5742816 Barr et al. Apr 1998 A
5748954 Mauldin May 1998 A
5781192 Kodimer Jul 1998 A
5793948 Asahi et al. Aug 1998 A
5819273 Vora et al. Oct 1998 A
5845300 Comer et al. Dec 1998 A
5872976 Yee et al. Feb 1999 A
5881315 Cohen Mar 1999 A
5907836 Sumita et al. May 1999 A
5913208 Brown et al. Jun 1999 A
5940594 Ali et al. Aug 1999 A
5956722 Jacobson Sep 1999 A
5961610 Kelly et al. Oct 1999 A
5964839 Johnson et al. Oct 1999 A
6006222 Culliss Dec 1999 A
6014665 Culliss Jan 2000 A
6026388 Liddy et al. Feb 2000 A
6029195 Herz Feb 2000 A
6055579 Goyal et al. Apr 2000 A
6073130 Jacobson et al. Jun 2000 A
6078916 Culliss Jun 2000 A
6092101 Birrell et al. Jul 2000 A
6115802 Tack Sep 2000 A
6119147 Toomey et al. Sep 2000 A
6175830 Maynard Jan 2001 B1
6182065 Yeomans Jan 2001 B1
6182068 Culliss Jan 2001 B1
6184880 Okada Feb 2001 B1
6188277 Borodulin et al. Feb 2001 B1
6199067 Geller Mar 2001 B1
6202065 Wills Mar 2001 B1
6209000 Klein et al. Mar 2001 B1
6226630 Billmers May 2001 B1
6236768 Rhodes et al. May 2001 B1
6236978 Tuzhilin May 2001 B1
6240548 Holzle et al. May 2001 B1
6269369 Robertson Jul 2001 B1
6275820 Navin-Chandra et al. Aug 2001 B1
6275957 Novik et al. Aug 2001 B1
6282548 Burner et al. Aug 2001 B1
6321228 Crandall et al. Nov 2001 B1
6330572 Sitka Dec 2001 B1
6330589 Kennedy Dec 2001 B1
6341371 Tandri Jan 2002 B1
6346952 Shtivelman Feb 2002 B1
6347374 Drake et al. Feb 2002 B1
6349299 Spencer et al. Feb 2002 B1
6363373 Steinkraus Mar 2002 B1
6370563 Murakami et al. Apr 2002 B2
6380924 Yee et al. Apr 2002 B1
6393421 Paglin May 2002 B1
6393438 Kathrow et al. May 2002 B1
6401239 Miron Jun 2002 B1
6446076 Burkey et al. Sep 2002 B1
6477585 Cohen et al. Nov 2002 B1
6480837 Dutta Nov 2002 B1
6487555 Bharat Nov 2002 B1
6490577 Anwar Dec 2002 B1
6513036 Fruensgaard et al. Jan 2003 B2
6526405 Mannila et al. Feb 2003 B1
6532023 Schumacher et al. Mar 2003 B1
6560655 Grambihler et al. May 2003 B1
6564213 Ortega et al. May 2003 B1
6581056 Rao Jun 2003 B1
6592627 Agrawal et al. Jul 2003 B1
6604236 Draper et al. Aug 2003 B1
6631345 Schumacher et al. Oct 2003 B1
6658423 Pugh et al. Dec 2003 B1
6662226 Wang et al. Dec 2003 B1
6681247 Payton Jan 2004 B1
6684250 Anderson et al. Jan 2004 B2
6691175 Lodrige et al. Feb 2004 B1
6694353 Sommerer Feb 2004 B2
6697838 Jakobson Feb 2004 B1
6707471 Funaki Mar 2004 B2
6708293 Kaler et al. Mar 2004 B2
6728763 Chen Apr 2004 B1
6772143 Hung Aug 2004 B2
6779030 Dugan et al. Aug 2004 B1
6782381 Nelson et al. Aug 2004 B2
6820075 Shanahan et al. Nov 2004 B2
6826553 DaCosta et al. Nov 2004 B1
6850934 Bates et al. Feb 2005 B2
6853950 O-Reilly et al. Feb 2005 B1
6864901 Chang et al. Mar 2005 B2
6865715 Uchino et al. Mar 2005 B2
6873982 Bates et al. Mar 2005 B1
6877027 Spencer et al. Apr 2005 B1
6879691 Koretz Apr 2005 B1
6901378 Linker et al. May 2005 B1
6907577 Tervo Jun 2005 B2
6934740 Lawande et al. Aug 2005 B1
6957229 Dyor Oct 2005 B1
6963830 Nakao Nov 2005 B1
6968509 Chang et al. Nov 2005 B1
6981040 Konig et al. Dec 2005 B1
6983310 Rouse et al. Jan 2006 B2
6985913 Murata Jan 2006 B2
6999957 Zamir et al. Feb 2006 B1
7016919 Cotton et al. Mar 2006 B2
7080073 Jiang et al. Jul 2006 B1
7096255 Malik Aug 2006 B2
7099887 Hath et al. Aug 2006 B2
RE39326 Comer et al. Oct 2006 E
7162473 Dumais et al. Jan 2007 B2
7188316 Gusmorino et al. Mar 2007 B2
7200802 Kawatani Apr 2007 B2
7219184 Stojancic May 2007 B2
7233948 Shamoon et al. Jun 2007 B1
7240049 Kapur Jul 2007 B2
7245910 Osmo Jul 2007 B2
7249158 Naitou Jul 2007 B2
7257822 Sambhus et al. Aug 2007 B1
7265858 Park et al. Sep 2007 B2
7328242 McCarthy et al. Feb 2008 B1
7330536 Claudatos et al. Feb 2008 B2
7337448 Dalia et al. Feb 2008 B1
7343365 Farnharm Mar 2008 B2
7346613 Hurst-Hiller et al. Mar 2008 B2
7370035 Gross et al. May 2008 B2
7376640 Anderson et al. May 2008 B1
7383307 Kirkland et al. Jun 2008 B2
7412491 Gusler et al. Aug 2008 B2
7437444 Houri Oct 2008 B2
7441246 Auerbach et al. Oct 2008 B2
7457872 A ton et al. Nov 2008 B2
7467390 Gilgen et al. Dec 2008 B2
7475406 Banatwala et al. Jan 2009 B2
7499974 Karstens Mar 2009 B2
7500249 Kampe et al. Mar 2009 B2
7516118 Badros et al. Apr 2009 B1
7546602 Hejlsberg et al. Jun 2009 B2
7562367 Arad Jul 2009 B1
7577667 Hinshaw et al. Aug 2009 B2
7602382 Hinckley et al. Oct 2009 B2
7634546 Strickholm et al. Dec 2009 B1
7650403 Koetke et al. Jan 2010 B2
7676553 Laucius et al. Mar 2010 B1
7941439 Lawrence et al. May 2011 B1
8099407 Auerbach et al. Jan 2012 B2
8203952 Borkovsky et al. Jun 2012 B2
8386728 Ionescu et al. Feb 2013 B1
8626739 Auerbach et al. Jan 2014 B2
20010002469 Bates et al. May 2001 A1
20010016852 Peairs et al. Aug 2001 A1
20010049677 Talib et al. Dec 2001 A1
20020042789 Michalewicz et al. Apr 2002 A1
20020049608 Hartsell et al. Apr 2002 A1
20020055844 L'Esperance et al. May 2002 A1
20020056089 Houston May 2002 A1
20020059245 Zakharov et al. May 2002 A1
20020059425 Belfiore et al. May 2002 A1
20020065802 Uchiyama May 2002 A1
20020073076 Xu et al. Jun 2002 A1
20020078256 Gehman et al. Jun 2002 A1
20020087507 Hopewell et al. Jul 2002 A1
20020091568 Kraft et al. Jul 2002 A1
20020091972 Harris et al. Jul 2002 A1
20020103664 Olsson et al. Aug 2002 A1
20020116291 Grasso et al. Aug 2002 A1
20020138467 Jacobson et al. Sep 2002 A1
20020156760 Lawrence et al. Oct 2002 A1
20020165903 Zargham et al. Nov 2002 A1
20020174101 Fernley et al. Nov 2002 A1
20020178383 Hrabik et al. Nov 2002 A1
20020184224 Haff et al. Dec 2002 A1
20020184406 Aliffi Dec 2002 A1
20030001854 Jade et al. Jan 2003 A1
20030018521 Kraft et al. Jan 2003 A1
20030023586 Knorr Jan 2003 A1
20030028506 Yu Feb 2003 A1
20030028896 Swart et al. Feb 2003 A1
20030036848 Sheha et al. Feb 2003 A1
20030036914 Fitzpatrick Feb 2003 A1
20030041112 Tada et al. Feb 2003 A1
20030050909 Preda et al. Mar 2003 A1
20030050966 Dutta et al. Mar 2003 A1
20030055816 Paine et al. Mar 2003 A1
20030055828 Koch et al. Mar 2003 A1
20030083947 Hoffman et al. May 2003 A1
20030088433 Young et al. May 2003 A1
20030097361 Huang et al. May 2003 A1
20030123442 Drucker et al. Jul 2003 A1
20030123443 Anwar Jul 2003 A1
20030126136 Omoigui Jul 2003 A1
20030130984 Quinlan et al. Jul 2003 A1
20030131000 Bates et al. Jul 2003 A1
20030131061 Newton et al. Jul 2003 A1
20030149694 Ma et al. Aug 2003 A1
20030154071 Shreve Aug 2003 A1
20030154293 Zmolek Aug 2003 A1
20030167266 Saldanha et al. Sep 2003 A1
20030182480 Varma et al. Sep 2003 A1
20030185379 O'Connor et al. Oct 2003 A1
20030187837 Cull iss Oct 2003 A1
20030212654 Harper et al. Nov 2003 A1
20030233366 Kesselman Dec 2003 A1
20030233419 Beringer Dec 2003 A1
20040002959 Alpert et al. Jan 2004 A1
20040003038 Huang et al. Jan 2004 A1
20040015467 Fano Jan 2004 A1
20040031027 Hiltgen Feb 2004 A1
20040044962 Green et al. Mar 2004 A1
20040054737 Daniell Mar 2004 A1
20040064447 Simske et al. Apr 2004 A1
20040093317 Swan May 2004 A1
20040095852 Griner et al. May 2004 A1
20040098609 Bracewell et al. May 2004 A1
20040103409 Hayner et al. May 2004 A1
20040128285 Green et al. Jul 2004 A1
20040133560 Simske Jul 2004 A1
20040133561 Burke Jul 2004 A1
20040141594 Brunson et al. Jul 2004 A1
20040143569 Gross et al. Jul 2004 A1
20040155910 Chang et al. Aug 2004 A1
20040168150 Ziv Aug 2004 A1
20040186848 Kobashikawa et al. Sep 2004 A1
20040186896 Daniell et al. Sep 2004 A1
20040187075 Maxham et al. Sep 2004 A1
20040193596 Defelice et al. Sep 2004 A1
20040199507 Tawa, Jr. Oct 2004 A1
20040203642 Zatloufai et al. Oct 2004 A1
20040205773 Carcido et al. Oct 2004 A1
20040215715 Ehrich et al. Oct 2004 A1
20040230572 Omoigui Nov 2004 A1
20040235520 Cadiz et al. Nov 2004 A1
20040254928 Vronay et al. Dec 2004 A1
20040254938 Marcjan et al. Dec 2004 A1
20040255301 Turski et al. Dec 2004 A1
20040261026 Corson Dec 2004 A1
20040267700 Dumais et al. Dec 2004 A1
20040267730 Dumais et al. Dec 2004 A1
20040267756 Bayardo et al. Dec 2004 A1
20050021542 Irle et al. Jan 2005 A1
20050033803 Vleet et al. Feb 2005 A1
20050050547 Whittle et al. Mar 2005 A1
20050057584 Gruen et al. Mar 2005 A1
20050060310 Tong et al. Mar 2005 A1
20050060719 Gray et al. Mar 2005 A1
20050071322 Chen et al. Mar 2005 A1
20050076115 Andrews et al. Apr 2005 A1
20050080792 Ghatare Apr 2005 A1
20050080866 Kent, Jr. et al. Apr 2005 A1
20050108213 Riise et al. May 2005 A1
20050108332 Vaschillo et al. May 2005 A1
20050114021 Krull et al. May 2005 A1
20050114487 Peng et al. May 2005 A1
20050165777 Hurst-Hiller et al. Jul 2005 A1
20050192921 Chauduri et al. Sep 2005 A1
20050216482 Ponessa Sep 2005 A1
20050251526 Nayak Nov 2005 A1
20050262073 Reed et al. Nov 2005 A1
20060031365 Kay et al. Feb 2006 A1
20060085750 Easton et al. Apr 2006 A1
20060100912 Kumar et al. May 2006 A1
20060106778 Baldwin May 2006 A1
20060167704 Nicholls et al. Jul 2006 A1
20060190470 Lemnotis Aug 2006 A1
20060224553 Chtcherbatchenko et al. Oct 2006 A1
20060288075 Wu Dec 2006 A1
20070016556 Ann et al. Jan 2007 A1
20070022155 Owens et al. Jan 2007 A1
20070033275 Toivonen et al. Feb 2007 A1
20070055689 Rhoads et al. Mar 2007 A1
20070078860 Enenkiel Apr 2007 A1
20070208697 Subramaniam et al. Sep 2007 A1
Foreign Referenced Citations (9)
Number Date Country
1209866 May 2002 EP
2000-099441 Apr 2000 JP
2001-5705 Jan 2001 JP
2003-242176 Aug 2003 JP
2003-296365 Oct 2003 JP
2004-062451 Feb 2004 JP
WO 0162004 Aug 2001 WO
WO 02069118 Sep 2002 WO
WO 2005006129 Jan 2005 WO
Non-Patent Literature Citations (70)
Entry
“About Spector CNE,” Spectorsoft, 1 page, [online] [Retrieved on May 23, 2007] Retrieved from the Internet: URL: http://www.spectorsoft.com/products/spectorcne windows/help/v40/webhelp/About Spector CNE>.
“askSam™ Making Information Useful,” askSam,—Organize your information with askSam, http://www.asksam.com/brochure.asp, printed Mar. 15, 2004.
“Overview,” Stuff I've Seen Home Page, http://research.Microsoft.com/adapt/sis/index.htm, pp. 1-2, printed May 26, 2004.
“Searching for the next Google—New trends are helping nimble startups elbow in to the plundered market,” Red Herring—The Business of Technology, Mar. 9, 2004, http://redherring.com/PrintArticle.aspx?a=4782&sector=Capital, p. 1-5, printed Mar. 30, 2004.
“Selecting Task-Relevant Sources for Just-In-Time Retrieval,” pp. 1-3, no date.
“Spector Corporate Network Edition 4.0 (Spector CNE) Online User Manual,” SpectorSoft Corporation, 2003, [online] [retrieved on May 12, 2005] Retrieved from the Internet: <URL: http://www.spectorsoft.com/products/ spectorcne windows/help/v40/webhel p/>.
“Standardization Priorities for the Directory—Directory Interoperability Forum White Paper,” The Open Group, Dec. 2001, pp. 1-21.
“Universal Document Conversion Server,” ImageMaker Company Website, 2003, 21 Pages, [online] [Retrieved on Apr. 25, 2007] Retrieved from the Internet: <URL: http://web.archive.org/web/20030420221733/http://www.conversionserver.com/Default.asp>.
“WhenU Just-In-Time Marketing,” http://www.whenu.com/, printed Mar. 19, 2004.
80-20 Software Products—80-20 One Search, http://www.80-20.com/products/one-search/retriever.asp, printed Mar. 16, 2004.
Alexa® Web Search—Toolbar Quick Tour, httQ://Qaqes.alexa.com/Qrod serv/quicktour html, pp. 1-5, printed Mar. 16, 2004.
Bacon, J. et al., “Event Storage and Federation Using ODMG,” 2000, pp. 265-281, vol. 2135, [online] Retrieved from the Internet <URL: http://citeseer.ist.psu.edu/bacon00event.html>.
Barrett, R. et al. “How to Personalize the Web,” IBM Research, http:/lwww.almaden.ibm.com/cs/wbi/papers/chi97/wbipaper.html, pp. 1-13, printed Mar. 16, 2004.
Battelle, J., CNN.com “When geeks go camping, ideas hatch,” http://www.cnn.com/2004/TECH/ptech/01/09/bus2.feat.geek.camp/index.html pp. 1-3, printed Jan. 13, 2004.
Bengel, J., et al., “Archiving and Indexing Chat Utterances,” Electrical Engineering and Computer-Science and Information Technology Telecommunications Center University of Kansas, 2003.
Boyan, J., et al., “A Machine Learning Architecture for Optimizing Web Search Engines,” School of Computer Science, Carnegie Mellon University, May 10, 1996, pp. 1-8.
Bradenbaugh, F., “Chapter 1 The Client-Side Search Engine,” JavaScript Cookbook, 151 Ed., Oct. 1999, O'Reilly™ Online Catalog, http://www.oreilly.com/catalog/jscook/chapter/ch01.html pp. 1-30, printed Dec. 29, 2003.
Brin, S., et al, “The Anatomy of a Large-Scale Hypertextual Web Search Engine,” http://www7.scu.edu.au/programme/fullpapers/1921/com1921.htm, pp. 1-18, 1998.
Budzik, J., “Information access in context,” Knowledge-Based Systems, Elsevier 2001, pp. 37-53, vol. 14.
Budzik, J., et al., User Interactions with Everyday Applications as Context for Just-in-time Information Access, Intelligent Information Laboratory, Northwestern University, pp. 1-8, no date.
DEVONthink, http://www.devon-technologies.com/products/devonthink.php, printed Mar. 16, 2004.
dtSearch®—http://www.dtsearch.com/, printed Mar. 15, 2004.
Dumais, S., et al, “Stuff I've Seen: A System for Personal Information Retrieval and Re-Use.” Microsoft Research, SIGIR'03, Jul. 28-Aug. 1, 2003, pp. 1-8.
Enfish, http://www.enfish.com, printed Mar. 16, 2004.
European Examination Report, European Application No. EP 05731490.8, Jul. 7, 2008, 5 pages.
European Search Report, European Application No. EP 05731490.8, Apr. 28, 2008, 4 pages.
Examination Report for European Patent Application No. EP 05731415.5, Oct. 15, 2010, 11 Pages.
Examination Report, European Patent Application No. 05731427.0, Jul. 28, 2008, 5 Pages.
Fast Search & Transfer-Home-Enterprise Search, http://solutions.altavista.com/en/news/pr, printed Mar. 16, 2004.
Fertig, S., et al., “Lifestreams: An Alternative to the Desktop Metaphor.” http://www.acm.org/sigchi/chi96/proceedings/videos/Fertig/etf.htm, pp. 1-3, printed Mar. 16, 2004.
First Office Action of China State Intellectual Property Office, Chinese Patent Application No. 20058009372.X, Dec. 5, 2008.
Huang et al., Multimedia Search and Retrieval: New Concepts, System Implementation, and Application, Circuits and Systems for Video Technology, IEEE transactions on, vol. 10, Issue 6, Aug. 2000, pp. 679-692.
Geisler. G. “Enriched Links: A Framework for Improving Web Navigation Using Pop-Up Views,” pp. 1-14, 2000.
Gemmell, J., et al., “Living with a Lifetime Store,” Proc. ATR Workshop on Ubiquitous Experience Media, Sep. 9-10, 2003, pp. 69-76.
Gemmell, J., et al., “The MyLifeBits Lifetime Store,” Proceedings of the 2003 ACM SIGMM Workshop on Experimental Telepresence, Nov. 7, 2003, pp. 80-83.
International Preliminary Report on Patentability, PCT/US2005/003386, Jun. 24, 2005, 8 pages.
International Search Report and Written Opinion, PCT/US2004/038562, Apr. 6, 2005.
International Search Report and Written Opinion, PCT/US2005/003386, Jun. 28, 2005.
International Search Report and Written Opinion, PCT/US2005/010985, Apr. 26, 2007, 9 pages.
ISYS Search Software ISYS: desktop, http://www.isysusa.com/products/desktop/index.html, printed Mar. 16, 2004.
Joachims, T., et al., “WebWatcher: A Tour Guide for the World Wide Web,” 1996.
Jonathan Bennett & Auto It Team, “Auto It v3 Homepage,” Verson v3.0.1 02, 1999-2004, 26 pages, [online] [Archived on Aug. 13, 2004; Retrieved on Dec. 2, 2008] Retrieved from the internet < U RL: http://web.archive .orq/web/2004081 3195143/http://www. autoitscript.com/autoit3/docs/>.
Knezevic, P. et al., “The Architecture Of The Obelix—An Improved Internet Search Engine,” Proceedings of the 33'd Annual Hawaii International Conference on System Sciences (HICSS) Jan. 4-7, 2000, Maui, HI, USA, pp. 2145-2155.
Leake, D., et al., “Selecting Task-Relevant Sources for Just-In-Time Retrieval,” In Proceedings of the AAAI-99 Workshop on Intelligent Information Systems. AAAI Press, Menlo Park, CA, 1999, 6 pages, can be retrieved at <URL:http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.50.2080&rep=rep1 &type=pdf>.
Markoff, J., “Google Moves Toward Clash with Microsoft,” The New York Times, May 19, 2004, http://www.nytimes.com/2004/5/19/technology/19google.html?ex=1085964389&ei=1&e . . . , pp. 1-4, printed May 19, 2004.
Morita, M. et al., “Information Filtering Based on User Behavior Analysis and Best Match Text Retrieval,” Proceedings of the Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, Dublin, Jul. 3-6, 1994, pp. 272-281.
Naraine. R., “Future of Search Will Make You Dizzy,” Enterprise, May 20, 2004.
http://www.internetnews.coment-news/article.php/3356831, pp. 1-4, printed May 21, 2004.
PCT International Preliminary Report on Patentability and Written Opinion, PCT/US2005/003386, Oct. 4, 2006, 8 pages.
PCT International Search Report and Written Opinion, PCT International Patent Application No. PCT/US2005/010686, Sep. 13, 2006.
PCT International Search Report and Written Opinion, PCT/US2005/10685, Jul. 3, 2008, 11 Pages.
PCT International Search Report and Written Opinion, PCT/US2005/10687, Sep. 10, 2008, 14 Pages.
PCT International Search Report and Written Opinion, PCT/US2004/038562, Apr. 6, 2005, 8 Pages.
PCT International Search Report and Written Opinion, PCT/US2005/010985, Apr. 26, 2007, 9 Pages.
Pingali et al., Instantly Indexed Multimedia Databases of Real World Events, Multimedia, IEEE Transactions on, vol. 4, Issue 2, Jun. 2002, pp. 269-282.
Rekimoto, J., “Time-Machine Computing: A Time-centric Approach for the Information Environment,” Proceedings of the Annual ACM Symposium on User Interface Software and Technology, Nov. 7, 1999, pp. 1-10.
Rhodes, B., “Margin Notes Building a Contextually Aware Associative Memory,” The Proceedings of the International Conference on Intelligent User Interfaces (IUI'00), Jan. 9-12, 2000.
Rhodes, B., et al., “Just-in-time information retrieval agents,” Systems Journal, vol. 39, Nos. 3&4, 2000, pp. 685-704.
Rhodes, B., et al., “Remembrance Agent—A continuously running automated information retrieval system.” The Proceedings of the First International Conference on the Practical Application of Intelligent Agents and Multi Agent Technology (PAAM '96), pp. 487-495.
Rizzo, T., “WinFS 101: Introducing the New Windows File System,” Longhorn Developer Center Home: Headline Archive: WinFS 101: Introducing the New . . . , http://msdn.Microsoft.com/Longhorn/archive/default.aspx?pull+/library/en-us/dnwints/htm . . . , pp. 1-5, printed Apr. 21, 2004.
Second Office Action of China State Intellectual Property Office, mailed on Jul. 4, 2011, Chinese Patent Application No. 200580009372.X, 5 pages.
Sengupta, S., et al., Designing a Value Based Niche Search Engine Using Evolutionary Strategies, Proceedings of the International Conference of Information Technology: Coding and Computing (ITCC'05), IEEE, 2005, Pennsylvania State University.
Sherman, C., “HotBot's New Desktop Search Toolbar,” www.searchenginewatch.com, http://searchenginewatch.com/searchday/print.php/34711—339921, pp. 1-3, printed Apr. 14, 2004.
Spiteri, M.D. et al., “An Architecture to Support Storage and Retrieval of Events,” Sep. 1998, pp. 443-458, [online] Retrieved from the Internet<URL:http://citeseer.ist.psu.edu/spiteri98architecture.html>.
Spiteri, M.D., “An Architecture for the Notification, Storage and Retrieval of Events,” Jan. 2000, pp. 1-165 pages, [online] Retrieved from the Internet<URL:http://citeseer.ist.psu.edu/spiteri00architecture.html>.
Sullivan, D., “Alta Vista Releases Search Software,” The Search Engine Report, Aug. 4, 1998, pp. 1-2.
Supplementary European Search Report, European Patent Application No. 05731415, Jun. 4, 2009, 6 Pages.
WebWatcher Home Page, “Welcome to the WebWatcher Project,” http://www-2.cs.emu.edu/-webwatcher/, printed Oct. 15, 2003.
X1 instantly searches files & email. For outlook, Outlook, http://www.x1.com/, printed Mar. 15, 2004.
Zellweger, P., et al., “Fluid Links for Informed and Incremental Link Transitions,” Proceedings of Hypertext'98, Pittsburgh, PA, Jun. 20-24, 1998, pp. 50-57.
Related Publications (1)
Number Date Country
20140101166 A1 Apr 2014 US
Continuations (2)
Number Date Country
Parent 13323693 Dec 2011 US
Child 14103849 US
Parent 10813895 Mar 2004 US
Child 13323693 US