US20020032675A1 - Search channels between queries for use in an information retrieval system - Google Patents
Search channels between queries for use in an information retrieval system Download PDFInfo
- Publication number
- US20020032675A1 US20020032675A1 US09/218,434 US21843498A US2002032675A1 US 20020032675 A1 US20020032675 A1 US 20020032675A1 US 21843498 A US21843498 A US 21843498A US 2002032675 A1 US2002032675 A1 US 2002032675A1
- Authority
- US
- United States
- Prior art keywords
- query
- results
- attribute
- user
- information retrieval
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000009466 transformation Effects 0.000 claims abstract description 32
- 238000000034 method Methods 0.000 claims description 22
- 230000010354 integration Effects 0.000 claims description 10
- 238000012546 transfer Methods 0.000 claims description 3
- 230000001131 transforming effect Effects 0.000 claims 1
- 238000000844 transformation Methods 0.000 abstract description 13
- 150000001875 compounds Chemical class 0.000 description 8
- 230000015654 memory Effects 0.000 description 4
- 238000001914 filtration Methods 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9532—Query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9538—Presentation of query results
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99943—Generating database or data structure, e.g. via user interface
Definitions
- the present invention is related to the searching of information repositories such as databases, and in particular to a facility for generating and building dynamic queries.
- An exemplary information retrieval architecture is described in the article entitled “System Components For Embedded Information Retrieval From Multiple Disparate Information Sources”, Ramana B. Rao, Daniel M. Russell, and Jock D. Mackinlay, Proceedings of 1993 ACM Symposium on User Interface Software and Technology, Atlanta, Ga., November 1993 ACM SIGGRAPH and SIGCHI.
- the architecture incorporates an intermediary server which mediates access requests between an information access client (i.e. the user) and various information sources.
- an information access client i.e. the user
- the user only needs to interface with the information access client in order to retrieve the information from multiple information sources.
- query generation Another difficulty in information retrieval is query generation.
- the process of generating an effective query is often an iterative one. In such a process, the results of one query are then used to formulate a second, often more narrow query. This occurs because the first query may have been too broad in scope and had returned large amounts of unusable or redundant data.
- known query systems are “static” in nature. In other words, in order for query to begin, all of the query terms must be fixed. However, because of the vast amount of information constantly becoming available on the World Wide Web, it would be desirable to make queries more dynamic in nature. Further, since the information repositories are disparate, portions of the query may be running in parallel. Thus, it would be desirable to be able to specify and execute a query that is dynamic in nature so that search terms are not static.
- the present invention is related to the searching of network accessible distributed databases, such as those found on the Internet. Drag and drop search channels are described which enable the combining of queries.
- a query is visually displayed on the display of a computer system as a query window.
- the query window will provide for the input of attributes that define the nature and scope of intended query.
- the attributes may be logically combined to create the intended query.
- Each attribute specification is represented as an object.
- a user selects an attribute, wherein a graphical representation of the attribute is created.
- the user then “drags and drops” the graphical representation of the attribute to an attribute specification area of the second query.
- a channel of communication between two queries is established which can have the properties described below.
- the Drag and Drop Search channels provide Computational Transformations.
- Computational Transformations allows for the automatic adaptation of the results associated with a channel to the query context. For example, a query attribute may returns results in the English language, whereas the target query would like results in the French language. Thus, a computational transformation could be automatically invoked to translate the results from English to French.
- the Drag and Drop Search channels further provides for the ability to create compound queries dynamically and incrementally.
- query attributes must be defined before they are executed. However this is not always the most effective way to create compound queries. Often the inspection of query results leads to new ideas on how to use them. But, using already obtained query results as input for another query is only possible, if queries can be combined dynamically.
- the present invention permits queries to be modified dynamically, even while the query is currently running.
- the Drag and Drop Search channels further provide breakpoints so that search results may be operated on and manually filtered by the user.
- FIG. 1 is a block diagram illustrating the components of and process flow for an information retrieval system of the currently preferred embodiment of the present invention.
- FIGS. 2 and 3 illustrate simple and complex query windows as may be utilized in the currently preferred embodiment of the present invention.
- FIGS. 4 and 5 illustrate simple and complex result windows as may be utilized in the currently preferred embodiment of the present invention.
- FIGS. 6 and 7 illustrate by way of sample screen displays, an example of the creation of channels between queries, as may be performed in the currently preferred embodiment of the present invention.
- FIG. 8 illustrates by way of a sample screen display, a user interface for specifying computational transformations or breakpoints in a channel between queries, as may be performed in the currently preferred embodiment of the present invention.
- FIG. 9 illustrates the data structure for a complex query which is used to show the channel relationship between queries, as may be used in the currently preferred embodiment of the present invention.
- FIG. 10 is an illustration of a computer-based system as may be used to implement the currently preferred embodiment of the present invention.
- the present invention is directed to an interface for query generation to and information retrieval from one or more information sources.
- the currently preferred embodiment is implemented in an information retrieval system which provides software agents that can query multiple heterogeneous databases, reconstruct information and generate customized reports.
- a description of the system is provided below, while a more comprehensive description as of the time of filing this application can be found on the World Wide Web at URL http:///www.xrce.xerox.com/research/ct/research/cbkb.html.
- the present invention builds on the system by providing a facility to build dynamic complex queries.
- a dynamic complex query is one where query attribute specification is dynamic, rather than static, so that the results (or partial results) of one query can be used as an attribute specification by another query.
- the facility is made available to a user in a very intuitive fashion using well-known drag and drop graphical user interface methods.
- the currently preferred embodiment of the present invention has implemented for use on computer based systems capable of accessing the World Web (the Web) using a suitable JavaTM enabled Web Browser.
- the various software programs utilized in the implementation are written in the well-known Java programming language.
- FIG. 1 illustrates how information requests are processed in the information retrieval system.
- a user 101 requests information through a Demand Agent, 102 .
- the Demand Agent 102 typically embodies a User Interface which is presented to a User.
- the Demand Agent 102 is a JavaTM Applet which is downloaded to User's personal computer system and is accessible using a suitably configured Web Browser (such as Netscape Navigator® having the appropriate JavaTM software capabilities).
- Demand Agents 102 will then present the information request to a Broker Agent 103 .
- the Broker Agents 103 decompose information requests into interdependent subrequests 104 .
- the requests or subrequests that cannot be further decomposed are fed into Supply Agents 105 that access electronic information repositories through search engines 106 .
- the Supply Agents 105 will typically be configured to interface using the protocols of a particular search engine 106 .
- a Supply Agent may be provided to interface and make requests to the Alta VistaTM search engine.
- the Broker Agents and Supply Agents will operate on a Server system which provides information retrieval.
- the results of the information request are received and then recomposed by the Broker Agent 103 .
- the information retrieval system will provide for advanced querying facilities for the user not provided by some information sources, so the re-composition includes further filtering of the results to enable the advanced querying facilities.
- the recomposition may further include such tasks as formatting the received information and/or ranking the results with respect to the query request.
- requests, information and results are represented via feature constraints. Requests do not need to be fully defined; they may correspond to partial specifications of the requested information. Furthermore, requests that cannot be fully satisfied may still obtain results in the form of partial objects that refine the initial requests by instantiating some of its attributes or by adding new attributes, thus providing user feedback.
- Each of the various agents described above are preferably embodied as software programs, written in the Java programming language for execution on suitably configured computer based systems.
- FIG. 2 is an illustration of a query window for specifying a query.
- a domain area 201 of query window 200 provides a means for specifying one of a plurality of predetermined domains for the query.
- the query domain relates to the type of information being sought.
- a query domain may be a type of documents (e.g. books or articles) or a subject area (e.g. physics or operas). In the currently preferred embodiment, these domains are predefined and correspond to one or more information sources to which the query will be directed.
- the areas 202 - 204 provide for specifying a search pattern.
- the area 202 is for specifying a predetermined attribute (e.g. title or author).
- the area 203 is for specifying a constraint (e.g. contains or matches exactly) which is to be placed on the attribute and a specified keyword.
- the area 204 is for specifying a desired keyword(s), which may define an expression formed by keywords and Boolean operators. If the search pattern is correct, pressing the button 205 labeled “Add to the Specification” causes the pattern to be added to the current specification of the query, as indicated in specification area 206 . If the search pattern is not correct, it can be reset using a reset button 207 .
- the specification area 206 includes all the desired search patterns specified by the user.
- Buttons 208 - 211 provide for editing the specification.
- Button 208 provides for editing a selected search pattern.
- Button 209 provides means for removing a search pattern.
- Button 210 provides means for clearing the entire specification.
- Button 211 provides for cancellation of a sub-query.
- buttons 212 - 213 provide for the control of submission and cancellation of a query.
- FIG. 3 illustrates a window for performing a sub-query within a query, i.e. a complex query.
- a subquery In a complex query, a subquery generates a set of subresults The results generated are subresults in the sense that they deliver values that will be used in the query patter of the mainquery (or in general a higher level query).
- a sub-query is provided for by selecting a predetermined option in the area 203 , namely the “answer of” option. This causes the window of FIG. 3 to be displayed.
- a new Tab 301 has been included to indicate that it is a sub-query. This also enables the user to traverse between the main query and the sub-query. Note that the rest of the sub-query window is similar to the main query.
- FIGS. 4 and 5 illustrate summary and detail views of the result window from a search.
- a summary view shows a list of all the hits and some overall summary information such as the number of hits.
- FIG. 5 all information fields relating to a particular “hit” are displayed.
- a body area 501 shows the textual content of the document.
- Information area 502 provides various information such as date, URL location, information source, size and title. In this view, traversal through the list of hits is provided previous 503 and next 504 buttons provided within the window.
- Drag-and-Drop Channel Between two queries amounts to an instruction to pass answers, returned for an attribute field of the source query, as input values for an attribute field in the target query. In one respect, this is conceptually analogous to the relationship between a query and a sub-query. However, the Drag and Drop Channel of the present invention, provides further functionality.
- the Drag-and-Drop Channels provide:
- breakpoints for user intervention into the search process which allow the user to filter the values passed along the Drag-and-Drop Channels.
- Living links between queries allow the user to construct compound queries dynamically and incrementally.
- the user can introduce Drag-and-Drop Channels between queries not only a priori, but also a posteriori with respect to launching the involved queries.
- Drag-and-Drop Channel is introduced a posteriori, the already present results are immediately forwarded to the target query. In any case, all the results arriving after introduction of the Drag-and-Drop Channel are forwarded as they arrive.
- Computational Transformations provide for the automatic adaptation of the dragged-and-dropped attribute values to the query context. Passing the values from the source attribute of the Drag-and-Drop Channel to its target attribute is not always immediately possible. Problems arise, e.g. if the source and target attributes do not have the same type, arity or unit, or if the general context of the linked queries is different. Then computational transformations are necessary to enable the value passing between the queries. Below are examples of computational transformations:
- the values to drop can be automatically calculated, e.g. multiply by 1000 to transform 1 km into 1 000 m, or divide by 60 to transform 1 minute into ⁇ fraction (1/60) ⁇ h.
- the transformations can also be determined by other characteristics of the linked queries, such as their language. If for each query the language is defined (or can be inferred by language guessing for example), and two queries in different languages are linked, then the transformation consists for example in translating the values from the language of the source query to the language of the target query.
- a manner of performing such cross-lingual information retrieval is described in a co-pending U.S. Patent Application entitled: “System For Providing Cross-Lingual Information Retrieval”, Ser. No. Not Yet Assigned.
- Drag-and-Drop Channels constitute possible breakpoints for user intervention into the search process.
- the user does not want to automatically pass all the values found for the source attribute of the Drag-and-Drop Channel to its target attribute. Instead, the user wants to control this process and to filter the values manually. Therefore a Drag-and-Drop Channel can be automatic or user-controlled. The user can specify for each Drag-and-Drop Channel if the values shall pass automatically of if the user wants to filter them.
- Drag-and-Drop Channels as user filtering points extends also the functionality of a Drag-and-Drop Channel introduced a posteriori: before establishing the Drag-and-Drop Channel by dragging the source attribute onto the target attribute, the user might want to suppress some inadequate results or attribute values. This corresponds to a posteriori filtering. In consequence the afterwards established Drag-and-Drop Channel is a user-controlled one.
- FIGS. 6 - 7 are illustrative screen displays indicating how channels between queries are created.
- the “author” attribute 611 of query 1 601 has been linked to query 4 604 .
- the author attribute 612 of query 2 602 is also to be linked as an attribute of query 4 .
- the author attribute has been selected and is being moved via a drag and drop user interface operation.
- FIG. 7 illustrates the results wherein query 4 604 now also contains the results of the author attribute 612 of query 2 602 are included as an attribute of query 4 604
- FIG. 8 is an illustrative screen display showing an interface for specifying operational characteristics of a channel between queries. Referring to
- FIG. 8 assuming that the channel with query 2 has been selected and a user interface action, such as a double mouse click, has been performed to cause a pop-up control window 800 be displayed.
- This pop-up control window is used to select the various control features for a channel.
- a first selection area 801 has check boxes 801 and 802 which permits one to select between automatic or user controlled transfer of attribute query results. This is the manner in which breakpoints can be introduced in the target query (in this case query 4 ).
- a second selection area 806 has a check box 804 that is used to specify if it is desirable to automatically transform the attribute results to be in the target query context.
- the transformation is automatically identified 805 based on the source and target query context (e.g. query 2 presents retrieves Author information in List format, whereas query 4 retrieves Author information in single name format).
- query 2 presents retrieves Author information in List format
- query 4 retrieves Author information in single name format.
- FIGS. 6 - 8 would typically be presented to a user through a Demand Agent, as illustrated in FIG. 1.
- FIG. 9 is an example of a data structure for a complex query showing the relationship of channels between queries. It should be noted that a simple query would typically have a structure found in one of the sub-queries described in FIG. 9.
- lines 901 - 905 define the parts of the query. In this case, three (3) sub-queries are defined along with two (2) computational transformations.
- the definition of query 1 begins at line 906 and ends at line 916 . From these lines it is shown that Query 1 has a domain of “computer science”, a query attribute wherein the title contains the string “database systems” and a query attribute of author which is filled in by the query.
- a computational transformation of type “nameExtraction”, is performed on the content of the author attribute and stored in a location indicated as “A 11 ” (lines 911 - 916 ).
- query 2 begins at line 917 .
- the domain of query 2 is “computer science” and the title should have the word “constraints” in it.
- the author attribute is subject to the same computational transformation as found in query 1 Lines 922 - 926 ).
- query 3 begins on line 927 .
- the domain is “computer science” and the author attribute contains the results of the author attributes of queries 1 and 2 . This is the channel established between query 3 and each of queries 1 and 2 .
- FIG. 9 typically, the data structure of FIG. 9 would be interpreted by a broker agent as illustrated in FIG. 1.
- the computer-based system 10 may embody a user system upon which a demand agent executes and the user interface presented to a user, or it may be server system wherein the various broker and supply agents would execute.
- the computer-based system is comprised of a plurality of components coupled via a bus 1001 .
- the bus 1001 illustrated here is simplified in order not to obscure the present invention.
- the bus 1001 may consist of a plurality of parallel buses (e.g. address, data and status buses) as well as a hierarchy of buses (e.g. a processor bus, a local bus and an I/O bus).
- the computer system is further comprised of a processor 1002 for executing instructions provided via bus 1001 from Internal memory 1003 (note that the Internal memory 1003 is typically a combination of Random Access or Read Only Memories).
- the processor 1002 and Internal memory ROM 1003 may be discrete components or a single integrated device such as an Application Specification Integrated Circuit (ASIC) chip which has been designed to embody the functional features of the present invention.
- ASIC Application Specification Integrated Circuit
- keyboard 1004 for entering alphanumeric input
- external storage 1005 for storing data
- cursor control device 1006 for manipulating a cursor
- display 1007 for displaying visual output.
- the keyboard 1004 would typically be a standard QWERTY keyboard but may also be telephone like keypad.
- the external storage 1005 may be fixed or removable magnetic or optical disk drive.
- the cursor control device 1006 will typically have a button or switch associated with it to which the performance of certain functions can be programmed.
- the network connection 1008 would be used to receive and/or transmit data containing a bit-mapped representation of a medium.
Abstract
Description
- The present invention is related to the searching of information repositories such as databases, and in particular to a facility for generating and building dynamic queries.
- Every day more information becomes available electronically over networks. Far from growing linearly, this growth is driven by numerous factors like the increasing accessibility to more media of information, the growing power of computers and networks, and the ever more data-intensive applications we are working with.
- This gold mine of data however suffers from a lack of structure and consistency: the Web is unstructured and uncontrolled by nature, whereas structured databases use a widening variety of formats, either standardized or proprietary.
- When accessing heterogeneous legacy databases on Intranets or while querying multiple information sources on the Internet, the end-user only wants to have a simple and straightforward point of access.
- With classical tools, finding the right information to suit each user's needs is now the problem, for anything but the easiest of searches. The user must master different protocols; different database access methods; different document formats; and then use the information from one search to manually drive another. Thus, there is a need for information retrieval systems and approaches for easily interfacing into multiple information sources.
- An exemplary information retrieval architecture is described in the article entitled “System Components For Embedded Information Retrieval From Multiple Disparate Information Sources”, Ramana B. Rao, Daniel M. Russell, and Jock D. Mackinlay, Proceedings of 1993 ACM Symposium on User Interface Software and Technology, Atlanta, Ga., November 1993 ACM SIGGRAPH and SIGCHI. The architecture incorporates an intermediary server which mediates access requests between an information access client (i.e. the user) and various information sources. Thus, the user only needs to interface with the information access client in order to retrieve the information from multiple information sources.
- Another difficulty in information retrieval is query generation. The process of generating an effective query is often an iterative one. In such a process, the results of one query are then used to formulate a second, often more narrow query. This occurs because the first query may have been too broad in scope and had returned large amounts of unusable or redundant data. Moreover, known query systems are “static” in nature. In other words, in order for query to begin, all of the query terms must be fixed. However, because of the vast amount of information constantly becoming available on the World Wide Web, it would be desirable to make queries more dynamic in nature. Further, since the information repositories are disparate, portions of the query may be running in parallel. Thus, it would be desirable to be able to specify and execute a query that is dynamic in nature so that search terms are not static.
- The present invention is related to the searching of network accessible distributed databases, such as those found on the Internet. Drag and drop search channels are described which enable the combining of queries. A query is visually displayed on the display of a computer system as a query window. The query window will provide for the input of attributes that define the nature and scope of intended query. The attributes may be logically combined to create the intended query. Each attribute specification is represented as an object. In order to include an attribute of a first query as an attribute of a second query, a user selects an attribute, wherein a graphical representation of the attribute is created. The user then “drags and drops” the graphical representation of the attribute to an attribute specification area of the second query. Thus, a channel of communication between two queries is established which can have the properties described below.
- The Drag and Drop Search channels provide Computational Transformations. Computational Transformations allows for the automatic adaptation of the results associated with a channel to the query context. For example, a query attribute may returns results in the English language, whereas the target query would like results in the French language. Thus, a computational transformation could be automatically invoked to translate the results from English to French.
- The Drag and Drop Search channels further provides for the ability to create compound queries dynamically and incrementally. Heretofore, query attributes must be defined before they are executed. However this is not always the most effective way to create compound queries. Often the inspection of query results leads to new ideas on how to use them. But, using already obtained query results as input for another query is only possible, if queries can be combined dynamically. The present invention permits queries to be modified dynamically, even while the query is currently running.
- The Drag and Drop Search channels further provide breakpoints so that search results may be operated on and manually filtered by the user.
- FIG. 1 is a block diagram illustrating the components of and process flow for an information retrieval system of the currently preferred embodiment of the present invention.
- FIGS. 2 and 3 illustrate simple and complex query windows as may be utilized in the currently preferred embodiment of the present invention.
- FIGS. 4 and 5 illustrate simple and complex result windows as may be utilized in the currently preferred embodiment of the present invention.
- FIGS. 6 and 7 illustrate by way of sample screen displays, an example of the creation of channels between queries, as may be performed in the currently preferred embodiment of the present invention.
- FIG. 8 illustrates by way of a sample screen display, a user interface for specifying computational transformations or breakpoints in a channel between queries, as may be performed in the currently preferred embodiment of the present invention.
- FIG. 9 illustrates the data structure for a complex query which is used to show the channel relationship between queries, as may be used in the currently preferred embodiment of the present invention.
- FIG. 10 is an illustration of a computer-based system as may be used to implement the currently preferred embodiment of the present invention.
- A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has not objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
- The present invention is directed to an interface for query generation to and information retrieval from one or more information sources. The currently preferred embodiment is implemented in an information retrieval system which provides software agents that can query multiple heterogeneous databases, reconstruct information and generate customized reports. A description of the system is provided below, while a more comprehensive description as of the time of filing this application can be found on the World Wide Web at URL http:///www.xrce.xerox.com/research/ct/research/cbkb.html.
- The present invention builds on the system by providing a facility to build dynamic complex queries. A dynamic complex query is one where query attribute specification is dynamic, rather than static, so that the results (or partial results) of one query can be used as an attribute specification by another query. Furthermore, the facility is made available to a user in a very intuitive fashion using well-known drag and drop graphical user interface methods.
- The currently preferred embodiment of the present invention has implemented for use on computer based systems capable of accessing the World Web (the Web) using a suitable Java™ enabled Web Browser. The various software programs utilized in the implementation are written in the well-known Java programming language.
- Overview of the Information Retrieval System
- The amount of information available from electronic sources on the World Wide Web or other on-line information repositories is increasing exponentially. Tools are needed to extract relevant information from these repositories. The information retrieval system sophisticated facilities for efficient information retrieval and combination. FIG. 1 illustrates how information requests are processed in the information retrieval system. Referring to FIG. 1, a
user 101 requests information through a Demand Agent, 102. TheDemand Agent 102 typically embodies a User Interface which is presented to a User. In the currently preferred embodiment, theDemand Agent 102 is a Java™ Applet which is downloaded to User's personal computer system and is accessible using a suitably configured Web Browser (such as Netscape Navigator® having the appropriate Java™ software capabilities). -
Demand Agents 102 will then present the information request to aBroker Agent 103. TheBroker Agents 103 decompose information requests intointerdependent subrequests 104. The requests or subrequests that cannot be further decomposed are fed intoSupply Agents 105 that access electronic information repositories throughsearch engines 106. TheSupply Agents 105 will typically be configured to interface using the protocols of aparticular search engine 106. For example, a Supply Agent may be provided to interface and make requests to the Alta Vista™ search engine. In the currently preferred embodiment, the Broker Agents and Supply Agents will operate on a Server system which provides information retrieval. - The results of the information request are received and then recomposed by the
Broker Agent 103. It should be noted that the information retrieval system will provide for advanced querying facilities for the user not provided by some information sources, so the re-composition includes further filtering of the results to enable the advanced querying facilities. The recomposition may further include such tasks as formatting the received information and/or ranking the results with respect to the query request. Once the recomposition is completed, the results are returned to theDemand Agents 102 for presentation to theuser 101. - It should be noted that preferably, requests, information and results are represented via feature constraints. Requests do not need to be fully defined; they may correspond to partial specifications of the requested information. Furthermore, requests that cannot be fully satisfied may still obtain results in the form of partial objects that refine the initial requests by instantiating some of its attributes or by adding new attributes, thus providing user feedback.
- Various aspects of the information retrieval system can be found in the following PCT Publications WO 98/48359 (Oct. 29, 1998) and WO 98/48361 (Oct. 29, 1998).
- Each of the various agents described above are preferably embodied as software programs, written in the Java programming language for execution on suitably configured computer based systems.
- Information System User Interface
- FIG. 2 is an illustration of a query window for specifying a query. Referring to FIG. 2, a
domain area 201 ofquery window 200 provides a means for specifying one of a plurality of predetermined domains for the query. The query domain relates to the type of information being sought. For example, a query domain may be a type of documents (e.g. books or articles) or a subject area (e.g. physics or operas). In the currently preferred embodiment, these domains are predefined and correspond to one or more information sources to which the query will be directed. The areas 202-204 provide for specifying a search pattern. The area 202 is for specifying a predetermined attribute (e.g. title or author). Thearea 203 is for specifying a constraint (e.g. contains or matches exactly) which is to be placed on the attribute and a specified keyword. Thearea 204 is for specifying a desired keyword(s), which may define an expression formed by keywords and Boolean operators. If the search pattern is correct, pressing thebutton 205 labeled “Add to the Specification” causes the pattern to be added to the current specification of the query, as indicated inspecification area 206. If the search pattern is not correct, it can be reset using a reset button 207. Thespecification area 206 includes all the desired search patterns specified by the user. - Buttons208-211 provide for editing the specification.
Button 208 provides for editing a selected search pattern.Button 209 provides means for removing a search pattern.Button 210 provides means for clearing the entire specification. Button 211 provides for cancellation of a sub-query. - Finally, buttons212-213, respectively, provide for the control of submission and cancellation of a query. FIG. 3 illustrates a window for performing a sub-query within a query, i.e. a complex query. In a complex query, a subquery generates a set of subresults The results generated are subresults in the sense that they deliver values that will be used in the query patter of the mainquery (or in general a higher level query). A sub-query is provided for by selecting a predetermined option in the
area 203, namely the “answer of” option. This causes the window of FIG. 3 to be displayed. As can be seen in FIG. 3, anew Tab 301 has been included to indicate that it is a sub-query. This also enables the user to traverse between the main query and the sub-query. Note that the rest of the sub-query window is similar to the main query. - FIGS. 4 and 5 illustrate summary and detail views of the result window from a search. Referring to FIG. 4, a summary view shows a list of all the hits and some overall summary information such as the number of hits. In FIG. 5, all information fields relating to a particular “hit” are displayed. A
body area 501 shows the textual content of the document. Information area 502 provides various information such as date, URL location, information source, size and title. In this view, traversal through the list of hits is provided previous 503 and next 504 buttons provided within the window. - Search Channels
- Establishing a Drag-and-Drop Channel between two queries amounts to an instruction to pass answers, returned for an attribute field of the source query, as input values for an attribute field in the target query. In one respect, this is conceptually analogous to the relationship between a query and a sub-query. However, the Drag and Drop Channel of the present invention, provides further functionality. The Drag-and-Drop Channels provide:
- living links between queries which allow the user to construct compound queries dynamically and incrementally,
- computational transformations which allow the user to automatically adapt the dragged-and-dropped attribute values to the query context, and
- breakpoints for user intervention into the search process which allow the user to filter the values passed along the Drag-and-Drop Channels.
- Living Links between Queries
- Living links between queries allow the user to construct compound queries dynamically and incrementally. The user can introduce Drag-and-Drop Channels between queries not only a priori, but also a posteriori with respect to launching the involved queries.
- Usually, e.g. with Structured Query Language (SQL), the definition of compound queries must be done a priori. The user must know in advance how they will link several queries to obtain what they are searching for so the user defines all involved queries and links them before launching the whole compound query.
- But this is not always the natural way to create compound queries. Often the inspection of query results leads to new ideas on how to use them. But, using already obtained query results as input for another query is only possible, if queries can be combined dynamically. This is possible through Drag-and-Drop Channels. They can be established a posterior, when the source query is already (and continuously) running. This a posterior operation is enabled as a result of a feature provided in the information retrieval system wherein query results may be continually accumulated (i.e. query results may be continuously returned as a result of new documents being placed within the query domain).
- If the Drag-and-Drop Channel is introduced a posteriori, the already present results are immediately forwarded to the target query. In any case, all the results arriving after introduction of the Drag-and-Drop Channel are forwarded as they arrive.
- Computational Transformations
- Computational Transformations provide for the automatic adaptation of the dragged-and-dropped attribute values to the query context. Passing the values from the source attribute of the Drag-and-Drop Channel to its target attribute is not always immediately possible. Problems arise, e.g. if the source and target attributes do not have the same type, arity or unit, or if the general context of the linked queries is different. Then computational transformations are necessary to enable the value passing between the queries. Below are examples of computational transformations:
- If you drop an integer attribute on to a string attribute, you have to transform the integer values of the output attribute field to a string value for the input attribute field.
- If the arity of the linked attributes is not the same, especially if the source attribute of the Drag-and-Drop Channel contains a list of values and the target attribute expects single values, then these single values must be extracted from the list before they can be passed to the target query. E.g. if you drop an attribute whose value contains name lists (composed for example of all co-authors of found articles) on an attribute which expects single names (e.g. to search for the person's homepage), then you first have to extract the elementary (sur-)names of the authors, and pass them one-by-one to the input attribute field.
- If the units of the source and the target attribute are different, the values to drop can be automatically calculated, e.g. multiply by 1000 to transform 1 km into 1 000 m, or divide by 60 to transform 1 minute into {fraction (1/60)} h.
- The transformations can also be determined by other characteristics of the linked queries, such as their language. If for each query the language is defined (or can be inferred by language guessing for example), and two queries in different languages are linked, then the transformation consists for example in translating the values from the language of the source query to the language of the target query. A manner of performing such cross-lingual information retrieval is described in a co-pending U.S. Patent Application entitled: “System For Providing Cross-Lingual Information Retrieval”, Ser. No. Not Yet Assigned.
- If the characteristics of the source and target attributes and queries is known by the system, then these computational transformations can be automatically introduced. Otherwise they can be user defined.
- Breakpoints for User Intervention into the Search Process
- Drag-and-Drop Channels constitute possible breakpoints for user intervention into the search process. In fact, often the user does not want to automatically pass all the values found for the source attribute of the Drag-and-Drop Channel to its target attribute. Instead, the user wants to control this process and to filter the values manually. Therefore a Drag-and-Drop Channel can be automatic or user-controlled. The user can specify for each Drag-and-Drop Channel if the values shall pass automatically of if the user wants to filter them.
- This is especially useful if the query results of the source query have low precision, i.e. if many of the documents in the query result are not adequate for use as input into a subsequent query. If all inadequate values are automatically passed to the subsequent searches, the final results of the compound query would get a very low precision. Thus, making a Drag-and-Drop Channel user-controlled, allows the user to improve the precision of the final results. Furthermore it improves the efficiency of the search process as it also reduces the number of queries generated by the passed values.
- The usage of Drag-and-Drop Channels as user filtering points extends also the functionality of a Drag-and-Drop Channel introduced a posteriori: before establishing the Drag-and-Drop Channel by dragging the source attribute onto the target attribute, the user might want to suppress some inadequate results or attribute values. This corresponds to a posteriori filtering. In consequence the afterwards established Drag-and-Drop Channel is a user-controlled one.
- FIGS.6-7 are illustrative screen displays indicating how channels between queries are created. Referring to FIG. 6, the “author” attribute 611 of
query 1 601 has been linked to query 4 604. Here, the author attribute 612 ofquery 2 602 is also to be linked as an attribute ofquery 4. As indicated by the highlighting, the author attribute has been selected and is being moved via a drag and drop user interface operation. FIG. 7 illustrates the results whereinquery 4 604 now also contains the results of the author attribute 612 ofquery 2 602 are included as an attribute ofquery 4 604 FIG. 8 is an illustrative screen display showing an interface for specifying operational characteristics of a channel between queries. Referring to - FIG. 8, assuming that the channel with
query 2 has been selected and a user interface action, such as a double mouse click, has been performed to cause a pop-up control window 800 be displayed. This pop-up control window is used to select the various control features for a channel. So for example, a first selection area 801 hascheck boxes 801 and 802 which permits one to select between automatic or user controlled transfer of attribute query results. This is the manner in which breakpoints can be introduced in the target query (in this case query 4). - A second selection area806 has a check box 804 that is used to specify if it is desirable to automatically transform the attribute results to be in the target query context. Here, the transformation is automatically identified 805 based on the source and target query context (
e.g. query 2 presents retrieves Author information in List format, whereasquery 4 retrieves Author information in single name format). The above is but one way of how operational characteristics of a link can be specified and is not meant to be limit the scope of the present invention. Other ways could be utilized, such as through a control checkbox associated with a channel, and would not cause departure from the spirit and scope of the present invention. - It should be noted that the user interfaces illustrated in FIGS.6-8 would typically be presented to a user through a Demand Agent, as illustrated in FIG. 1.
- Query Data Structure
- FIG. 9 is an example of a data structure for a complex query showing the relationship of channels between queries. It should be noted that a simple query would typically have a structure found in one of the sub-queries described in FIG. 9. In any event, referring to FIG. 9, lines901-905 define the parts of the query. In this case, three (3) sub-queries are defined along with two (2) computational transformations. The definition of
query 1 begins atline 906 and ends atline 916. From these lines it is shown thatQuery 1 has a domain of “computer science”, a query attribute wherein the title contains the string “database systems” and a query attribute of author which is filled in by the query. A computational transformation of type “nameExtraction”, is performed on the content of the author attribute and stored in a location indicated as “A11” (lines 911-916). - The definition of
query 2 begins atline 917. The domain ofquery 2 is “computer science” and the title should have the word “constraints” in it. Inquery 2, the author attribute is subject to the same computational transformation as found inquery 1 Lines 922-926). - Finally, the
query 3 begins online 927. Inquery 3, the domain is “computer science” and the author attribute contains the results of the author attributes ofqueries query 3 and each ofqueries - Typically, the data structure of FIG. 9 would be interpreted by a broker agent as illustrated in FIG. 1.
- Computer Based System of the Currently Preferred Embodiment of The Present Invention
- The computer-based system on which the currently preferred embodiment of the present invention may be implemented is described with reference to FIG. 10. For example, the computer based system10 may embody a user system upon which a demand agent executes and the user interface presented to a user, or it may be server system wherein the various broker and supply agents would execute. In any event, referring to FIG. 10, the computer-based system is comprised of a plurality of components coupled via a bus 1001. The bus 1001 illustrated here is simplified in order not to obscure the present invention. The bus 1001 may consist of a plurality of parallel buses (e.g. address, data and status buses) as well as a hierarchy of buses (e.g. a processor bus, a local bus and an I/O bus). In any event, the computer system is further comprised of a
processor 1002 for executing instructions provided via bus 1001 from Internal memory 1003 (note that theInternal memory 1003 is typically a combination of Random Access or Read Only Memories). Theprocessor 1002 andInternal memory ROM 1003 may be discrete components or a single integrated device such as an Application Specification Integrated Circuit (ASIC) chip which has been designed to embody the functional features of the present invention. - Also coupled to the bus1001 are a
keyboard 1004 for entering alphanumeric input,external storage 1005 for storing data, acursor control device 1006 for manipulating a cursor, and adisplay 1007 for displaying visual output. Thekeyboard 1004 would typically be a standard QWERTY keyboard but may also be telephone like keypad. Theexternal storage 1005 may be fixed or removable magnetic or optical disk drive. Thecursor control device 1006 will typically have a button or switch associated with it to which the performance of certain functions can be programmed. Thenetwork connection 1008 would be used to receive and/or transmit data containing a bit-mapped representation of a medium. - Thus, search channels between queries for use in an information retrieval system has been disclosed. While the present invention is described with respect to a preferred embodiment, it would be apparent to one skilled in the art to practice the present invention with other configurations of information retrieval systems. Such alternate embodiments would not cause departure from the spirit and scope of the present invention.
Claims (18)
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/218,434 US6434546B1 (en) | 1998-12-22 | 1998-12-22 | System and method for transferring attribute values between search queries in an information retrieval system |
JP35396299A JP4677071B2 (en) | 1998-12-22 | 1999-12-14 | Information retrieval system and method |
EP99310164A EP1014282A1 (en) | 1998-12-22 | 1999-12-17 | Search channels between queries for use in an information retrieval system |
JP2010204468A JP2011023030A (en) | 1998-12-22 | 2010-09-13 | Information retrieval system and method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/218,434 US6434546B1 (en) | 1998-12-22 | 1998-12-22 | System and method for transferring attribute values between search queries in an information retrieval system |
Publications (2)
Publication Number | Publication Date |
---|---|
US20020032675A1 true US20020032675A1 (en) | 2002-03-14 |
US6434546B1 US6434546B1 (en) | 2002-08-13 |
Family
ID=22815107
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/218,434 Expired - Lifetime US6434546B1 (en) | 1998-12-22 | 1998-12-22 | System and method for transferring attribute values between search queries in an information retrieval system |
Country Status (3)
Country | Link |
---|---|
US (1) | US6434546B1 (en) |
EP (1) | EP1014282A1 (en) |
JP (2) | JP4677071B2 (en) |
Cited By (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020023091A1 (en) * | 2000-06-23 | 2002-02-21 | Silberberg David P. | Architecture for distributed database information access |
US20040015483A1 (en) * | 2002-07-16 | 2004-01-22 | Hogan Ronald W. | Document tracking system and method |
US20040107290A1 (en) * | 1999-05-28 | 2004-06-03 | International Business Machines Corporation | Reduction and optimization of information processing systems |
US20060050865A1 (en) * | 2004-09-07 | 2006-03-09 | Sbc Knowledge Ventures, Lp | System and method for adapting the level of instructional detail provided through a user interface |
US20060100998A1 (en) * | 2004-10-27 | 2006-05-11 | Edwards Gregory W | Method and system to combine keyword and natural language search results |
US20060235860A1 (en) * | 2005-04-18 | 2006-10-19 | Microsoft Corporation | System and method for obtaining user feedback for relevance tuning |
US20070157129A1 (en) * | 2006-01-05 | 2007-07-05 | International Business Machines Corporation | System and method for search queries and results preview using drag and drop interface |
US20070219979A1 (en) * | 2006-03-15 | 2007-09-20 | Searete Llc, A Limited Liability Corporation Of The State Of Delaware | Live search with use restriction |
US8280030B2 (en) | 2005-06-03 | 2012-10-02 | At&T Intellectual Property I, Lp | Call routing system and method of using the same |
US8751232B2 (en) | 2004-08-12 | 2014-06-10 | At&T Intellectual Property I, L.P. | System and method for targeted tuning of a speech recognition system |
US8824659B2 (en) | 2005-01-10 | 2014-09-02 | At&T Intellectual Property I, L.P. | System and method for speech-enabled call routing |
US9112972B2 (en) | 2004-12-06 | 2015-08-18 | Interactions Llc | System and method for processing speech |
US20170076004A1 (en) * | 2011-01-28 | 2017-03-16 | The Dun & Bradstreet Corporation | Inventory data access layer |
US9990420B2 (en) | 2011-11-02 | 2018-06-05 | Entit Software Llc | Method of searching and generating a relevant search string |
US20190166069A1 (en) * | 2017-11-27 | 2019-05-30 | Baidu Usa Llc | System and method for visually understanding and programming conversational agents of electronic devices |
US10310960B2 (en) * | 2016-06-02 | 2019-06-04 | International Business Machines Corporation | Debugging for SQL statement |
US10754885B2 (en) * | 2017-11-27 | 2020-08-25 | Baidu Usa Llc | System and method for visually searching and debugging conversational agents of electronic devices |
Families Citing this family (37)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
AUPQ163899A0 (en) * | 1999-07-14 | 1999-08-05 | Canon Kabushiki Kaisha | Aromated document production from a search environment |
US7007275B1 (en) * | 1999-10-21 | 2006-02-28 | Unisys Corporation | Method and apparatus for automatic execution of concatenated methods across multiple heterogeneous data sources |
US20020087546A1 (en) * | 2000-01-31 | 2002-07-04 | Michael Slater | Apparatus, methods, and systems for digital photo management |
US7415662B2 (en) * | 2000-01-31 | 2008-08-19 | Adobe Systems Incorporated | Digital media management apparatus and methods |
US6745178B1 (en) * | 2000-04-28 | 2004-06-01 | International Business Machines Corporation | Internet based method for facilitating networking among persons with similar interests and for facilitating collaborative searching for information |
JP2001350855A (en) * | 2000-06-09 | 2001-12-21 | Nec Corp | On-demand service developing device and service providing system |
US7386792B1 (en) | 2001-03-07 | 2008-06-10 | Thomas Layne Bascom | System and method for collecting, storing, managing and providing categorized information related to a document object |
US7158971B1 (en) | 2001-03-07 | 2007-01-02 | Thomas Layne Bascom | Method for searching document objects on a network |
US7296032B1 (en) | 2001-05-17 | 2007-11-13 | Fotiva, Inc. | Digital media organization and access |
MXPA03011976A (en) * | 2001-06-22 | 2005-07-01 | Nervana Inc | System and method for knowledge retrieval, management, delivery and presentation. |
US7584425B2 (en) * | 2001-07-31 | 2009-09-01 | Verizon Business Global Llc | Systems and methods for generating reports |
US7752266B2 (en) | 2001-10-11 | 2010-07-06 | Ebay Inc. | System and method to facilitate translation of communications between entities over a network |
US8078505B2 (en) | 2002-06-10 | 2011-12-13 | Ebay Inc. | Method and system for automatically updating a seller application utilized in a network-based transaction facility |
US7475160B1 (en) * | 2002-08-26 | 2009-01-06 | Network Appliance Inc. | Method and apparatus for a rumor based protocol for distributed state synchronization between request routing servers |
US20040138988A1 (en) * | 2002-12-20 | 2004-07-15 | Bart Munro | Method to facilitate a search of a database utilizing multiple search criteria |
GB2409916A (en) * | 2003-07-04 | 2005-07-13 | Intellidos Ltd | Joining query templates to query collated data |
US7636733B1 (en) | 2003-10-03 | 2009-12-22 | Adobe Systems Incorporated | Time-based image management |
US7334195B2 (en) * | 2003-10-14 | 2008-02-19 | Microsoft Corporation | System and process for presenting search results in a histogram/cluster format |
EP1589451A1 (en) * | 2004-04-21 | 2005-10-26 | Sap Ag | A data processing method, system and computer program for providing a payment |
US9189568B2 (en) | 2004-04-23 | 2015-11-17 | Ebay Inc. | Method and system to display and search in a language independent manner |
US8626730B2 (en) | 2004-06-28 | 2014-01-07 | Sap Ag | Data processing methods, systems and computer programs for providing a payment using a web service |
US7936861B2 (en) | 2004-07-23 | 2011-05-03 | At&T Intellectual Property I, L.P. | Announcement system and method of use |
US20060048053A1 (en) | 2004-08-30 | 2006-03-02 | Xerox Corporation | Individually personalized customized report document system |
US20060048042A1 (en) * | 2004-08-30 | 2006-03-02 | Xerox Corporation | Individually personalized customized report document system with user feedback |
US7657005B2 (en) | 2004-11-02 | 2010-02-02 | At&T Intellectual Property I, L.P. | System and method for identifying telephone callers |
US7864942B2 (en) | 2004-12-06 | 2011-01-04 | At&T Intellectual Property I, L.P. | System and method for routing calls |
US7450698B2 (en) | 2005-01-14 | 2008-11-11 | At&T Intellectual Property 1, L.P. | System and method of utilizing a hybrid semantic model for speech recognition |
US7627096B2 (en) | 2005-01-14 | 2009-12-01 | At&T Intellectual Property I, L.P. | System and method for independently recognizing and selecting actions and objects in a speech recognition system |
US7627109B2 (en) | 2005-02-04 | 2009-12-01 | At&T Intellectual Property I, Lp | Call center system for multiple transaction selections |
US20070043803A1 (en) * | 2005-07-29 | 2007-02-22 | Microsoft Corporation | Automatic specification of semantic services in response to declarative queries of sensor networks |
JP5057546B2 (en) | 2006-03-24 | 2012-10-24 | キヤノン株式会社 | Document search apparatus and document search method |
US8639782B2 (en) | 2006-08-23 | 2014-01-28 | Ebay, Inc. | Method and system for sharing metadata between interfaces |
US20080294673A1 (en) * | 2007-05-25 | 2008-11-27 | Microsoft Corporation | Data transfer and storage based on meta-data |
JP5230358B2 (en) * | 2008-10-31 | 2013-07-10 | キヤノン株式会社 | Information search device, information search method, program, and storage medium |
US8606804B2 (en) * | 2009-08-05 | 2013-12-10 | Microsoft Corporation | Runtime-defined dynamic queries |
JP5645614B2 (en) * | 2010-11-12 | 2014-12-24 | キヤノン株式会社 | Document management apparatus, document management apparatus control method, and computer program |
EP3323099A1 (en) * | 2015-07-16 | 2018-05-23 | B2Cloud | Method for processing a recommendation request and recommendation engine |
Family Cites Families (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5047918A (en) * | 1985-12-31 | 1991-09-10 | Tektronix, Inc. | File management system |
US4849898A (en) * | 1988-05-18 | 1989-07-18 | Management Information Technologies, Inc. | Method and apparatus to identify the relation of meaning between words in text expressions |
JPH087675B2 (en) * | 1991-11-12 | 1996-01-29 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Graphical inquiry system |
US5625554A (en) * | 1992-07-20 | 1997-04-29 | Xerox Corporation | Finite-state transduction of related word forms for text indexing and retrieval |
JPH06231181A (en) * | 1993-02-05 | 1994-08-19 | Hokkaido Nippon Denki Software Kk | Distributed database control system |
JPH0756957A (en) * | 1993-08-03 | 1995-03-03 | Xerox Corp | Method for provision of information to user |
JPH07296009A (en) * | 1994-03-01 | 1995-11-10 | Mitsubishi Electric Corp | Data base integration/retrieval device |
US5799309A (en) * | 1994-12-29 | 1998-08-25 | International Business Machines Corporation | Generating an optimized set of relational queries fetching data in an object-relational database |
US5721908A (en) | 1995-06-07 | 1998-02-24 | International Business Machines Corporation | Computer network for WWW server data access over internet |
JPH096794A (en) * | 1995-06-14 | 1997-01-10 | Fuji Xerox Co Ltd | Data retrieval instructing device |
AU1122997A (en) * | 1995-11-07 | 1997-06-11 | Cadis, Inc. | Search engine for remote object oriented database management system |
US5862325A (en) * | 1996-02-29 | 1999-01-19 | Intermind Corporation | Computer-based communication system and method using metadata defining a control structure |
US5963944A (en) | 1996-12-30 | 1999-10-05 | Intel Corporation | System and method for distributing and indexing computerized documents using independent agents |
JPH10232877A (en) * | 1997-02-18 | 1998-09-02 | Dainippon Printing Co Ltd | Collation device for character string and data base system |
KR19980076495A (en) * | 1997-04-10 | 1998-11-16 | 윤종용 | HDTV / NTSC receiver and receiving signal selection method |
GB9708175D0 (en) | 1997-04-23 | 1997-06-11 | Xerox Corp | Feature constraint based document information retrieval and distribution |
GB9708172D0 (en) | 1997-04-23 | 1997-06-11 | Xerox Corp | Knowledge brokers using signed feature constraints |
-
1998
- 1998-12-22 US US09/218,434 patent/US6434546B1/en not_active Expired - Lifetime
-
1999
- 1999-12-14 JP JP35396299A patent/JP4677071B2/en not_active Expired - Fee Related
- 1999-12-17 EP EP99310164A patent/EP1014282A1/en not_active Ceased
-
2010
- 2010-09-13 JP JP2010204468A patent/JP2011023030A/en active Pending
Cited By (31)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040107290A1 (en) * | 1999-05-28 | 2004-06-03 | International Business Machines Corporation | Reduction and optimization of information processing systems |
US6996625B2 (en) * | 1999-05-28 | 2006-02-07 | International Business Machines Corporation | Reduction and optiminization of operational query expressions applied to information spaces between nodes in a publish/subscribe system |
US20020023091A1 (en) * | 2000-06-23 | 2002-02-21 | Silberberg David P. | Architecture for distributed database information access |
US6957214B2 (en) | 2000-06-23 | 2005-10-18 | The Johns Hopkins University | Architecture for distributed database information access |
US20040015483A1 (en) * | 2002-07-16 | 2004-01-22 | Hogan Ronald W. | Document tracking system and method |
US9368111B2 (en) | 2004-08-12 | 2016-06-14 | Interactions Llc | System and method for targeted tuning of a speech recognition system |
US8751232B2 (en) | 2004-08-12 | 2014-06-10 | At&T Intellectual Property I, L.P. | System and method for targeted tuning of a speech recognition system |
US20060050865A1 (en) * | 2004-09-07 | 2006-03-09 | Sbc Knowledge Ventures, Lp | System and method for adapting the level of instructional detail provided through a user interface |
US20060100998A1 (en) * | 2004-10-27 | 2006-05-11 | Edwards Gregory W | Method and system to combine keyword and natural language search results |
US7668889B2 (en) * | 2004-10-27 | 2010-02-23 | At&T Intellectual Property I, Lp | Method and system to combine keyword and natural language search results |
US9047377B2 (en) | 2004-10-27 | 2015-06-02 | At&T Intellectual Property I, L.P. | Method and system to combine keyword and natural language search results |
US8667005B2 (en) | 2004-10-27 | 2014-03-04 | At&T Intellectual Property I, L.P. | Method and system to combine keyword and natural language search results |
US9350862B2 (en) | 2004-12-06 | 2016-05-24 | Interactions Llc | System and method for processing speech |
US9112972B2 (en) | 2004-12-06 | 2015-08-18 | Interactions Llc | System and method for processing speech |
US9088652B2 (en) | 2005-01-10 | 2015-07-21 | At&T Intellectual Property I, L.P. | System and method for speech-enabled call routing |
US8824659B2 (en) | 2005-01-10 | 2014-09-02 | At&T Intellectual Property I, L.P. | System and method for speech-enabled call routing |
US20060235860A1 (en) * | 2005-04-18 | 2006-10-19 | Microsoft Corporation | System and method for obtaining user feedback for relevance tuning |
US7596558B2 (en) * | 2005-04-18 | 2009-09-29 | Microsoft Corporation | System and method for obtaining user feedback for relevance tuning |
US8619966B2 (en) | 2005-06-03 | 2013-12-31 | At&T Intellectual Property I, L.P. | Call routing system and method of using the same |
US8280030B2 (en) | 2005-06-03 | 2012-10-02 | At&T Intellectual Property I, Lp | Call routing system and method of using the same |
US20070157129A1 (en) * | 2006-01-05 | 2007-07-05 | International Business Machines Corporation | System and method for search queries and results preview using drag and drop interface |
US8131747B2 (en) * | 2006-03-15 | 2012-03-06 | The Invention Science Fund I, Llc | Live search with use restriction |
US20070219979A1 (en) * | 2006-03-15 | 2007-09-20 | Searete Llc, A Limited Liability Corporation Of The State Of Delaware | Live search with use restriction |
US20170076004A1 (en) * | 2011-01-28 | 2017-03-16 | The Dun & Bradstreet Corporation | Inventory data access layer |
US10762147B2 (en) * | 2011-01-28 | 2020-09-01 | D&B Business Information Solutions, U.C. | Inventory data access layer |
US9990420B2 (en) | 2011-11-02 | 2018-06-05 | Entit Software Llc | Method of searching and generating a relevant search string |
US10310960B2 (en) * | 2016-06-02 | 2019-06-04 | International Business Machines Corporation | Debugging for SQL statement |
US10579500B2 (en) | 2016-06-02 | 2020-03-03 | International Business Machines Corporation | Debugging for SQL statement |
US20190166069A1 (en) * | 2017-11-27 | 2019-05-30 | Baidu Usa Llc | System and method for visually understanding and programming conversational agents of electronic devices |
US10666583B2 (en) * | 2017-11-27 | 2020-05-26 | Baidu Usa Llc | System and method for visually understanding and programming conversational agents of electronic devices |
US10754885B2 (en) * | 2017-11-27 | 2020-08-25 | Baidu Usa Llc | System and method for visually searching and debugging conversational agents of electronic devices |
Also Published As
Publication number | Publication date |
---|---|
US6434546B1 (en) | 2002-08-13 |
JP2011023030A (en) | 2011-02-03 |
JP2000194729A (en) | 2000-07-14 |
JP4677071B2 (en) | 2011-04-27 |
EP1014282A1 (en) | 2000-06-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6434546B1 (en) | System and method for transferring attribute values between search queries in an information retrieval system | |
US6381598B1 (en) | System for providing cross-lingual information retrieval | |
US8543936B2 (en) | Graphical user interface for building Boolean queries and viewing search results | |
Jones | Graphical query specification and dynamic result previews for a digital library | |
US6594669B2 (en) | Method for querying a database in which a query statement is issued to a database management system for which data types can be defined | |
US7428705B2 (en) | Web map tool | |
Hammer et al. | Semistructured data: The TSIMMIS experience | |
US5768578A (en) | User interface for information retrieval system | |
Karger et al. | Haystack: A customizable general-purpose information management tool for end users of semistructured data | |
US8700595B2 (en) | Methods and systems for automated searching | |
US6338059B1 (en) | Hyperlinked search interface for distributed database | |
US6918096B2 (en) | Method and apparatus for displaying a network of thoughts from a thought's perspective | |
Burkowski | Retrieval activities in a database consisting of heterogeneous collections of structured text | |
US20030061209A1 (en) | Computer user interface tool for navigation of data stored in directed graphs | |
EP0774722A2 (en) | Information retrieval system | |
US20040215612A1 (en) | Semi-boolean arrangement, method, and system for specifying and selecting data objects to be retrieved from a collection | |
US20020065857A1 (en) | System and method for analysis and clustering of documents for search engine | |
US20020049705A1 (en) | Method for creating content oriented databases and content files | |
US20040162815A1 (en) | Adapting business objects for searches and searching adapted business objects | |
Liu et al. | Visualizing document classification: A search aid for the digital library | |
Wolber et al. | Exposing document context in the personal web | |
Leune et al. | Memo | |
Alonso et al. | A model for visualizing large answers in WWW retrieval | |
Jones | VQuery: a graphical user interface for Boolean query Specification and dynamic result preview | |
Trzaska et al. | Structural Knowledge Graph Navigator for the Icons Prototype. |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: XEROX CORPORATION, CONNECTICUT Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WILLIAMOWSKI, JUTTA;PARESCHI, REMO;BORGHOFF, UWE M.;REEL/FRAME:009945/0579;SIGNING DATES FROM 19990309 TO 19990413 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: BANK ONE, NA, AS ADMINISTRATIVE AGENT, ILLINOIS Free format text: SECURITY AGREEMENT;ASSIGNOR:XEROX CORPORATION;REEL/FRAME:013111/0001 Effective date: 20020621 Owner name: BANK ONE, NA, AS ADMINISTRATIVE AGENT,ILLINOIS Free format text: SECURITY AGREEMENT;ASSIGNOR:XEROX CORPORATION;REEL/FRAME:013111/0001 Effective date: 20020621 |
|
AS | Assignment |
Owner name: JPMORGAN CHASE BANK, AS COLLATERAL AGENT, TEXAS Free format text: SECURITY AGREEMENT;ASSIGNOR:XEROX CORPORATION;REEL/FRAME:015134/0476 Effective date: 20030625 Owner name: JPMORGAN CHASE BANK, AS COLLATERAL AGENT,TEXAS Free format text: SECURITY AGREEMENT;ASSIGNOR:XEROX CORPORATION;REEL/FRAME:015134/0476 Effective date: 20030625 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
FPAY | Fee payment |
Year of fee payment: 12 |
|
AS | Assignment |
Owner name: XEROX CORPORATION, NEW YORK Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:BANK ONE, NA;REEL/FRAME:032118/0959 Effective date: 20030625 |
|
AS | Assignment |
Owner name: XEROX CORPORATION, NEW YORK Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:JPMORGAN CHASE BANK, N.A.;REEL/FRAME:032205/0622 Effective date: 20061204 |
|
AS | Assignment |
Owner name: MAJANDRO LLC, TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:XEROX CORPORATION;REEL/FRAME:053258/0949 Effective date: 20200413 |
|
AS | Assignment |
Owner name: XEROX CORPORATION, CONNECTICUT Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:JPMORGAN CHASE BANK, N.A. AS SUCCESSOR-IN-INTEREST ADMINISTRATIVE AGENT AND COLLATERAL AGENT TO BANK ONE, N.A.;REEL/FRAME:061388/0388 Effective date: 20220822 Owner name: XEROX CORPORATION, CONNECTICUT Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:JPMORGAN CHASE BANK, N.A. AS SUCCESSOR-IN-INTEREST ADMINISTRATIVE AGENT AND COLLATERAL AGENT TO JPMORGAN CHASE BANK;REEL/FRAME:066728/0193 Effective date: 20220822 |