Method, system, and computer-readable medium for communicating results to a data query in a computer network

Abstract
A method and system are provided for communicating results to a query for data in a computer network utilizing a graphical user interface. A framework on a client computer registers the client computer with an information service provider. Then the framework receives the query for data from the user interface. The framework creates a query packet including the query for data. A remote computer in communication with the framework resident on the local computing device receives the query packet from the framework and sends a response packet to the framework. After receiving the response packet, the framework determines whether the response packet contains a result to the data query. If the response packet contains a result to the data query, the framework formats the result for presentation to a user via the user interface on the local computing device. If the response packet, does not contain a result to the data query the framework may send a status message, indicating that no results were returned for the data query, to the user interface. The data in the query packet and the response packet may be formatted in a data format such as Extensible Markup Language (“XML”).
Description
TECHNICAL FIELD

The present invention relates generally to the communication of results to a query for data in a computer network. More particularly, the present invention relates to formatting a query for data utilizing a standard data format and communicating the results to the query in a format for presentation to a user in a graphical user interface in a computer network.


BACKGROUND OF THE INVENTION

Historically, computer systems and databases have contained data in incompatible formats. As the organizations utilizing these systems and databases became more automated and computerized, the need to share data over computer networks, such as the Internet, became more and more prevalent. Due to this need, standard formats for the sharing of data were developed.


One such standard format developed is Extensible Markup Language (“XML”). XML is a very hierarchical data format, which includes a multitude of data structures having parent-child relationships. Due to the advent of this standard data format, many computer users have converted the aforementioned databases to the standard XML data format. The XML format also allows computer users to tailor their data to specific documents using schemas. Schemas provide mechanisms to define and describe the structure, content, and to some extent semantics of XML documents. For example, a financial services company may have its own schema defining the structure and content its XML documents.


With the ease of availability of the personal computer, many users are utilizing computer networks to access research and reference information. For example, personal computer users may utilize a computer network to access financial information such as stock quotes or information typically found in reference books such as a dictionary or thesaurus by typing in a query into the computer. Currently, accessing such information is a multi-step process. For example, a user wishing to insert financial information in a word processing document would open a browser, retrieve the desired information, and copy and paste that information directly into the document. Furthermore, often these users find it desirable to receive results to a query for information in a “rich” data format for presentation to the user via a graphical user interface. For example, the results of a financial information query may include a graph showing changes in the price of a stock over the last thirty days. However, computer networks communicating using XML are unable to present “rich” data, as XML is a data exchange format.


It is with respect to these considerations and others that the present invention has been made.


SUMMARY OF THE INVENTION

In accordance with the present invention, the above and other problems are solved by a method and apparatus for formatting a query for data utilizing a standard data format and communicating the results to the query in a format for presentation to a user in a graphical user interface in a computer network.


In accordance with one aspect of the present invention, a method is provided for communicating results to a query for data in a computer network utilizing a graphical user interface resident on a client computer in the computer network. First, the query for data is received from the user interface. A graphical user interface on the client computer is utilized to generate the query. Then, a query packet is created containing the query for data. The query packet is created in accordance with a data format. Next, the query packet is sent to a remote computing device in the computer network. The remote computing device may be an information service provider. Next, a response packet adhering to the data format is received from the remote computing device. Then a determination is made as to whether the response packet contains a result to the data query. If the response packet contains a result to the data query the result is formatted for presentation to a user via the user interface on the local computing device. If the response packet does not contain a result to the data query, a status message indicating that no results were returned for the data query may be sent to the user interface. The data format utilized in the query and response packets may be Extensible Markup Language (“XML”).


Prior to sending the query packet, the local computing device may be registered with the remote computing device in the computer network. To register the local computing device, a registration request is received from the user interface. Then a registration request packet containing the request is created in XML. Finally, the registration packet is sent to the remote computing device and a registration response packet containing a response to the registration request is received from the remote computing device.


In accordance with another aspect of the present invention, a system is provided for communicating results to a query for data in a computer network. The system includes user interface resident on a local computing device in the computer network for creating the query for data. The system further includes a framework, resident on the local computing device and in communication with the user interface. The framework is operative to receive the query for data from the user interface and create a query packet containing the query for data. The query packet is created in accordance with a data format which may be XML. The system further includes a remote computer in communication with the framework resident on the local computing device. The remote computer is operative to receive the query packet from the framework and send a response packet to the framework. The response packet is created in accordance with a data format which may be XML. After receiving the response packet, the framework determines whether the response packet contains a result to the data query. If the response packet contains a result to the data query, the framework formats the result for presentation to a user via the user interface on the local computing device. The format for presentation of the result to the user in the user interface may include presenting the result as a document, content, or in a form. If the response packet, does not contain a result to the data query the framework may send a status message, indicating that no results were returned for the data query, to the user interface.


The framework may also be operative to receive a registration request from the user interface, create a registration request packet, send the registration request packet to the remote computing device, and receive a registration response packet from the remote computing device to register the local computing device with the remote computing device. The registration response packet contains a response to the registration request. The registration request packet and the registration response packet may be formatted in XML.


Aspects of the invention may be implemented as a computer process, a computing system, or as an article of manufacture such as a computer program product or computer-readable medium. The computer program product may be a computer storage media readable by a computer system and encoding a computer program of instructions for executing a computer process. The computer program product may also be a propagated signal on a carrier readable by a computing system and encoding a computer program of instructions for executing a computer process.


These and various other features as well as advantages, which characterize the present invention, will be apparent from a reading of the following detailed description and a review of the associated drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates an example of a suitable computing environment in which the present invention may be implemented.



FIG. 2 shows an illustrative computing arrangement which may be utilized by the application program for communicating data from the personal computer system to the Information Service Provider in the computer network illustrated in FIG. 1 according to one embodiment of the present invention.



FIG. 3 illustrates logical operations for registering a computer system with an information service provider in the computing environment described in FIGS. 1-2 according to one embodiment of the present invention



FIG. 4 illustrate logical operations for generating a query and presenting results to the query in the computing environment described in FIGS. 1-2 according to one embodiment of the present invention.



FIG. 5A shows an illustrative screenshot of a graphical user interface for entering and displaying the results to a data query according to one embodiment of the present invention.



FIG. 5B shows an illustrative screenshot of a graphical user interface for entering and displaying the results to a data query according to one embodiment of the present invention.



FIG. 5C shows an illustrative screenshot of a graphical user interface for entering and displaying the results to a data query according to one embodiment of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

The present invention is directed to a method and apparatus for formatting a query for data utilizing a standard data format and communicating the results to the query in a format for presentation to a user in a graphical user interface in a computer network. In one embodiment, the present invention is incorporated into the “OFFICE” suite of application programs that is marketed by Microsoft Corporation of Redmond Wash.


