Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1998-12-22
2002-08-13
Metjahic, Safet (Department: 2171)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06434546
ABSTRACT:
FIELD OF THE INVENTION
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.
BACKGROUND OF THE INVENTION
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.
SUMMARY OF THE INVENTION
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.
REFERENCES:
patent: 4849898 (1989-07-01), Adi
patent: 5047918 (1991-09-01), Schwartz et al.
patent: 5594641 (1997-01-01), Kaplan et al.
patent: 5642522 (1997-06-01), Zaenen et al.
patent: 5799309 (1998-08-01), Srinivasan
patent: 6088717 (2000-07-01), Reed et al.
patent: 6108044 (2000-08-01), Medl
patent: 6169992 (2001-01-01), Beall et al.
patent: 0 747 845 (1996-11-01), None
patent: WO 98 29792 (1998-09-01), None
patent: WO 98/48359 (1998-10-01), None
patent: WO 98/48361 (1998-10-01), None
Cousins, S.B., Reification and Affordances in a User Interface for Interacting With Heterogeneous Distributed Applications, A Dissertation submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in partial fulfillment of the requirements for the degree of Doctor of Philosophy, Aug. 1997.
Kuntz, M., Introduction of Giuku: Graphical Interactive Intelligent Utilities for Knowledgeable Users of Data Base Systems,Information Systems, vol. 18, No. 4, 1993, Great Britain, pp. 249-268.
Rao, R. et al., System Components for Embedded Information Retrieval From Multiple Disparate Information Sources,Proceedings of 1993 ACM Symposium on User Interface Software and Technology, Atlanta, GA, Nov. 1993, ACM SIGGRAPH and SIGCHI.
Young, D. et al., A Graphical Filter/Flow Representation of Boolean Queries: A Prototype Implementation and Evaluation,Tech. Report CS-TR-2905, Univ. of Maryland, Institute for Systems Research, Feb. 1993, pp. 1-31.
Chen, J.R., et al.: “Collaborative Information Agents on the World Wide Web”, ACM Conference on Digital Libraries, US, New York, NY: ACM, 1998, pp. 279-280, XP000853973 ISBN: 0-89791-965-3 * the whole document *.
Chen, L., et al.: “Multi-Agents Based Dynamic Request Placement Strategies in Distributed Information Systems”, Proc. 9thConf. on Parallel and Distributed Computing Systems, PDCS '96, vol. 2, Sep. 25-27, 1996, pp. 701-708, XP000892307, Dijon, France * p. 706, right-hand col., line 1—line 24; figure 8 *.
Borghoff Uwe M.
Pareschi Remo
Williamowski Jutta
Chen Te S
Metjahic Safet
Xerox Corporation
LandOfFree
System and method for transferring attribute values between... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for transferring attribute values between..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for transferring attribute values between... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2963130