Using data feed archives such as RSS archives is described herein.
Internet searching has attracted significant activity aimed at improving the speed, scope, and relevance of search results. Some companies have also leveraged popular search engines into related areas such as targeted advertising and specialty searches. Beneath these web-based or programming-interface-based search systems lay technologies for locating content, indexing content, and determining the relevance of content in response to particular search requests. Often such systems focus on finding content among the billions of web pages and other content items on the World Wide Web.
As RSS becomes an increasingly popular medium for Internet communications and communities, there as an increasing need to store and index historical RSS data. A system and method for searching content specific sources, metadata sources, and distribution channels such as archived RSS datafeed information is described herein.
Several types of archival formats may be usefully employed for RSS.
In one aspect, an archival format may permit full reconstruction of any historical RSS feed. The archived data may include time-stamping or other certification of time so that publication dates are accurately and non-repudiatably preserved.
In another aspect, an archival format may extract and more efficiently store elements of an RSS feed, such as text, enclosures, and the like. This data may be stored according to relevant tags, with certain tags and tagged content being removed. In another aspect, the original RSS content may be processed for archiving. For example, the text portion may be enhanced based on what appears in HTML source code for an item, or from a feed.
It will be understood that the archival format may be standardized so that a corresponding database will include suitable fields or indices for generalized or specific post-archiving uses. For example, time stamps may be used as noted above. As another example, certain feed or item metadata from the HTML code may be extracted and stored with item content. In particular, information such as source information, author, unique ID or permalink data, and so forth, may be extracted in order to uniquely identify RSS text after surrounding HTML or XML based metadata has been removed for archiving.
The extracted data may be added directly to a text form of the item for archiving. In another aspect, the extracted data may be stored in a suitably configured relational database or other storage medium.
It will be further appreciated that the archival format may be supplemented with additional data not present in the feed or item HTML. For example, semantic metadata may be generated relating to popularity, subject matter, usage, or other characteristics of a particular item, or a feed from which the item was obtained.
An archive may be adapted for specific or general use. For example, a market-specific archive (e.g., real estate, medical, financial, and so forth) may be created that is supplemented with relevant metadata. And for each market, certain existing metadata may be retained in the archival format or dispensed with entirely.
In some aspects, a method includes processing two or more independent RSS data feeds to generate two or more RSS market specific searchable RSS datafeed archives. The method also includes generating, using a master probe device, a probe plan based on an input received from a user. The method also includes applying, using a plurality of slave probe devices, at least two different probes to the archives to derive information based on data in the searchable RSS datafeed archives, the probes being part of the probe plan to determine a result based on the derived information. At least one of the probes is applied to at least two of the searchable RSS datafeed archives and at least two of the probes are applied to the same searchable RSS datafeed archive. The method also includes determining the result based on the derived information and generating an RSS feed that includes the result.
Embodiments can include one or more of the following.
The market specific datafeed archives can include one or more of a real estate datafeed archive, a medical datafeed archive and a financial datafeed archive.
Processing the two or more independent data feeds can include storing metadata and an automatically generated importance value.
Generating the probe plan can include using a master engine to generate the probe plan.
Determining the result can include receiving sub-results from one or more of the at least two different probes, the sub-results differing in structure and format, and combining the sub-results to generate the result.
Combining the sub-results can include identifying a first sub-result that is a duplicate or near duplicate of a second sub-result and generating a hyperlink to the second sub-result.
In some additional aspects, a method includes processing two or more independent data feeds to generate two or more searchable datafeed archives. The method also includes applying at least two different probes to the archives to derive information based on data in the archives, the probes being part of a probe plan to determine a result based on the derived information, at least one of the probes being applied to at least two of the archives. The method also includes determining the result based on the derived information and providing the result for use in a real-world application.
Embodiments can include one or more of the following.
The searchable datafeed archives can include RSS searchable datafeed archives.
Processing the two or more independent datafeeds can include processing the two or more independent datafeeds to generate market specific datafeed archives.
The market specific datafeed archives can include one or more of a real estate datafeed archive, a medical datafeed archive and a financial datafeed archive.
Processing the two or more independent data feeds can include storing metadata and an automatically generated importance value.
The method can also include generating the probe plan based on an input received from a user.
Generating the probe plan can include using a master engine to generate the probe plan.
The probes can have differing structures.
Determining the result can include receiving sub-results from one or more of the probes, the sub-results differing in structure and format. The method can also include combining the sub-results to generate the result. Combining the sub-results can include identifying a first sub-result that is a duplicate or near duplicate of a second sub-result and generating a hyperlink to the second sub-result.
Providing the result can include generating an RSS feed that includes the result.
In some additional aspects, a method includes generating, based on a probe plan and a search request, probes, the probes differing from one another and configured to search market specific searchable datafeed archives. The method also includes receiving, in response to the probes, sub-results from one or more of the probes. The method also includes determining a result based on the sub-results and providing the result for use in a real-world application.
Embodiments can include one or more of the following.
The searchable datafeed archives can be RSS searchable datafeed archives.
The market specific datafeed archives can include one or more of a real estate datafeed archive, a medical datafeed archive and a financial datafeed archive.
The probes can have differing structures.
Determining the result can include receiving sub-results from one or more of the probes, the sub-results differing in structure and format. The method can also include combining the sub-results to generate the result.
Providing the result can include generating an RSS feed that includes the result.
It will be understood that while RSS is used herein as a convenient and commonly used example of an XML-based and syndication-ready grammar, other XML-based systems may be suitably archived using the techniques described herein including without limitation other syndication technologies (such as Atom) and other grammars such as OPML for outlining and so forth.
Metadata may be extracted from an RSS channel description, or from a particular RSS item. This includes any metadata encoded in the HTML associated with an RSS item. This metadata may be directly extracted for storage, or may be analyzed by an analysis engine for purposes of filtering, enriching, or otherwise processing the metadata to produce new metadata associated with the item (or the channel). However obtained, a selected portion of extracted or derived metadata may be stored with an RSS archival format.
Content, typically text but also including enclosures of any form or other content contained within an RSS item, may also be extracted for storage in the archival format. In addition, the content may itself be analyzed by the analysis engine, and metadata may be generated based upon the content either alone or in combination with other available metadata, for storage with the other metadata of the archival format.
The archival format may take any suitable form including an archival XML grammar, a simple text document (which may be subject to one or more constraints to preserve archival metadata such as key value pairs, metadata delimiters, or the like). The archival format may also be preserved in a suitably constructed database which may be indexed, for example, by content, metadata, or a combination of these.
All such variations and others may be employed with the systems described herein.
These and other aspects and features, and combinations of them, may be expressed as methods, apparatus, systems, program products, databases, methods of doing business, and means for performing functions, and in other ways.
Other aspects and features will become apparent from the following description and from the claims.
Referring now to
Any and all instances of content 20 (and, therefore, any and all instances of an RSS channel or item) may comprise or be associated with metadata 8. In embodiments, an analysis engine 16 may process instances and generate the metadata 8 as a result of the processing. This processing may be entirely automatic, such as and without limitation according to an algorithm, heuristic, or the like. For example and without limitation, the automatic processing may recognize that many instances contain a hyperlink to a particular instance. Based upon this recognition the automatic processing may generate metadata 18 indicating that the particular instance is relatively important. Alternatively, this processing may include accepting a human input. For example and without limitation, the human input may comprise a tag that is associated with a folksonomy, collaborative tagging, social classification, social indexing, social tagging, or the like. Many examples of automatic processing and processing that accepts a human input will be appreciated and all such examples (and others) are intended to fall within the scope of the claims.
An RSS archival format 22 may specify embodiments of RSS items and/or RSS channels in association with metadata. In embodiments, an RSS archive may comprise data that is formatted according to the RSS archival format. It will be appreciated that such data could be stored in a database, a flat file system, a data stream, and so on. An example RSS archive, provided for the purpose of illustration and not limitation, is as follows:
In the foregoing example, an RSS 2.0 feed includes an RSS channel and the RSS channel includes two RSS items. The RSS channel includes an instance of metadata, the metadata being of class “automatic” and style “importance”. An automatic process of the analysis engine may generate this metadata. This metadata contains two elements, one of type “importance” and the other of type “date-rated”. The importance element may be a score on 1-to-10 scale and the date-rate element may be the date on which the automatic process determined the importance. One of the RSS items also includes an instance of metadata, the metadata being of class “human-input” and style “folksonomy”. A process of the analysis engine 16 and that accepts human input may generate this metadata. This metadata contains two elements, both of which are of type “tag”. Each of these elements contain values (“cats” and “humor”) that may have been provided to the automatic process by a human. In light of the foregoing example instance of an RSS archive, innumerable RSS archival formats will be appreciated and all such formats (and others) are intended to fall within the scope of the claims.
Referring now to
The master search engine 46 may receive a query 50. The query 50 may be a structured query, an unstructured query, an XML query, an SQL query, and so on. In embodiments, a user or an automatic process may provide the query 50. For example and without limitation, a user may be interested in accessing all RSS items that relate to cats. The user may transmit a free-form text string (for example: “tuxedo cats”) to the master search engine. The master search engine may receive this text string as the query.
In response to the query 50, the master search engine 48 may devise a query plan that involves communicating at least one sub-query, (e.g., one of queries 42, 44 and 46), to at least one of the slave search engines (36, 38, 40). The sub-queries 42, 44, and 46 may be formatted according to any and all query languages and formats. In embodiments, the master search engine 48 may submit the sub-queries 42, 44 and 46 to the slave search engines 36, 38 and 40 via SOAP, via a REST-ful interface, via an API, via a remote procedure call, and so on. In embodiments, the master search engine 48 may be operatively coupled to the slave search engines 36, 38 and 40 via the Internet, a public network, a private network, a virtual private network, and so on. In embodiments, the master search engine 48 and the slave search engines 36, 38 and 40 may operate under separate administrative control and the sub-queries 42, 44 and 46 may be transmitted via a public interface, a protected interface, a private interface, or the like.
In embodiments, the slave search engines 36, 38 and 40 may exist as public services that are operated independently from one another. For example and without limitation, the following RSS search engines may be employed as slave search engines: Bloglines, BlogPulse, Daypop, Feedster, Findory Blogory, Gigablast Blog Search, IceRocket Blog Search, PubSub, and Technorati. In addition, slave search engines may include proprietary archives of RSS content that are not open to public use, or that require registration, login, subscription fees, or the like. Each of the slave search engines may implement an interface, query format, feature set, search capability, or the like that differs from another one of the slave search engines.
In embodiments, the master search engine 44 may encompass a library or collection of bridges, adaptors, converters, interfaces, or the like that enable the master search engine to communicate sub-queries in a plurality of query formats and with respect to a plurality of interfaces, feature sets, search capabilities, and the like. In any case, the master search engine may prepare a plurality of sub-queries in response to the query 50. Each of the sub-queries 42, 44 and 46 may be tailored to one of the slave search engines 36, 38 and 40. The master search engine 48 communicates the sub-queries 42, 44 and 46 to the corresponding slave search engines 36, 38 and 40.
While in the example described above in relation to
Referring now to
Any and all of the partial results may comprise metadata, RSS feeds, RSS archives, RSS items, XML, or any and all other forms of data. The master search engine 48 may combine some or all of the partial results 52, 54 and 56 into a single result 58, which itself may comprise a plurality of elements. This result may be formatted as an HTML page, an RSS feed, a database table, a combination of any and all of the foregoing, or the like. All together, the partial results may contain duplicate or near-duplicate RSS items, RSS feeds, RSS archives, and the like. To compensate for this, embodiments of the result may contain one element that is representative of the duplicate or near-duplicate elements plus a hyperlink or the like that is associated with this one element, the hyperlink providing access to all of the duplicate or near-duplicate elements of this one element.
Embodiments of the master search engine may provide a web portal with an HTML form or the like into which a user may enter a query. Embodiments of the master search engine may provide an API or programmatic interface for communicating queries and results.
Archiving Content
Various services may be provided based upon a content archive, which may include archiving for RSS data, HTML data, OPML data, or any other XML data and the like, as well as media and other content files associated with any of the foregoing.
In one aspect, a search engine may be provided that spans multiple archives of RSS content. Thus, where multiple archives exist for content, a meta search engine may be provided to span content in all such archives. This may include searching of archives provided by various RSS content providers, as well as independent or third-party archives discovered and explored using, e.g., spiders, link analysis, and so forth.
Another service may provide user-configurable archiving. In one aspect, this provides a user with a persistent store of data for one or more RSS feeds or the like, so that content of interest can be preserved regardless of the persistence of the feed source. Such archives may be prepared based upon original source content, aggregated content, and so forth. In creating such an archive, a user may specify one or more sources, and may specify archiving parameters such as frequency of archiving (e.g., hourly, daily, weekly, monthly, etc.), storage capacity, link depth (such as whether and how links within an archived item are navigated/stored), and so forth. A user may also specify access credentials for secure content where appropriate.
More generally, any web content may be periodically archived under user control. Thus, for example, a user may specify locations of interest and have these locations periodically archived to provide both persistence and a time-based view of content at these locations. This service may be usefully employed, for example, to archive a user's web content such as social networking pages, professional web sites, and so forth. The service may also, or instead, be usefully employed to periodically capture competitive data, time-based commentary, subject-matter-based news items, and so forth, any or all of which may be archived for subsequent retrieval and review by the user. Archiving instructions may also include, for example, login credentials or the like for accessing proprietary content of the user, or content to which the user is a paid subscriber. The system may usefully explore links within archived content, and archive some or all of the linked content as well. This link depth may be specified by the user in either absolute terms (e.g., archive one-link content, two-link content, etc.), or in relative terms (e.g., all links within domain, all links having a certain path, etc.). In one embodiment, such a service may be used in a content management system to archive and/or audit content on a website or the like.
In one aspect, a web archiving service may be combined with a desktop backup client so that a user can specify, within a single interface, both local files and remote content for archiving within a single interface or operation.
The system described herein can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, web-enabled applications, or in combinations thereof. Data structures used to represent information provided by the patient can be stored in memory and in persistence storage. Apparatus of the invention can be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor and method actions can be performed by a programmable processor executing a program of instructions to perform functions of the invention by operating on input data and generating output. The invention can be implemented advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Each computer program can be implemented in a high-level procedural or object oriented programming language, or in assembly or machine language if desired, and in any case, the language can be a compiled or interpreted language. Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory. Generally, a computer will include one or more mass storage devices for storing data files, such devices include magnetic disks, such as internal hard disks and removable disks magneto-optical disks and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including, by way of example, semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as, internal hard disks and removable disks; magneto-optical disks; and CD_ROM disks. Any of the foregoing can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits).
Other implementations are within the scope of the following claims.
This application is a continuation of U.S. Nonprovisional application Ser. No. 12/233,266, entitled USING RSS ARCHIVES, filed Sep. 18, 2008 ('266 Application) , now U.S. Pat. No. 8,140,482. The '266 Application claims priority under 35 USC §119(e) to provisional U.S. Patent Application Ser. 60/973,480, filed on Sep. 19, 2007 and to provisional U.S. Patent Application Ser. 61/082,802, filed on Jul. 22, 2008, the entire contents of which are hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5664109 | Johnson et al. | Sep 1997 | A |
5758095 | Albaum et al. | May 1998 | A |
5784635 | McCallum | Jul 1998 | A |
5845255 | Mayaud | Dec 1998 | A |
5930764 | Melchione et al. | Jul 1999 | A |
5931946 | Terada et al. | Aug 1999 | A |
5933136 | Brown | Aug 1999 | A |
6022315 | Iliff | Feb 2000 | A |
6029195 | Herz | Feb 2000 | A |
6070189 | Bender et al. | May 2000 | A |
6131085 | Rossides | Oct 2000 | A |
6163774 | Lore et al. | Dec 2000 | A |
6199082 | Ferrel et al. | Mar 2001 | B1 |
6233618 | Shannon | May 2001 | B1 |
6253210 | Smith et al. | Jun 2001 | B1 |
6311194 | Sheth et al. | Oct 2001 | B1 |
6442333 | Izawa | Aug 2002 | B1 |
6484182 | Dunphy et al. | Nov 2002 | B1 |
6551243 | Bocionek et al. | Apr 2003 | B2 |
6598161 | Kluttz et al. | Jul 2003 | B1 |
6678764 | Parvulescu et al. | Jan 2004 | B2 |
6693947 | Schroeder | Feb 2004 | B1 |
6732080 | Blants | May 2004 | B1 |
6734886 | Hagan et al. | May 2004 | B1 |
6804656 | Rosenfeld et al. | Oct 2004 | B1 |
6904461 | Randhava et al. | Jun 2005 | B1 |
6931532 | Davis et al. | Aug 2005 | B1 |
6954532 | Handley et al. | Oct 2005 | B1 |
6961858 | Fransdonk | Nov 2005 | B2 |
6993522 | Chen et al. | Jan 2006 | B2 |
7010681 | Fletcher et al. | Mar 2006 | B1 |
7020635 | Hamilton et al. | Mar 2006 | B2 |
7058710 | McCall et al. | Jun 2006 | B2 |
7072934 | Helgeson et al. | Jul 2006 | B2 |
7080049 | Truitt et al. | Jul 2006 | B2 |
7090128 | Farley et al. | Aug 2006 | B2 |
7107462 | Fransdonk | Sep 2006 | B2 |
7117504 | Smith et al. | Oct 2006 | B2 |
7127328 | Ransom | Oct 2006 | B2 |
7142691 | Levy | Nov 2006 | B2 |
7146415 | Doi et al. | Dec 2006 | B1 |
7149813 | Flanagin et al. | Dec 2006 | B2 |
7150045 | Koelle et al. | Dec 2006 | B2 |
7188144 | Fuisz | Mar 2007 | B2 |
7269664 | Hutsch et al. | Sep 2007 | B2 |
7296077 | Harmon et al. | Nov 2007 | B2 |
7302567 | Hearn et al. | Nov 2007 | B2 |
7308477 | Gress et al. | Dec 2007 | B1 |
7406427 | Guyan et al. | Jul 2008 | B1 |
7412534 | Tsang et al. | Aug 2008 | B2 |
7421155 | King et al. | Sep 2008 | B2 |
7451147 | Kao et al. | Nov 2008 | B1 |
7472349 | Srivastava et al. | Dec 2008 | B1 |
7519591 | Landi et al. | Apr 2009 | B2 |
7565410 | Stickler | Jul 2009 | B2 |
7584208 | Spivack et al. | Sep 2009 | B2 |
7587502 | Crawford et al. | Sep 2009 | B2 |
7620606 | Gentry et al. | Nov 2009 | B2 |
7711586 | Aggarwal et al. | May 2010 | B2 |
7865511 | Kahn et al. | Jan 2011 | B2 |
7904367 | Chung et al. | Mar 2011 | B2 |
7949666 | Wolff et al. | May 2011 | B2 |
7953725 | Burris et al. | May 2011 | B2 |
8010282 | Barry et al. | Aug 2011 | B2 |
8140482 | Moore | Mar 2012 | B2 |
8200700 | Moore et al. | Jun 2012 | B2 |
8200775 | Moore | Jun 2012 | B2 |
8316005 | Moore | Nov 2012 | B2 |
8347088 | Moore et al. | Jan 2013 | B2 |
8566115 | Moore | Oct 2013 | B2 |
8700738 | Moore et al. | Apr 2014 | B2 |
20010016851 | Gramsamer et al. | Aug 2001 | A1 |
20010051881 | Filler | Dec 2001 | A1 |
20010052933 | Nybo et al. | Dec 2001 | A1 |
20010056359 | Abreu | Dec 2001 | A1 |
20020010616 | Itzhaki | Jan 2002 | A1 |
20020010764 | Spicer | Jan 2002 | A1 |
20020029157 | Marchosky | Mar 2002 | A1 |
20020032742 | Anderson | Mar 2002 | A1 |
20020038316 | Onyon et al. | Mar 2002 | A1 |
20020049614 | Rice et al. | Apr 2002 | A1 |
20020059049 | Bradbury et al. | May 2002 | A1 |
20020059399 | Learmonth | May 2002 | A1 |
20020091734 | Redlich et al. | Jul 2002 | A1 |
20020138467 | Jacobson et al. | Sep 2002 | A1 |
20020143742 | Nonomura et al. | Oct 2002 | A1 |
20020143819 | Han et al. | Oct 2002 | A1 |
20020152210 | Johnson et al. | Oct 2002 | A1 |
20020152318 | Menon et al. | Oct 2002 | A1 |
20020154178 | Barnett et al. | Oct 2002 | A1 |
20020157023 | Callahan et al. | Oct 2002 | A1 |
20020188522 | McCall et al. | Dec 2002 | A1 |
20030046434 | Flanagin et al. | Mar 2003 | A1 |
20030050801 | Ries et al. | Mar 2003 | A1 |
20030055818 | Faybishenko et al. | Mar 2003 | A1 |
20030055825 | Chen et al. | Mar 2003 | A1 |
20030061404 | Atwal et al. | Mar 2003 | A1 |
20030069751 | Lichtenstein et al. | Apr 2003 | A1 |
20030074352 | Raboczi et al. | Apr 2003 | A1 |
20030088544 | Kan et al. | May 2003 | A1 |
20030088784 | Ginter et al. | May 2003 | A1 |
20030126120 | Faybishenko et al. | Jul 2003 | A1 |
20030217047 | Marchisio | Nov 2003 | A1 |
20030225718 | Shmulevich et al. | Dec 2003 | A1 |
20030229692 | Vo | Dec 2003 | A1 |
20040002966 | Perkowski | Jan 2004 | A1 |
20040034550 | Menschik et al. | Feb 2004 | A1 |
20040054675 | Li | Mar 2004 | A1 |
20040054722 | Defloor et al. | Mar 2004 | A1 |
20040064428 | Larkin et al. | Apr 2004 | A1 |
20040073661 | Eibach et al. | Apr 2004 | A1 |
20040078231 | Wilkes et al. | Apr 2004 | A1 |
20040078236 | Stoodley et al. | Apr 2004 | A1 |
20040093412 | Chen et al. | May 2004 | A1 |
20040133580 | Liu et al. | Jul 2004 | A1 |
20040139317 | Fronberg | Jul 2004 | A1 |
20040139327 | Brown et al. | Jul 2004 | A1 |
20040143623 | Fukui et al. | Jul 2004 | A1 |
20040172423 | Kaasten et al. | Sep 2004 | A1 |
20040181679 | Dettinger et al. | Sep 2004 | A1 |
20040199765 | Kohane et al. | Oct 2004 | A1 |
20040207659 | Goodman et al. | Oct 2004 | A1 |
20040221226 | Lin et al. | Nov 2004 | A1 |
20040224674 | O'farrell et al. | Nov 2004 | A1 |
20040230674 | Pourheidari et al. | Nov 2004 | A1 |
20040254816 | Myers | Dec 2004 | A1 |
20040260767 | Kedem et al. | Dec 2004 | A1 |
20040267610 | Gossett et al. | Dec 2004 | A1 |
20050027567 | Taha | Feb 2005 | A1 |
20050027871 | Bradley et al. | Feb 2005 | A1 |
20050038717 | McQueen, III et al. | Feb 2005 | A1 |
20050055308 | Meyer et al. | Mar 2005 | A1 |
20050108057 | Cohen et al. | May 2005 | A1 |
20050117527 | Williams et al. | Jun 2005 | A1 |
20050120300 | Schwager et al. | Jun 2005 | A1 |
20050132048 | Kogan et al. | Jun 2005 | A1 |
20050160065 | Seeman | Jul 2005 | A1 |
20050165615 | Minar | Jul 2005 | A1 |
20050198021 | Wilcox et al. | Sep 2005 | A1 |
20050203917 | Freeberg et al. | Sep 2005 | A1 |
20050216315 | Andersson | Sep 2005 | A1 |
20050234740 | Krishnan et al. | Oct 2005 | A1 |
20050262340 | Rabb | Nov 2005 | A1 |
20050267973 | Carlson et al. | Dec 2005 | A1 |
20050289468 | Kahn et al. | Dec 2005 | A1 |
20060004691 | Sifry | Jan 2006 | A1 |
20060004764 | Kurhekar et al. | Jan 2006 | A1 |
20060010251 | Mrsic-flogel et al. | Jan 2006 | A1 |
20060052089 | Khurana et al. | Mar 2006 | A1 |
20060053156 | Kaushansky et al. | Mar 2006 | A1 |
20060059208 | Chen et al. | Mar 2006 | A1 |
20060064320 | Postrel | Mar 2006 | A1 |
20060064326 | Tucker | Mar 2006 | A1 |
20060073812 | Punaganti Venkata et al. | Apr 2006 | A1 |
20060074980 | Sarkar | Apr 2006 | A1 |
20060075426 | Koch et al. | Apr 2006 | A1 |
20060080166 | Takahashi | Apr 2006 | A1 |
20060085412 | Johnson et al. | Apr 2006 | A1 |
20060085788 | Amir et al. | Apr 2006 | A1 |
20060095507 | Watson | May 2006 | A1 |
20060095628 | Ludwig et al. | May 2006 | A1 |
20060101035 | Mustakallio et al. | May 2006 | A1 |
20060106655 | Lettovsky et al. | May 2006 | A1 |
20060106748 | Chafle et al. | May 2006 | A1 |
20060111938 | Vitiello | May 2006 | A1 |
20060112076 | Burris et al. | May 2006 | A1 |
20060129445 | McCallum | Jun 2006 | A1 |
20060136259 | Weiner et al. | Jun 2006 | A1 |
20060149591 | Hanf et al. | Jul 2006 | A1 |
20060155698 | Vayssiere | Jul 2006 | A1 |
20060167860 | Eliashberg et al. | Jul 2006 | A1 |
20060173985 | Moore | Aug 2006 | A1 |
20060178910 | Eisenberger et al. | Aug 2006 | A1 |
20060178918 | Mikurak | Aug 2006 | A1 |
20060184617 | Nicholas et al. | Aug 2006 | A1 |
20060188327 | Moon | Aug 2006 | A1 |
20060200380 | Ho et al. | Sep 2006 | A1 |
20060200478 | Pasztor et al. | Sep 2006 | A1 |
20060221076 | Takahashi et al. | Oct 2006 | A1 |
20060229911 | Gropper et al. | Oct 2006 | A1 |
20060230011 | Tuttle et al. | Oct 2006 | A1 |
20060230021 | Diab et al. | Oct 2006 | A1 |
20060230221 | Hsu et al. | Oct 2006 | A1 |
20060247961 | Klemow | Nov 2006 | A1 |
20060265489 | Moore | Nov 2006 | A1 |
20060265508 | Angel et al. | Nov 2006 | A1 |
20060288011 | Gandhi et al. | Dec 2006 | A1 |
20060288329 | Gandhi et al. | Dec 2006 | A1 |
20070011665 | Gandhi et al. | Jan 2007 | A1 |
20070011710 | Chiu | Jan 2007 | A1 |
20070027710 | Mohr | Feb 2007 | A1 |
20070038712 | Affronti et al. | Feb 2007 | A1 |
20070050446 | Moore | Mar 2007 | A1 |
20070061266 | Moore | Mar 2007 | A1 |
20070061393 | Moore | Mar 2007 | A1 |
20070061487 | Moore et al. | Mar 2007 | A1 |
20070073934 | Rogers | Mar 2007 | A1 |
20070079237 | Abrams et al. | Apr 2007 | A1 |
20070081550 | Moore | Apr 2007 | A1 |
20070088807 | Moore | Apr 2007 | A1 |
20070094156 | Isaacs | Apr 2007 | A1 |
20070094350 | Moore | Apr 2007 | A1 |
20070094365 | Nussey et al. | Apr 2007 | A1 |
20070094389 | Nussey et al. | Apr 2007 | A1 |
20070100959 | Eichstaedt et al. | May 2007 | A1 |
20070106536 | Moore | May 2007 | A1 |
20070106537 | Moore | May 2007 | A1 |
20070106649 | Moore | May 2007 | A1 |
20070106650 | Moore | May 2007 | A1 |
20070106750 | Moore | May 2007 | A1 |
20070106751 | Moore | May 2007 | A1 |
20070106752 | Moore | May 2007 | A1 |
20070106753 | Moore | May 2007 | A1 |
20070106754 | Moore | May 2007 | A1 |
20070116036 | Moore | May 2007 | A1 |
20070116037 | Moore | May 2007 | A1 |
20070130457 | Kamat et al. | Jun 2007 | A1 |
20070139182 | O'connor et al. | Jun 2007 | A1 |
20070143215 | Willems | Jun 2007 | A1 |
20070150482 | Taylor et al. | Jun 2007 | A1 |
20070156809 | Dickinson et al. | Jul 2007 | A1 |
20070168461 | Moore | Jul 2007 | A1 |
20070207782 | Tran | Sep 2007 | A1 |
20070220016 | Estrada et al. | Sep 2007 | A1 |
20070225047 | Bakos | Sep 2007 | A1 |
20070245020 | Ott, IV | Oct 2007 | A1 |
20080005086 | Moore | Jan 2008 | A1 |
20080040151 | Moore | Feb 2008 | A1 |
20080046369 | Wood | Feb 2008 | A1 |
20080046437 | Wood | Feb 2008 | A1 |
20080046471 | Moore et al. | Feb 2008 | A1 |
20080052162 | Wood | Feb 2008 | A1 |
20080052343 | Wood | Feb 2008 | A1 |
20080126178 | Moore | May 2008 | A1 |
20080126476 | Nicholas et al. | May 2008 | A1 |
20080141126 | Johnson et al. | Jun 2008 | A1 |
20080195483 | Moore | Aug 2008 | A1 |
20080244091 | Moore et al. | Oct 2008 | A1 |
20090019063 | Gandhi et al. | Jan 2009 | A1 |
20090172773 | Moore | Jul 2009 | A1 |
20130104251 | Moore | Apr 2013 | A1 |
20130291060 | Moore | Oct 2013 | A1 |
Number | Date | Country |
---|---|---|
226868 | Sep 1984 | DE |
4434369 | Mar 1996 | DE |
0504774 | Sep 1992 | EP |
901723 | Jul 1962 | GB |
06347169 | Dec 1994 | JP |
09145249 | Jun 1997 | JP |
8304161 | Dec 1983 | WO |
03077558 | Sep 2003 | WO |
2004015742 | Feb 2004 | WO |
2006083958 | Aug 2006 | WO |
2007011917 | Jan 2007 | WO |
2007130865 | Nov 2007 | WO |
2007137145 | Nov 2007 | WO |
2008036464 | Mar 2008 | WO |
Entry |
---|
“Customer”, Roget's II The New Thesaurus. Boston: Houghton Mifflin. Credo Reference. [online][retrieved on Jul. 10, 2011], 2003, 1 page. |
“Digital Imaging and Communications in Medicine(DICOM), Part 10: Media Storage and File Format for Media Interchange”, PS Mar. 10, 2004, National Electronics Manufactures Association, Rosslyn, Virginia, Oct. 2004, pp. 1-33. |
“Drugs and Herbs”, WebMD Health—Drug, available at Indexhttp://web.archive.org/web/20051101101459/http://www.webmd.com/drugs/index-drugs.aspx, (accessed online Jul. 11, 2011), Nov. 2005, 45 pages. |
“Outline Processor Markup Language, OPML 1.0 Specification”, available at http://www.opml.org/spec, (accessed online Jul. 5, 2011), Sep. 9, 2000, 6 pages. |
“Serve”, Chambers 21st Century Dictionary. London: Chambers Harrap. Credo Reference [online][retrieved on Jul. 10, 2011], 2001, 1 page. |
“Service”, Chambers 21st Century Dictionary. London: Chambers Harrap. Credo Reference. [online][retrieved on Jul. 10, 2011], 2001, 1 page. |
“The DICOM Standard”, available at http://www.cabiatl.com/mricro/dicom/index.html, (acessed online Oct. 3, 2012), 6 pages. |
“W3Schools Online Web Tutorials”, 2002, 6 pages. |
U.S. Appl. No. 11/458,092, Non-Final Office Action mailed Jun. 9, 2008, OARN, 22 pages. |
U.S. Appl. No. 11/615,030 Non Final Office Action mailed Jan. 23, 2008, all, Jan. 23, 2008, 15 pages. |
Appnel, Timothy, “RSS: The Web Services We Already Have”, http://www.oreillynet.com/xml/blog/2003/01/rss—the—web—service—we—already.html, (accessed online May 29, 2008), Jan. 22, 2003, 2 pages. |
Definition, “application programming interface”, Computer Dictionary, 5th Edition, Microsoft Press, Redmond, WA, May 1, 2002, pp. 33, 3 pages. |
Definition, “graphical user interface”, Computer Dictionary, 5th Edition, Microsoft Press, Redmond, WA, May 1, 2002, pp. 239, 3 pages. |
Definition, “interface”, Computer Dictionary, 5th Edition, Microsoft Press, Redmond, WA, May 1, 2002, pp. 279-280, 4 pages. |
Definition, “Metadata”, Webster's New World Computer Dictionary, 2003, 1 page. |
FEMA, “FEMA: Federal Disaster Declarations RSS”, FEMA.gov, available at http://web.archive.org/web/20050413031904/http://fema.gov/news . . . , (accessed online Dec. 29, 2010), 1 page. |
FEMA, “FEMA: News Releases”, available at web.archive.org/web/20050403173625/www.fema.gov/news/recentnews—rss.fema, (accessed online Jul. 5, 2011), Apr. 3, 2005, 2 pages. |
FEMA, “FEMA: RSS(Really Simple Syndication)”, available at web.archive.org/web/20050416033644/http://www.fema.gov/help/res.shtm, (accessed online Jul. 5, 2011), Apr. 16, 2005, 2 pages. |
Gawlick, Dieter et al., “Using the Oracle Database as a Declarative RSS Hub”, International Conference on Management of Data, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, 2006, p. 722. |
Hammond, Tony et al., “The Role of RSS in Science Publishing”, D-Lib Magazine, vol. 10, No. 12, Dec. 2004, pp. 1-17. |
Kifer, Michael et al., “Database Systems: An Application-Oriented Approach”, Second Edition, Boston, MA: Pearson Education Inc., 2005, pp. 1151-1152. |
Krill, Paul, “Microsoft to demo CRM-RSS”, http://weblog.infoworld.com/techwatch/archives/003933.html, (accessed online Jun. 25, 2007), Sep. 7, 2005, 3 pages. |
Lewin, James, “An Introduction to RSS news feeds: Using open formats for content syndication”, available at http://www.opensourcetutorials.com/tutorials/Server-Side-Coding/Perl/perl-rss-news-feed/page1.html, (accessed online Jul. 5, 2011), Apr. 5, 2004, 11 pages. |
Lund, Ben, “Using Urchin, Notes for Webmasters”, Urchin version 0.8, 2003, 8 pages. |
Marshall, James, “HTTP Made Really Easy”, A Practical Guide to Writing Clients and Servers, available at http:www.jmarshall.com/easy/http/, (accessed online Jul. 12, 2011), Aug. 15, 1997, 21 pages. |
Maurer, L., “U.S. Appl. No. 09/584,318 (Appendix)” Nov. 1, 2012 Mark As Don't Cite—Issued Patent, Nov. 1, 2012 Mark As Don't Cite—Issued Patent, Nov. 1, 2012 Mark As Don't Cite—Issued Patent. |
Nakano, Yusuke et al., “A proposal of RSS WebCrawler model of product information”, IEEE, Proceedings of the 2005 International Conference on Active Media Technology, May 2005, pp. 147-151. |
Oaiss, “UDDI Version 2.04 API Specification”, UDDI Spec TC, available at http://www.uddi.org/pubs/ProgrammersAPI-V2.04-Published—20020719.htm, accessed online Jul. 5, 2011, Jul. 19, 2002, pp. 1-66. |
Pande, Nitin, “System.xml.xmlSerializer”, as found on the EggHeadCafe.Com website, http://www.eggheadcafe.com/articles/system.xml.xmlserialization.asp, (accessed online Nov. 5, 2012), Dec. 8, 2004, 4 pages. |
International Application Serial No. PCT/US2006/003544, International Search Report mailed, Sep. 17, 2008, 3 pages. |
International Application Serial No. PCT/US2006/003544, Written Opinion mailed, Sep. 17, 2008, 3 pages |
International Application Serial No. PCT/US2006/003544, International Preliminary Report on Patentability mailed, Sep. 17, 2008, 7 pages. |
International Application Serial No. PCT/US2006/027794, International Search Report mailed, Nov. 26, 2007, 3 pages. |
International Application Serial No. PCT/US2006/027794, Written Opinion mailed, Nov. 26, 2007, 6 pages. |
International Application Serial No. PCT/US2006/027794, International Preliminary Report on Patentability Issued, Jan. 16, 2008, 7 pages. |
International Application Serial No. PCT/US2006/034944, International Search Report mailed, Mar. 19, 2007, 5 pages. |
International Application Serial No. PCT/US2006/034944, Written Opinion mailed, Mar. 19, 2007, 7 pages. |
International Application Serial No. PCT/US2006/034944, International Preliminary Report on Patentability Issued, Mar. 11, 2008, 8 pages. |
International Application Serial No. PCT/US2007/067643, International Search Report mailed, Jun. 30, 2008, 1 page. |
International Application Serial No. PCT/US2007/067643, Written Opinion mailed, Jun. 20, 2008, 5 pages. |
International Application Serial No. PCT/US2007/067643, International Preliminary Report on Patentability Issued, Nov. 4, 2008, 6 pages. |
International Application Serial No. PCT/US2007/069195, International Search Report mailed, Sep. 2, 2008, 3 pages. |
International Application Serial No. PCT/US2007/069195, Written Opinion mailed, Sep. 2, 2008, 5 pages. |
International Application Serial No. PCT/US2007/069195, International Preliminary Report on Patentability Issued, Nov. 18, 2008, 6 pages. |
International Application Serial No. PCT/US2007/074475, International Search Report mailed, Jun. 30, 2008, 1 page. |
International Application Serial No. PCT/US2007/074475, Written Opinion mailed, Jun. 30, 2008, 3 pages. |
International Application Serial No. PCT/US2007/074475, International Preliminary Report on Patentability Issued, Jan. 27, 2009, 4 pages. |
Pilgrim, Mark, “How to consume RSS safely”, available at http://diveintomark.org/archives/2003/06/12/how—to—consume—rss—safely, (accessed on Jul. 5, 2011), 2003, pp. 1-28. |
Ponnekanti, Shankar R. et al., “SWORD: A Developer Toolkit for Web Service Composition”, available at http://www2002.org/CDROM/alternate/786/, (accessed online Jul. 5, 2011), 2002, pp. 1-22. |
Roszkowski, et al., “A Distributed Architecture for Resource Discovery Using Metadata”, D-Lib Magazine, Jun. 1998, pp. 1-11. |
Scheier, Bruce, “Applied Cryptography: Protocols, Algorithms, and Source Code in C”, John Wiley & Sons, Inc., Second Edition, 1996, pp. 584-587. |
Sourceforge.Net, “Urchin RSS Aggregator, version 0.92”, available at http://urchin.sourceforge.net/index.html, accessed online Jun. 2, 2009, 2004, pp. 1-5. |
Stal, Michael, “Web Services: Beyond Component Based Computing Seeking a Better Solution to the Application Integration Problem”, Communications of the ACM, vol. 45, No. 10, Oct. 2002, pp. 71-76. |
W3C, “RDF Primer”, W3C Recommendation, available at http://www.w3.org/TR/rdf-syntax/, (accessed online Jul. 5, 2011), Feb. 10, 2004, pp. 1-73. |
W3C, “XML Encryption Syntax and Processing”, W3C Recommendation, available at: http://www.w3.org/TR/xmlenc-core/, (accessed online Nov. 5, 2012), Dec. 10, 2002, 46. |
Winer, Dave, “OPML(Outline Processor Markup Language) About Page”, available at http://ww.opml.org/about, (accessed online Jul. 5, 2011), Nov. 7, 2000, 2 pages. |
Wood, Charlie, “Adoption Salesforce.com via RSS”, http://globelogger.com/item.php?id=294, (accessed online Jun. 25, 2007), Feb. 6, 2005, 3 pages. |
Wood, Charlie, “Adoption Using RSS to Track Sales Leads”, http://globelogger.com/item.php?id=285, (accessed online Jun. 25, 2007), Jan. 28, 2005, 3 pages. |
Wood, Charlie, “Blog of Subscribe Your Calendar to Your Salesforce.com Events”, http://globelogger.com/item.php?id=660, (accessed online Jun. 25, 2007), May 12, 2006, 2 pages. |
Wood, Charlie, “Introducing Spanning Feed Builder for AppExchange”, http://www.spanningpartners.com/2006/07/introducing—spa.html, (accessed online Jun. 25, 2007), Jul. 2, 2006, 3 pages. |
Wood, Charlie, “Introducing Spanning Salesforce 2.0”, http://www.spanningpartners.com/2005/08/introducing—spa.html, (accessed online Aug. 21, 2007), Aug. 28, 2005, 4 pages. |
Wood, Charlie, “Latest Spanning Salesforce Release”, http://www.spanningpartners.com/2006/04/latest—spanning.html, (accessed online Jun. 25, 2007), Apr. 5, 2006, 3 pages. |
Wood, Charlie, “New Spanning Salesforce Feeds and Features”, http://globelogger.com/item.php?id=606, (accessed online Jun. 25, 2007), Mar. 14, 2006, 2 pages. |
Wood, Charlie, “On Creating Real Business Value with RSS”, http://www.spanningpartners.com/2006/02/on—creatinq—rea.html, (accessed online Jun. 25, 2007), Feb. 23, 2006, 3 pages. |
Wood, Charlie, “RSS-Enabled AppExchange Applications”, http://www.spanningpartners.com/2006/05/spanning—partne—1.html, (accessed online Jun. 25, 2007), May 30, 2006, 3 pages. |
Wood, Charlie, “Spanning Salesforce 2.0 is Live”, http://globelogger.com/item.php?id=466, (accessed online Jun. 25, 2007), Aug. 28, 2005, 2 pages. |
Wood, Charlie, “Spanning Salesforce Goes Public”, http://globeloggercom/item.php?id=285, (accessed online Jun. 25, 2007), Jul. 17, 2005, 3 pages. |
Wood, Charlie, “Subscribe Your Calendar to Your Salesforce.com Events”, http://www.spanningpartners.com/2006/05/subscribe—your.html, (accessed online Jul. 12, 2011), May 12, 2006, 1 page. |
Number | Date | Country | |
---|---|---|---|
20120150813 A1 | Jun 2012 | US |
Number | Date | Country | |
---|---|---|---|
61082802 | Jul 2008 | US | |
60973480 | Sep 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12233266 | Sep 2008 | US |
Child | 13396966 | US |