In the following detailed description, references are made to the accompanying drawings that form a part hereof, and in which are shown by way of illustration specific embodiments or examples. Referring now to the drawings, in which like numerals represent like elements through the several figures, aspects of the present invention and the illustrative operating environment will be described.



FIG. 1 illustrates an example of a suitable computing environment 10 in which the present invention may be implemented. The computing system 10 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 10 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the illustrative operating environment 10.


The present invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices.


Those skilled in the art will recognize that the invention may be implemented in combination with various other program modules (not shown). Generally, program modules include routines, programs, components, data structures, etc., that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with computer system configurations other than the one shown, that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.


Referring now to FIG. 1, an illustrative operating environment 10 for implementing the invention includes a conventional personal computer system 20, including a processing unit 21, a system memory 22, and a system bus 23 that couples the system memory to the processing unit 21. The system memory 22 includes read only memory (ROM) 24 and random access memory (RAM) 25. A basic input/output system (BIOS) 26, containing the basic routines that help to transfer information between elements within the personal computer system 20, such as during start-up, is stored in ROM 24. The personal computer system 20 further includes a hard disk drive 27, a magnetic disk drive 28, e.g., to read from or write to a removable disk 29, and an optical disk drive 30, e.g., for reading a CD-ROM disk 31 or to read from or write to other optical media. The hard disk drive 27, magnetic disk drive 28, and optical disk drive 30 are connected to the system bus 23 by a hard disk drive interface 32, a magnetic disk drive interface 33, and an optical drive interface 34, respectively. The drives and their associated computer-readable media provide nonvolatile storage for the personal computer system 20. Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and a CD-ROM disk, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, and the like, may also be used in the exemplary operating environment.


A number of program modules may be stored in the drives and RAM 25, including an operating system 35, application program 36 (which may include word processor and spreadsheet programs), other program modules 37, and program data 38. A user may enter commands and information into the personal computer system 20 through a keyboard 40 and pointing device, such as a mouse 42. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 21 through a serial port interface 46 that is coupled to the system bus, but may be connected by other interfaces, such as a game port or a universal serial bus (USB). A monitor 47 or other type of display device is also connected to the system bus 23 via an interface, such as a video adapter 48. In addition to the monitor, personal computers typically include other peripheral output devices (not shown), such as speakers or printers. It should be understood that the application program 36 may utilize a graphical user interface (“GUI”) allowing a user to input commands and information as well as display information to the user via the monitor 47.


The personal computer system 20 may operate in a networked environment using logical connections to a remote computer, such as an Information Service Provider 60. The remote computer may be a server, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the personal computer system 20, although only a memory storage device 50 has been illustrated as being associated with the Information Service Provider 60 in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 51 and a wide area network (WAN) 52. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.


When used in a LAN networking environment, the personal computer system 20 is connected to the LAN 51 through a network interface 53. When used in a WAN networking environment, the personal computer system 20 typically includes a modem 54 or other means for establishing communications over the WAN 52, such as the Internet. The modem 54, which may be internal or external, is connected to the system bus 23 via the serial port interface 46. In a networked environment, program modules depicted relative to the personal computer system 20, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 1 illustrates a remote application program 85 residing on the memory storage device 50. It will be appreciated that the network connections shown are illustrative and other means of establishing a communications link between the computers may be used. It will further be appreciated that the invention could equivalently be implemented on host or server computer systems other than personal computer systems. The Information Service Provider 60 may, for example, contain research and reference information for providing results to data queries made from the application programs 36.



FIG. 2 shows an illustrative computing arrangement 200 which may be utilized by the application program 36 for communicating data from the personal computer system 20 to the Information Service Provider 60 in the computer network illustrated in FIG. 1 above. As briefly described above, the application program 36 includes a user interface 48 for allowing a user to input commands as well as receive information for display to a user on the personal computer system 20. As shown in FIG. 2, the user interface is utilized to register the personal computer system 20 with the Information Service Provider 60 by sending a registration request 208 and receiving a registration response 206. The user interface 48 is further utilized to send a query 204 to the Information Service Provider 60 and display a response 202 from the Information Service Provider 60 to the query 204. The registration request 208 and the query 204 are communicated from the user interface 48 to the Information Service Provider 60 through a framework 49. Similarly, the registration response 206 and the response 202 are communicated from the Information Service Provider 60 to the user interface 48 through the framework 49.


The framework 49 is a software component that executes in the application program 36 residing in the personal computer system 20. The framework 49 formats the registration request 208 in a registration packet 205 and formats the query 204 in a query packet 215 for transmission to the Information Service Provider 60. The framework 49 also receives a registration response packet 210 and a query packet 205 from the Information Service Provider 60.


According to one embodiment of the present invention, the data in the packets 205, 210, 215, and 220 are formatted in Extensible Markup Language (“XML”). As is understood by those skilled in the art, XML is a standard format for communicating data. In the XML data format, a schema is used to provide XML data with a set of grammatical and data type rules governing the types and structure of data that may be communicated. For example, the data in the query packet 215 may have an attached or associated schema such as “search.query.xsd” for providing an allowable set of XML elements such as a <query> element, <format> element, <context> element, and so on. The schema includes the rules governing the order with which those elements may be applied to the query data and specific rules associated with individual elements applied to the query data. For example, a schema attached or associated with the query packet 215 data may prescribe that data associated with a given element, for example a <query> element, must include a <context> element and a <query text> element.


After the registration response packet 210 and the query packet 205 have been received by the framework 49, the framework 49 implements code for transforming the packet data from XML to a format for display in the user interface 48 of the personal computer system 20. It will be understood by those skilled in the art that as a data exchange formal, XML does not natively support the visual presentation of data unlike other languages such as Hypertext Markup Language (“HTML”). As a result, XML data must be “transformed” into a layout for presentation to a user. One technique for transforming XML data is through the use of Extensible Stylesheet Language (XSL) which includes a formatting language. For example, using XSL, an XML document may be formatted into a well-formed HTML file. It should be understood that the present invention is not limited to presenting XML data in HTML and that other techniques may also be utilized to render XML data. Such techniques will be understood by those skilled in the art.


All users of documents annotated with XML structure according to a given schema may utilize the data contained within the XML structure without regard to the overall type and structure of the data. For example, if the query packet, described above, is transmitted to Information Service Provider 60, the provider may develop software applications for parsing the query packet to locate specific keywords within the query packet for use by the provider to find results to the query. Using the schema, the provider will know that the data associated with the XML elements have been prepared according to the schema governing the data. Accordingly, the provider may develop a software application or a file such as an Extensible Stylesheet Language Transformation (XSLT) file, for locating query packet elements and for extracting the data associated therewith.


As understood by those familiar with the Extensible Markup Language, XML namespaces provide a method for qualifying elements and attribute names used in XML documents by associating those elements and attribute names with namespaces identified by uniform resources identifier (URI) references. An XML namespace is a collection of names, identified by a URI reference which are used in XML data files as element types and attribute names. A single XML data file may contain elements and attributes that are defined for and used by multiple software modules.



FIGS. 3-4 illustrate logical operations for registering a computer system with an information service provider, generating a query, and presenting results to the query in the computing environment described in FIGS. 1-2 above, in accordance with various embodiments of the present invention. The logical operations of the various embodiments of the present invention are implemented (1) as a sequence of computer implemented acts or program modules running on a computing system and/or (2) as interconnected machine logic circuits or circuit modules within the computing system. The implementation is a matter of choice dependent on the performance requirements of the computing system implementing the invention. Accordingly, the logical operations making up the embodiments of the present invention described herein are referred to variously as operations, structural devices, acts or modules. It will be recognized by one skilled in the art that these operations, structural devices, acts and modules may be implemented in software, in firmware, in special purpose digital logic, and any combination thereof without deviating from the spirit and scope of the present invention as recited within the claims attached hereto.


Referring now to FIG. 3, the logical operations 300 begin at operation 305 where a user inputs a registration request via the user interface 48 which is then received by the framework 49 in the personal computer system 20. At operation 310, the framework 49 formats the registration request as XML and creates the registration request packet 205 including the registration request for transmission to the Information Service Provider 60. The framework 49 formats the registration request according to a registration request schema (i.e., “Search.Registration.Request”) which may be attached to or associated with the registration request in the packet. The Information Service Provider 60 will then use the registration request schema to properly read and interpret the registration request. The contents of an illustrative registration request packet formatted according to a schema is shown below in Table 1.









TABLE 1





Illustrative registration request packet















<?xml version=“1.0” encoding=“utf-8” ?>


 <RegistrationRequest revision=“1”


   xmlns=“urn:Microsoft.Search.Registration.Request”>


  <SupportedFormats>


   <Format revision=“1”>urn:Microsoft.Search.Response.Document:


   Document</Format>


   <Format


    revision=“1”>urn:Microsoft.Search.Response.Content:


    Content</Format>


   <Format


    revision=“1”>urn:Microsoft.Search.Response.Form:


    Form</Format>


  </SupportedFormats>


  <SystemInformation>


   <SkuLanguage>en-us</SkuLanguage>


   <LanguagePack>en-us</LanguagePack>


   <LanguagePack>de-de</LanguagePack>


   <LanguagePack>ja-jp</LanguagePack>


   <InterfaceLanguage>en-us</InterfaceLanguage>


   <Location>US</Location>


  </SystemInformation>


 </RegistrationRequest>









As shown in Table 1, the registration request packet includes a namespace specifying that the registration request adheres to the “Microsoft.Search.Registration.Request” schema. The packet also includes namespaces specifying the format of supported search responses (i.e., the search response may include a document, content, or a form).


Returning now to FIG. 3 the logical operations 300 continue from operation 310 to operation 315 where the framework 49 sends the registration request packet 205 over the network interface 53 to the Information Service Provider 60 which processes the registration request and creates the registration response packet 210 according to a registration response schema. The registration response schema may include, for example, a URI identifying the Information Service Provider 60. From operation 315, the logical operations continue at operation 320 where the Information Service Provider 60 transmits the registration response packet 210 over the network interface 53 to the framework 49 which then uses information contained within the registration response packet 210 to register the personal computer system 20 with the Information Service Provider 60 at operation 325. The actual registration may be accomplished by creating registry entries in the application 36 for the service provider.


According to one embodiment of the present invention, a user may register the personal computer 20 with the Information Service Provider 60 using a URL. In this embodiment, users are provided with the URL of an information service provider which is entered into the user interface 48 to register the service provider. Those skilled in the art will appreciate that a Simple Object Access Protocol (SOAP) function may be utilized at the service provider to register the user's computer. In an alternative embodiment of the present invention, a custom install application may be used to register the personal computer 20.


In some computing environments, it may be advantageous for the user to have access to multiple information services without having to individually register with each service. For example, a user writing a report about his company in a word processing application, may need access to a reference service to access articles written about the company as well as to a stock information service to access data about the company's stock performance. To this end, in an alternative embodiment of the invention, the application program 36 may be configured to communicate with a “discovery” server to facilitate the deployment of multiple information services to the user.


In this embodiment, the discovery server contains a directory listing multiple service providers. A user may be provided with a URL to the discovery server which is sent by the framework 49 to the discovery server in the registration request packet 205. After receiving the registration request packet 205, the discovery server sends a list of available information service providers in the registration response packet 210 to the framework 49. The registration response packet 210 may include a pointer or URL for each information service provider in the list. The framework 49 may then use the information contained within the registration response packet 210 to automatically register the personal computer system 20 with the available information service providers. Alternatively, the framework 49 may format the list of service providers for presentation in the user interface 48 thus enabling the user to choose which services to register. In this example, the user interface 48 may display a description of the services provided by each service provider in the list. As discussed above, the registration of the service providers may be accomplished by creating registry entries in the application 36 for each provider.


Referring now to FIG. 4, the logical operations 400 begin at operation 405 where a user inputs a data query (i.e., a string) via the user interface 48 which is then received by the framework 49 in the personal computer system 20. At operation 410, the framework 49 formats the query as XML and creates the query packet 215 including the query for transmission to the Information Service Provider 60. The framework 49 formats the query according to a query schema (i.e., “Search.Query”) which may be attached to or associated with the query in the packet 215. The Information Service Provider 60 will then process the query in the query packet 215. In one embodiment, a SOAP function in the service provider may be used to process each query received from the framework 49. The framework 49 in creating the query packet 215 calls the SOAP function and passes in a string comprised of XML data adhering to the query schema. The contents of an illustrative query packet formatted according to a query schema are shown below in Table 2.









TABLE 2





Illustrative query packet















<?xml version=“1.0” encoding=“utf-8” ?>


<QueryPacket xmlns=“urn:Microsoft.Search.Query” revision=“1”


  build=“(11.0.4916)”>


 <Query domain=“{2E8E1D19-A67C-4F2D-AC71-126CBC8E25CE}”>


   <QueryId>{45BFF740-FF31-475A-90D8-


   9C61A449A595}</QueryId>


   <OriginatorId>{349EAD21-80B8-432f-8721-


   6801FB3E8785}</OriginatorId>


  <SupportedFormats>


   <Format


    revision=“1”>urn:Microsoft.Search.Response.Document:


    Document</Format>


   <Format


    revision=“1”>urn:Microsoft.Search.Response.Content:


    Content</Format>


   <Format


    revision=“1”>urn:Microsoft.Search.Response.Form:Form


   </Format>


 </SupportedFormats>


 <Context>


   <QueryText type=“STRING” language=“en-


    us”>spy</QueryText>


   <LanguagePreference>en-us</LanguagePreference>


   <Requery/>


  </Context>


  <Range id=“result” />


  <OfficeContext xmlns=“urn:Microsoft.Search.Query.Office.Context”


   revision=“1”>


  <UserPreferences>


    <ParentalControl>false</ParentalControl>


  </UserPreferences>


  <ServiceData />


  <ApplicationContext>


    <Name>Microsoft Word</Name>


    <Version>(11.0.4916)</Version>


  </ApplicationContext>


  <QueryLanguage>en-us</QueryLanguage>


  <KeyboardLanguage>en-us</KeyboardLanguage>


  </OfficeContext>


  <Keywords xmlns=“urn:Microsoft.Search.Query.Office.Keywords”


   revision=“1”>


   <QueryText>spy</QueryText>


   <Keyword>


    <Word>spy</Word>


    <StemWord>spy</StemWord>


    <StemWord>spy's</StemWord>


    <StemWord>spies</StemWord>


    <StemWord>spies'</StemWord>


    <StemWord>spying</StemWord>


    <StemWord>spied</StemWord>


   </Keyword>


  </Keywords>


 </Query>


</QueryPacket>









As shown in Table 2, the query packet 215 includes a query for the word “spy” and declares a namespace specifying that the packet adheres to the “Microsoft.Search.Query” schema. The packet also declares the namespaces it supports within the <SupportedFormats> element. Thus, the response that corresponds to the query must contain only elements in the supported namespaces. In one embodiment of the present invention, the query packet 215 may declare additional namespaces representing embedded schemas which augment or refine the query in the query packet 215. For example, the query packet 215 may include a Keywords schema for listing keywords describing the original query string. The keywords may represent various components of the query string such as spelling alternatives and word variants to make the query more flexible. For example, as shown in Table 2 above, the query packet 215 lists the keywords “spy's,” “spies,” “spies',” “spying,” and “spied” for the original query string “spy.” The Information Service Provider 60 performs a search on the original query string as well as the list of keywords. In other embodiments of the present invention the query packet 215 may include a Context schema for providing context information that may be used by the Information Service Provider 60 to better handle the query. For example, the Context schema may include a <ParentalControl> element for filtering content returned for the query by the Information Service Provider 60.


Returning now to FIG. 4 the logical operations 400 continue from operation 410 to operation 415 where the framework 49 sends the query packet 215 over the network interface 53 to the Information Service Provider 60 which processes the query and creates the response packet 220 according to a response schema. The Information Service Provider 60 returns a response for every query in the query packet 215 in the response packet 220. It should be understood that a query packet may contain multiple queries if, for example, a particular service provider offers different domains or services which are registered with a client computer via the registration process.


The logical operations 400 continue from operation 415 to operation 420 where the framework 49 receives the response packet 220 over the network interface 53 from the Information Service Provider 60. At operation 425, the framework 49 receives the determines whether the results packet 220 contains at least one result to the data query. This determination may be made by the application program 36 parsing the XML data in the response packet for a string associated with an XML element indicating the status of the query. For example, the XML data in the response packet may include a <Status> element having a value of “SUCCESS” if the response packet includes at least one result to the query or a value indicating that the query was unsuccessful (such as an error message) if the response packet does not include a result to the query.


The application program 36 may include a parser (not shown) for parsing the XML data. It will be appreciated that the functionality of the parser may be implemented by a Document Object Model (“DOM”) parser in conjunction with a Simple API for XML (“SAX”) parser. As is known to those skilled in the art, DOM parsers are tree-based parsers which load an entire XML file into memory and SAX parsers are event-based parsers capable of reading XML nodes (elements or attributes) sequentially, one at a time. An example of a DOM parser is MSXML DOM provided by Microsoft Corporation of Redmond, Wash. In one embodiment of the invention, the DOM parser may be used to receive the XML data and the SAX parser is used to read each node.


If at operation 425 the framework 49 determines that no results were returned in the response packet 220 (e.g., the <Status> element indicates that the query was unsuccessful), then the framework 49 sends a status message indicating the at the search was unsuccessful to the user interface 48 at operation 430. If, on the other hand, at operation 425 the framework 49 determines that there is at least one result returned for the query (e.g., the <Status> element indicates that the query was a success) then the framework 49 formats each returned result for consumption by the user interface 48 for presentation to the user at operation 435. As discussed above in the discussion of FIG. 2, the XML data containing the results may be formatted for consumption by the user interface 48 by utilizing XSL to transform the XML in to HTML for presentation to a user.



FIGS. 5A-5C show illustrative screenshots of the user interface 48 which is utilized for entering a query and displaying results from the Information Service Provider 60 as discussed in detail in FIGS. 1-4 and Tables 1-2, above. As shown in FIG. 5A, the screenshot includes a query box 505 for entering the query “spy” and a service provider box 510 identifying the service provider as IBuySpy.com Product Information. As discussed above, the user may be register a client computer with the service provider by entering a URL which is then sent to the service provider in a registration request packet by the framework 49. The service provider then returns a registration response packet to the framework 49 to register the service with the client computer.


The results box 515 shows a result to the query which has been formatted for display in the user interface 48 by the framework 49. As shown in FIG. 5A, the result to the query is an advertisement for “Bullet Proof Facial Tissue.” The “Product Details” link 520, when selected by a user, produces another query to the Information Service Provider 60 the results of which are sent to the user interface 48 through the framework 49 and displayed in a table format as shown in box 530 in FIG. 5B. Similarly, the “Advanced Product Search” link 535, when selected by a user, produces yet another query to the Information Service Provider 60 the results of which are sent to the user interface 48 through the framework 49 and displayed as a form as shown in box 540 in FIG. 5C. As described above, the registration request and query schemas may declare namespaces defining the format in which the results to a query from the Information Service Provider 60 may take. Thus, as shown in FIGS. 5A-5C above, the results to a query may be presented as a document, content, or in a form.


It should be understood that the above descriptions of the elements for the schemas utilized by the registration request packet 205, the registration response packet 210, the query packet 215, and the response packet 220 are illustrative only and are not intended to suggest any limitation as to the scope of use or functionality of the invention. It will be appreciated by those skilled in the art that the above-described schemas may define other elements and/or attributes in addition to those specifically discussed above.


In view of the foregoing, it will be appreciated that the present invention provides a method and apparatus for formatting a query for data utilizing a standard data format such as XML, and communicating the results to the query in a format for presentation to a user in a graphical user interface in a computer network. While the invention has been particularly shown and described with reference to illustrative embodiments thereof, it will be understood by those skilled in the art that various other changes in the form and details may be made therein without departing from the spirit and scope of the invention.

Claims
  • 1. A method of communicating results to a search query for data in a computer network utilizing a graphical user interface resident on a local computing device, the method comprising: providing a framework in communication with the graphical user interface and the remote computing device operable to translate requests from the graphical user interface in a non-extensible markup language (XML) format to an XML format;receiving a non-XML search registration query from the graphical user interface to access the remote computing device for conducting search queries to search data associated with the remote computing device for a string of data;translating the non-XML search registration query into an XML search registration query packet according to a search registration request schema associated with the XML search registration query packet;sending the XML search registration query packet to the remote computing device;receiving an XML search registration response packet from the remote computing device;translating the XML search registration response packet into a non-XML search registration response;sending the non-XML search registration response to the graphical user interface;receiving a non-XML search query for data from the graphical user interface;translating the non-XML search query into an XML search query packet;sending the XML search query packet to the remote computing device;receiving an XML search response packet from the remote computing device;determining whether the XML search response packet contains at least one search result to the search query; andtranslating the at least one search result from the XML search response packet into a non-XML search response for presentation to a user on the local computing device via the graphical user interface when the search response packet contains the at least one search result to the search query for data.
  • 2. The method of claim 1, further comprising sending a status message to the user interface when the search response packet does not contain the at least one search result to the search query for data.
  • 3. The method of claim 2, wherein the status message comprises a notification that no results were returned for the search query for data.
  • 4. The method of claim 1, further comprising registering the local computing device with a remote computing device in the computer network.
  • 5. The method of claim 1, wherein formatting the at least one search result for presentation to a user on the local computing device via the user interface comprises transforming the at least one search result into a format for presentation to the user in the user interface.
  • 6. The method of claim 1, wherein the local computing device is a client in the computer network.
  • 7. The method of claim 1, wherein the remote computing device is an information service provider in the computer network.
  • 8. A computer-readable storage medium including a physical recording medium on which are stored computer-executable instructions for performing the method of claim 1.
  • 9. The method of claim 1, wherein the search registration request schema is associated with the XML search registration query packet on the local computing device and the remote computing device by the search registration request schema being at least one of: associated with the XML search query packet both at the local computing device and the remote computing device; andattached to the XML search query packet upon the local computing device sending the XML search registration query packet to the remote computing device.
  • 10. The method of claim 1, wherein registering the local computing device with the remote computing device includes at least one of: a registration URL identifying the remote computing device being provided to be entered into the graphical user interface of the local computing device to register the local computing device with the remote computing device;a Simple Object Access Protocol (SOAP) function being implemented on the remote computing device to register the local computing device with the remote computing device; anda custom install application being implemented to register the local computing device with the remote computing device.
  • 11. A system for communicating results to a query for data in a computer network, the system comprising: a processor;a computer readable storage medium including instructions that describe:a user interface resident on a local computing device in the computer network for creating the query for data; anda framework, resident on the local computing device and in communication with the user interface, operative to: receive a search registration request from the user interface to register for conducting search queries to search data associated with the remote computer for a search string, the query adhering to a non-extensible markup language (XML) format;translate the non-XML search registration request into an XML search registration query packet prepare according to an associated registration request schema included in the XML registration query packet;send the XML search registration query packet to the remote computer;receive an XML search registration response packet from the remote computer;translate the XML search registration response packet into a non-XML search registration response;send the non-XML search registration response to the user interface;receive a non-XML query for data from the user interface;translate the non-XML query into an XML query packet;send the XML search query packet to the remote computer to search the data associated with the remote computer for the search string; andreceive an XML response packet from the remote computer;wherein:the framework, after receiving the XML response packet, is operative to determine whether the response packet contains at least one result to the query;the framework is operative to translate at least one result from the XML response packet into a non-XML format for presentation to a user via the user interface when the response packet contains the at least one result to the query; andthe framework is operative to send a status message to the user interface when the response packet does not contain the at least one result to the query.
  • 12. The system of claim 11, wherein the framework in formatting the at least one result for presentation to a user on the local computing device via the user interface is operative to transform the at least one result into a format for presentation to the user in the user interface.
  • 13. The system of claim 12, wherein the format for presentation of the at least one result to the user in the user interface comprises a document.
  • 14. The system of claim 12, wherein the format for presentation of the at least one result to the user in the user interface comprises a form.
  • 15. The system of claim 12, wherein the format for presentation of the at least one result to the user in the user interface comprises content.
  • 16. The system of claim 11, wherein the remote computer is an information service provider in the computer network.
  • 17. The system of claim 11, wherein the system is operative to register the local computing device with the remote computing device by at least one of: a registration URL identifying the remote computing device being provided to be entered into the graphical user interface of the local computing device to register the local computing device with the remote computing device;a Simple Object Access Protocol (SOAP) function being implemented on the remote computing device to register the local computing device with the remote computing device; anda custom install application being implemented to register the local computing device with the remote computing device.
  • 18. A method of communicating results to a query for data in a computer network utilizing a graphical user interface resident on a local computing device, the method comprising: receiving a request in a non-extensible markup language (XML) format for registering the local computing device with a remote computing device in the computer network utilizing the user interface; wherein the request is a request to register for searching data associated with the remote computing device for search strings;translating the request into an XML format request packet and causing the translated request to be transmitted to the remote computing device to register the local computing device with the remote computing device by one of:a registration URL identifying the remote computing device being provided to be entered into the graphical user interface of the local computing device to register the local computing device with the remote computing device;a Simple Object Access Protocol (SOAP) function being implemented on the remote computing device to register the local computing device with the remote computing device; anda custom install application being implemented to register the local computing device with the remote computing device;upon receiving a response packet from the remote computing device, receiving the query for data from the user interface, the query adhering to a non-XML format;translating the received query from the non-XML format to an XML query packet format;sending the query packet to the remote computing device;receiving an XML response packet from the remote computing device;determining whether the response packet contains at least one result to the query;translating the at least one result in response packet into the non-XML format for presentation to a user on the local computing device via the user interface when the response packet contains the at least one result to the query; andsending a status message to the user interface when the response packet does not contain the at least one result to the query.
  • 19. The method of claim 18, wherein translating the request into an XML format request packet is performed according to a registration request schema associated with the XML registration query packet on the local computing device and the remote computing device.
  • 20. The method of claim 19, wherein the registration request schema is associated with the XML registration query packet by transmitting the registration request schema with the XML registration query packet to the remote computing device.
US Referenced Citations (403)
Number Name Date Kind
4209915 Keuleman et al. Jul 1980 A
4674065 Lange et al. Jun 1987 A
4791587 Doi Dec 1988 A
4868750 Kucera et al. Sep 1989 A
5005127 Kugimiya et al. Apr 1991 A
5020019 Ogawa May 1991 A
5128865 Sadler Jul 1992 A
5159552 van Gasteren et al. Oct 1992 A
5251130 Andrews et al. Oct 1993 A
5267155 Buchanan et al. Nov 1993 A
5287448 Nicol et al. Feb 1994 A
5297039 Kanaegami et al. Mar 1994 A
5303151 Neumann Apr 1994 A
5317546 Balch et al. May 1994 A
5337233 Hofert et al. Aug 1994 A
5341293 Vertelney et al. Aug 1994 A
5351190 Kondo Sep 1994 A
5386564 Shearer et al. Jan 1995 A
5392386 Chalas Feb 1995 A
5418902 West et al. May 1995 A
5446891 Kaplan et al. Aug 1995 A
5522089 Kikinis et al. May 1996 A
5535323 Miller et al. Jul 1996 A
5541836 Church et al. Jul 1996 A
5546521 Martinez Aug 1996 A
5581684 Dudzik et al. Dec 1996 A
5596700 Darnell et al. Jan 1997 A
5617565 Augenbraun et al. Apr 1997 A
5625783 Ezekiel et al. Apr 1997 A
5627567 Davidson May 1997 A
5627958 Potts et al. May 1997 A
5629846 Crapo May 1997 A
5634019 Koppolu et al. May 1997 A
5640560 Smith Jun 1997 A
5657259 Davis et al. Aug 1997 A
5685000 Cox Nov 1997 A
5708825 Sotomayor Jan 1998 A
5715415 Dazey et al. Feb 1998 A
5717923 Dedrick Feb 1998 A
5752022 Chiu et al. May 1998 A
5761689 Rayson et al. Jun 1998 A
5764794 Perlin Jun 1998 A
5765156 Guzak et al. Jun 1998 A
5781189 Holleran et al. Jul 1998 A
5781904 Oren et al. Jul 1998 A
5794257 Liu et al. Aug 1998 A
5799068 Kikinis et al. Aug 1998 A
5802253 Gross et al. Sep 1998 A
5802262 Van De Vanter Sep 1998 A
5802299 Logan et al. Sep 1998 A
5802530 Van Hoff Sep 1998 A
5805911 Miller Sep 1998 A
5809318 Rivette et al. Sep 1998 A
5815830 Anthony Sep 1998 A
5818447 Wolf et al. Oct 1998 A
5821931 Berquist et al. Oct 1998 A
5822539 van Hoff Oct 1998 A
5822720 Bookman et al. Oct 1998 A
5826025 Gramlich Oct 1998 A
5832100 Lawton et al. Nov 1998 A
5845077 Fawcett Dec 1998 A
5845278 Kirsch et al. Dec 1998 A
5848386 Motoyama Dec 1998 A
5855007 Jovicic et al. Dec 1998 A
5859636 Pandit Jan 1999 A
5872973 Mitchell et al. Feb 1999 A
5875443 Nielsen Feb 1999 A
5877757 Baldwin et al. Mar 1999 A
5884266 Dvorak Mar 1999 A
5892919 Nielsen Apr 1999 A
5893073 Kasso et al. Apr 1999 A
5893132 Huffman et al. Apr 1999 A
5895461 De La Huerga et al. Apr 1999 A
5896321 Miller et al. Apr 1999 A
5900004 Gipson May 1999 A
5907852 Yamada May 1999 A
5913214 Madnick et al. Jun 1999 A
5920859 Li Jul 1999 A
5924099 Guzak et al. Jul 1999 A
5933139 Feigner et al. Aug 1999 A
5933140 Strahorn et al. Aug 1999 A
5933498 Schneck et al. Aug 1999 A
5940614 Allen et al. Aug 1999 A
5944787 Zoken Aug 1999 A
5946647 Miller et al. Aug 1999 A
5948061 Merriman et al. Sep 1999 A
5956681 Yamakita Sep 1999 A
5974409 Sanu et al. Oct 1999 A
5974413 Beauregard et al. Oct 1999 A
5978754 Kumano Nov 1999 A
5983216 Kirsch et al. Nov 1999 A
5983218 Syeda-Mahmood Nov 1999 A
5987402 Murata et al. Nov 1999 A
5987480 Donohue et al. Nov 1999 A
5991719 Yazaki et al. Nov 1999 A
5995756 Hermann Nov 1999 A
6006265 Rangan et al. Dec 1999 A
6006279 Hayes Dec 1999 A
6014616 Kim Jan 2000 A
6018761 Uomini Jan 2000 A
6026388 Liddy et al. Feb 2000 A
6028605 Conrad et al. Feb 2000 A
6029135 Krasle Feb 2000 A
6029171 Smiga et al. Feb 2000 A
6031525 Perlin Feb 2000 A
6052531 Waldin et al. Apr 2000 A
6061516 Yoshikawa et al. May 2000 A
6061701 Hirai et al. May 2000 A
6064951 Park et al. May 2000 A
6067087 Krauss et al. May 2000 A
6072475 Van Ketwich Jun 2000 A
6073090 Fortune et al. Jun 2000 A
6085201 Tso Jul 2000 A
6088711 Fein et al. Jul 2000 A
6092074 Rodkin et al. Jul 2000 A
6102969 Christianson et al. Aug 2000 A
6108640 Slotznick Aug 2000 A
6108674 Murakami et al. Aug 2000 A
6112209 Gusack Aug 2000 A
6121968 Arcuri et al. Sep 2000 A
6122647 Horowitz et al. Sep 2000 A
6126306 Ando Oct 2000 A
6137911 Zhilyaev Oct 2000 A
6141005 Hetherington et al. Oct 2000 A
6151643 Cheng et al. Nov 2000 A
6154738 Call Nov 2000 A
6167469 Safai et al. Dec 2000 A
6167523 Strong Dec 2000 A
6167568 Gandel et al. Dec 2000 A
6173316 De Boor et al. Jan 2001 B1
6182029 Friedman Jan 2001 B1
6185550 Snow et al. Feb 2001 B1
6185576 McIntosh Feb 2001 B1
6199046 Heinzle et al. Mar 2001 B1
6199081 Meyerzon et al. Mar 2001 B1
6208338 Fischer et al. Mar 2001 B1
6219698 Iannucci et al. Apr 2001 B1
6246404 Feigner et al. Jun 2001 B1
6262728 Alexander Jul 2001 B1
6272074 Winner Aug 2001 B1
6272505 De La Huerga Aug 2001 B1
6282489 Bellesfield et al. Aug 2001 B1
6282537 Madnick et al. Aug 2001 B1
6291785 Koga et al. Sep 2001 B1
6292768 Chan Sep 2001 B1
6295061 Park et al. Sep 2001 B1
6297822 Feldman Oct 2001 B1
6300950 Clark et al. Oct 2001 B1
6308171 De La Huerga Oct 2001 B1
6311152 Bai et al. Oct 2001 B1
6311177 Dauerer et al. Oct 2001 B1
6311194 Sheth et al. Oct 2001 B1
6320496 Sokoler et al. Nov 2001 B1
6323853 Hedloy Nov 2001 B1
6336125 Noda et al. Jan 2002 B2
6336131 Wolfe Jan 2002 B1
6338059 Fields et al. Jan 2002 B1
6339436 Amro et al. Jan 2002 B1
6339755 Hetherington et al. Jan 2002 B1
6347398 Parthasarathy et al. Feb 2002 B1
6349295 Tedesco et al. Feb 2002 B1
6353926 Parthesarathy et al. Mar 2002 B1
6381742 Forbes et al. Apr 2002 B2
6382350 Jezewski et al. May 2002 B1
6392668 Murray May 2002 B1
6396515 Hetherington et al. May 2002 B1
6401067 Lewis et al. Jun 2002 B2
6408323 Kobayashi et al. Jun 2002 B1
6413100 Dickmeyer et al. Jul 2002 B1
6415304 Horvitz Jul 2002 B1
6421678 Smiga et al. Jul 2002 B2
6424979 Livingston et al. Jul 2002 B1
6434567 De La Huerga Aug 2002 B1
6438545 Beauregard et al. Aug 2002 B1
6441753 Montgomery Aug 2002 B1
6442545 Feldman et al. Aug 2002 B1
6442591 Haynes et al. Aug 2002 B1
6456304 Anguilo et al. Sep 2002 B1
6470091 Koga et al. Oct 2002 B2
6473069 Gerpheide Oct 2002 B1
6477510 Johnson Nov 2002 B1
6480860 Monday Nov 2002 B1
6493006 Gourdol et al. Dec 2002 B1
6498982 Bellesfield et al. Dec 2002 B2
6507839 Ponte Jan 2003 B1
6510504 Satyanarayanan Jan 2003 B2
6516321 De La Huerga Feb 2003 B1
6519557 Emens et al. Feb 2003 B1
6519603 Bays et al. Feb 2003 B1
6529899 Kraft et al. Mar 2003 B1
6546433 Matheson Apr 2003 B1
6553385 Johnson et al. Apr 2003 B2
6556972 Bakis et al. Apr 2003 B1
6556984 Zien Apr 2003 B1
6564264 Creswell et al. May 2003 B1
6571241 Nosohara May 2003 B1
6571253 Thompson et al. May 2003 B1
6601075 Huang et al. Jul 2003 B1
6615131 Rennard et al. Sep 2003 B1
6618733 White et al. Sep 2003 B1
6622140 Kantrowitz Sep 2003 B1
6623527 Hamzy Sep 2003 B1
6625581 Perkowski Sep 2003 B1
6629079 Spiegel et al. Sep 2003 B1
6629092 Berke Sep 2003 B1
6631519 Nicholson et al. Oct 2003 B1
6636880 Bera Oct 2003 B1
6654932 Bahrs et al. Nov 2003 B1
6658623 Schilit et al. Dec 2003 B1
6687485 Hopkins et al. Feb 2004 B2
6694307 Julien Feb 2004 B2
6697824 Bowman-Amuah Feb 2004 B1
6697837 Rodov Feb 2004 B1
6708189 Fitzsimons et al. Mar 2004 B1
6715144 Daynes et al. Mar 2004 B2
6717593 Jennings Apr 2004 B1
6718516 Claussen et al. Apr 2004 B1
6724403 Santoro et al. Apr 2004 B1
6728679 Strubbe et al. Apr 2004 B1
6732090 Shanahan et al. May 2004 B2
6732361 Andreoli et al. May 2004 B1
6741994 Kang et al. May 2004 B1
6742054 Upton May 2004 B1
6745177 Kepler et al. Jun 2004 B2
6745178 Emens et al. Jun 2004 B1
6745208 Berg et al. Jun 2004 B2
6795808 Strubbe et al. Sep 2004 B1
6802061 Parthasarathy et al. Oct 2004 B1
6826726 Hsing et al. Nov 2004 B2
6829631 Forman et al. Dec 2004 B1
6845499 Srivastava et al. Jan 2005 B2
6857103 Wason Feb 2005 B1
6859908 Clapper Feb 2005 B1
6868525 Szabo Mar 2005 B1
6874125 Carroll et al. Mar 2005 B1
6874143 Murray et al. Mar 2005 B1
6880129 Lee et al. Apr 2005 B1
6883137 Girardot et al. Apr 2005 B1
6889260 Hughes May 2005 B1
6901402 Corston-Oliver et al. May 2005 B1
6901403 Bata et al. May 2005 B1
6904560 Panda Jun 2005 B1
6925457 Britton et al. Aug 2005 B2
6925470 Sangudi et al. Aug 2005 B1
6934702 Faybishenko et al. Aug 2005 B2
6944857 Glaser et al. Sep 2005 B1
6948133 Haley Sep 2005 B2
6950821 Faybishenko et al. Sep 2005 B2
6950831 Haley Sep 2005 B2
6950982 Dourish Sep 2005 B1
6957385 Chan et al. Oct 2005 B2
6963867 Ford et al. Nov 2005 B2
6964010 Sharp Nov 2005 B1
6964053 Ho et al. Nov 2005 B2
6968346 Hekmatpour Nov 2005 B2
6975983 Fortescue et al. Dec 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6976209 Storisteanu et al. Dec 2005 B1
6981212 Claussen et al. Dec 2005 B1
6986104 Green et al. Jan 2006 B2
6990654 Carroll Jan 2006 B2
7003522 Reynar et al. Feb 2006 B1
7003560 Mullen et al. Feb 2006 B1
7013289 Horn et al. Mar 2006 B2
7013303 Faybishenko et al. Mar 2006 B2
7017046 Doyle et al. Mar 2006 B2
7017175 Alao et al. Mar 2006 B2
7028312 Merrick et al. Apr 2006 B1
7032174 Montero et al. Apr 2006 B2
7051076 Tsuchiya May 2006 B2
7072886 Salmenkaita et al. Jul 2006 B2
7073133 Hughes et al. Jul 2006 B2
7082392 Butler et al. Jul 2006 B1
7100115 Yennaco Aug 2006 B1
7111077 Starkovich et al. Sep 2006 B1
7113976 Watanabe Sep 2006 B2
7171415 Kan et al. Jan 2007 B2
7209915 Taboada et al. Apr 2007 B1
7216351 Maes May 2007 B1
7237190 Rollins et al. Jun 2007 B2
7281245 Reynar et al. Oct 2007 B2
7325194 Moore et al. Jan 2008 B2
7356537 Reynar et al. Apr 2008 B2
7356615 Cai et al. Apr 2008 B2
7392479 Jones et al. Jun 2008 B2
7421645 Reynar Sep 2008 B2
7475390 Berstis et al. Jan 2009 B2
20010016880 Cai et al. Aug 2001 A1
20010029605 Forbes et al. Oct 2001 A1
20010041328 Fisher Nov 2001 A1
20010042098 Gupta et al. Nov 2001 A1
20010049676 Kepler et al. Dec 2001 A1
20010056461 Kampe et al. Dec 2001 A1
20020002590 King et al. Jan 2002 A1
20020003469 Gupta Jan 2002 A1
20020003898 Wu Jan 2002 A1
20020004803 Serebrennikov Jan 2002 A1
20020023113 Hsing et al. Feb 2002 A1
20020023136 Silver et al. Feb 2002 A1
20020026450 Kuramochi Feb 2002 A1
20020029304 Reynar et al. Mar 2002 A1
20020032775 Venkataramaiah et al. Mar 2002 A1
20020035581 Reynar et al. Mar 2002 A1
20020038180 Bellesfield et al. Mar 2002 A1
20020065110 Enns et al. May 2002 A1
20020065891 Malik May 2002 A1
20020066073 Lienhard et al. May 2002 A1
20020078222 Compas et al. Jun 2002 A1
20020087591 Reynar et al. Jul 2002 A1
20020091803 Imamura et al. Jul 2002 A1
20020100036 Moshir et al. Jul 2002 A1
20020103794 Chang Aug 2002 A1
20020103829 Manning et al. Aug 2002 A1
20020104080 Woodard et al. Aug 2002 A1
20020107735 Henkin et al. Aug 2002 A1
20020110225 Cullis Aug 2002 A1
20020120685 Srivastava et al. Aug 2002 A1
20020129107 Lunghran et al. Sep 2002 A1
20020133523 Ambler et al. Sep 2002 A1
20020149601 Rajarajan et al. Oct 2002 A1
20020156774 Beauregard et al. Oct 2002 A1
20020156792 Gombocz et al. Oct 2002 A1
20020156929 Hekmatpour Oct 2002 A1
20020169802 Brewer et al. Nov 2002 A1
20020175955 Gourdol et al. Nov 2002 A1
20020178008 Reynar Nov 2002 A1
20020178182 Wang et al. Nov 2002 A1
20020184247 Jokela et al. Dec 2002 A1
20020188941 Cicciarelli et al. Dec 2002 A1
20020196281 Audleman et al. Dec 2002 A1
20020198909 Huynh et al. Dec 2002 A1
20030002391 Biggs Jan 2003 A1
20030004937 Salmenkaita et al. Jan 2003 A1
20030005411 Gerken Jan 2003 A1
20030009489 Griffin Jan 2003 A1
20030014745 Mah et al. Jan 2003 A1
20030025728 Ebbo et al. Feb 2003 A1
20030030672 Hughes et al. Feb 2003 A1
20030046316 Gergie et al. Mar 2003 A1
20030050924 Faybishenko et al. Mar 2003 A1
20030051236 Pace et al. Mar 2003 A1
20030055818 Faybishenko et al. Mar 2003 A1
20030056207 Fischer et al. Mar 2003 A1
20030081791 Erickson et al. May 2003 A1
20030083910 Sayal et al. May 2003 A1
20030084138 Tavis et al. May 2003 A1
20030088544 Kan et al. May 2003 A1
20030097318 Yu et al. May 2003 A1
20030101204 Watson May 2003 A1
20030101416 McInnes et al. May 2003 A1
20030105806 Gayle et al. Jun 2003 A1
20030106040 Rubin et al. Jun 2003 A1
20030115039 Wang Jun 2003 A1
20030121033 Peev et al. Jun 2003 A1
20030126120 Faybishenko et al. Jul 2003 A1
20030126136 Omoigui Jul 2003 A1
20030140308 Murthy et al. Jul 2003 A1
20030154144 Pokomy et al. Aug 2003 A1
20030158841 Britton et al. Aug 2003 A1
20030158851 Britton et al. Aug 2003 A1
20030172343 Leymaster et al. Sep 2003 A1
20030176995 Sukehiro Sep 2003 A1
20030182258 Sakamoto et al. Sep 2003 A1
20030182391 Leber et al. Sep 2003 A1
20030192040 Vaughan Oct 2003 A1
20030195871 Luo et al. Oct 2003 A1
20030195937 Kircher et al. Oct 2003 A1
20030220795 Araysantiparb et al. Nov 2003 A1
20030220913 Doganata et al. Nov 2003 A1
20030229593 Raley et al. Dec 2003 A1
20030233330 Raley et al. Dec 2003 A1
20030237049 Sawicki et al. Dec 2003 A1
20040001099 Reynar et al. Jan 2004 A1
20040003389 Reynar et al. Jan 2004 A1
20040006564 Lucovsky et al. Jan 2004 A1
20040006741 Radja et al. Jan 2004 A1
20040039990 Bakar et al. Feb 2004 A1
20040133846 Khoshatefeh et al. Jul 2004 A1
20040162833 Jones et al. Aug 2004 A1
20040165007 Shafron Aug 2004 A1
20040172584 Jones et al. Sep 2004 A1
20040199861 Lucovsky Oct 2004 A1
20040201867 Katano Oct 2004 A1
20040230666 Taboada et al. Nov 2004 A1
20040236717 Demartini et al. Nov 2004 A1
20040243575 Ohashi Dec 2004 A1
20040268237 Jones et al. Dec 2004 A1
20050050164 Burd et al. Mar 2005 A1
20050055330 Britton et al. Mar 2005 A1
20050094850 Nakao May 2005 A1
20050108195 Yalovsky et al. May 2005 A1
20050120313 Rudd et al. Jun 2005 A1
20050155017 Berstis et al. Jul 2005 A1
20050182617 Reynar et al. Aug 2005 A1
20050187926 Britton et al. Aug 2005 A1
20050278309 Evans et al. Dec 2005 A1
20060101005 Yang et al. May 2006 A1
20060173764 Nakajima et al. Aug 2006 A1
20070005702 Tokuda et al. Jan 2007 A1
20070073652 Taboada et al. Mar 2007 A1
20070136261 Taboada et al. Jun 2007 A1
20080021886 Wang-Aryattanwanich et al. Jan 2008 A1
20080046812 Reynar et al. Feb 2008 A1
Foreign Referenced Citations (34)
Number Date Country
0364180 Apr 1990 EP
0481784 Apr 1992 EP
0598511 May 1994 EP
0872827 Oct 1998 EP
0810520 Dec 1998 EP
1093058 Apr 2001 EP
1280068 Jan 2003 EP
1361523 Nov 2003 EP
1376392 Jan 2004 EP
1447754 Aug 2004 EP
64-0088771 Apr 1989 JP
05-174013 Jul 1993 JP
08-272662 Oct 1996 JP
09-138636 May 1997 JP
2000-222394 Aug 2000 JP
2000-231566 Aug 2000 JP
2001-014303 Jan 2001 JP
2001-125994 May 2001 JP
2001-522112 Nov 2001 JP
2002-041353 Feb 2002 JP
2002163250 Jun 2002 JP
2002-222181 Aug 2002 JP
WO 9507510 Mar 1995 WO
WO 9917240 Apr 1999 WO
WO 0054174 Sep 2000 WO
WO 0067117 Nov 2000 WO
WO 0073949 Dec 2000 WO
WO 0118687 Mar 2001 WO
WO 0137170 May 2001 WO
WO 01186390 Nov 2001 WO
WO 02099627 Jan 2002 WO
WO 0215518 Feb 2002 WO
WO 0242928 May 2002 WO
WO 2004012099 Feb 2004 WO
Related Publications (1)
Number Date Country
20040230666 A1 Nov 2004 US