WO2000020992A1 - Systeme d'extraction dans une base de donnees - Google Patents

Systeme d'extraction dans une base de donnees Download PDF

Info

Publication number
WO2000020992A1
WO2000020992A1 PCT/US1998/021075 US9821075W WO0020992A1 WO 2000020992 A1 WO2000020992 A1 WO 2000020992A1 US 9821075 W US9821075 W US 9821075W WO 0020992 A1 WO0020992 A1 WO 0020992A1
Authority
WO
WIPO (PCT)
Prior art keywords
alphanumeric characters
data
sets
search query
database
Prior art date
Application number
PCT/US1998/021075
Other languages
English (en)
Inventor
Arthur S. Gilbrech
Elizabeth M. Gilbrech
Original Assignee
Gilbrech Arthur S
Gilbrech Elizabeth M
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Gilbrech Arthur S, Gilbrech Elizabeth M filed Critical Gilbrech Arthur S
Priority to AU10689/99A priority Critical patent/AU1068999A/en
Priority to PCT/US1998/021075 priority patent/WO2000020992A1/fr
Publication of WO2000020992A1 publication Critical patent/WO2000020992A1/fr

Links

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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/242—Query formulation

Definitions

  • the present invention relates to data retrieval systems and more particularly to an optimized remote data retrieval system.
  • a first type is a string search system which searches data or groups of data for a particular string.
  • a second type preindexes the data, and matches a search string with an index entry, which points to the file or location of occurrence.
  • Known systems provide a number of search capabilities, including Boolean operators, truncation symbols, synonyms and fuzzy match searching, natural language input, and the like. These capabilities and systems are primarily intended to increase the power and precision of the search engine.
  • These text string search algorithms include: the Brute force algorithm; Karp-Rabin algorithm; Shift Or algorithm; Morris-Pratt algorithm; Knuth-Morris-Pratt algorithm; Simon algorithm; Colussi algorithm; Galil-Giancarlo algorithm;ENSico-Crochemore algorithm; Not So Naive algorithm; Boyer-Moore algorithm; Turbo-BM algorithm; tendico-Giancarlo algorithm; Reverse Colussi algorithm; Horspool algorithm; Quick Search algorithm; Zhu- Takaoka algorithm; Smith algorithm; Raita algorithm; Reverse Factor algorithm; Turbo Reverse Factor algorithm; Galil-Seiferas algorithm; Two Way algorithm; String Matching on Ordered Alphabets; Optimal Mismatch algorithm; and the Maximal Shift algorithm.
  • String matching consists in finding one, or more generally, all the occurrences of a string (more generally called a pattern) in a data field.
  • data may be memorized in various ways, text remains the main form to exchange information. This is particularly evident in literature or linguistics where data are composed of huge corpus and dictionaries. This applies as well to computer science where a large amount of data are stored in linear files. This is also the case, for instance, in molecular biology because biological molecules are often represented as sequences of nucleotides or amino acids.
  • String-matching algorithms for text typically operate as follows: they first align the left ends of the pattern and the text, then compare the characters of the text aligned with the characters of the pattern ⁇ this specific work is called an attempt — and after a whole match of the pattern or after a mismatch they shift the pattern to the right. They repeat the same procedure again until the right end of the pattern goes beyond the right end of the text.
  • a commonly used string searching tool is called Generalized Regular Expression Parser ("Grep”), and variants, which is a widely used tool on Unix systems.
  • the present invention provides a new and unique method of operation of a data search and retrieval system which, in one preferred embodiment, preferably comprises entering one or more sets of alphanumeric characters into a user device; preferably transmitting said alphanumeric characters to a receiving device; preferably inputting said alphanumeric characters from said receiving device into a computer database search engine; preferably searching said distinct databases for data records containing said alphanumeric characters using said computer database search engine; preferably identifying data records containing said alphanumeric characters; and preferably transmitting identified data records to said transmission device.
  • This improved and novel method provides significant enhancements and unexpected results in efficiency as compared to the default behavior of known systems, and corresponds to an efficient "memory model" employed by the user.
  • the present invention therefore allows a user to preferably input, for example, the first few letters of consecutive words known to be present in a desired data file.
  • the user being experienced and knowledgeable about the contents and structure of the data files, preferably applies this knowledge to minimize the input tasks necessary to retrieve selected data files for analysis.
  • the present invention is particularly useful where there is a significant benefit in minimizing user input tasks.
  • a small, difficult to use keyboard is employed, or the user input may be accomplished by use of a touchscreen with a virtual keyboard or through handwriting recognition.
  • Newer models may also employ voice recognition of letters and numbers. In any case, the entry of even single characters may be difficult or cumbersome.
  • this input is for defining a user query, typically the user is familiar with the database or databases which are being searched. The user may, for example, seek an appointment file with a specified individual. The user may recall the name of the individual, but not the time and date of the appointment. Accordingly, in order to retrieve this information, the user seeks to input the name of the person with whom the appointment is made.
  • the query may be defined using only a few characters. For example, the user may enter the first two letters of the person's first and last names, separated by a space. Thus, with five keystrokes or character entries, the search query may be defined.
  • a further advantage of the present invention is apparent when the user input terminal is connected over a wireless network to the database containing the files.
  • the communication bandwidth may be limited, or communication costs may be related to amount of data transmitted.
  • efficiency of query definition in terms of data transmission requirements may be advantageous.
  • the user When a user defines a search, typically the user has a data "domain" in mind. This domain consists of data having common characteristics, which may be in one or more data files. Therefore, the user advantageously selects the data domain prior to defining the particular query. In fact, in one preferred embodiment of the invention, the rules interpreting the query are preferably dependent on the data domain selected.
  • the system may also be adaptive to the user, for example through explicit modification of the interface characteristics and behavior, or through an automated or "learning” process.
  • the data retrieval application of the present invention need not be a simple text search engine, and may also be a so-called “intelligent agent” which autonomously interacts, in a complex way, with other automated systems, to perform an action or obtain information, with relatively little immediate instruction from the user.
  • One preferred embodiment of the invention preferably provides a user interface for a remote device through a wireless network, such as a cellular digital packet data (CDPD), personal communication service (PCS), or digital cellular service, on a PDA platform.
  • a wireless network such as a cellular digital packet data (CDPD), personal communication service (PCS), or digital cellular service, on a PDA platform.
  • the wireless communication may, for example, include GSM-900, GSM- 1800, GSM-1900, CDMA IS-95, TDMA IS-136, 3G systems - IMT-2000, UMTS, W-CDMA, wideband IS-95, or other wireless communications standards.
  • the system is compliant with the so-called Wireless Application Protocol (WAP, see http://www.xwap.com, WAP Architecture Draft version 0.9 (1997-09), which encompasses the Wireless Markup Language (WML, from the Wireless Application Development Committee), and subsumes the Handheld Device Markup Language (HDML, from Unwired Planet Inc.) and Tagged Text Markup Language (TTML, from Nokia Mobile Phones), and is extensible for future languages, extensions and protocols which may not be fully defined at present.
  • WAP systems may also preferably interface with translation systems for converting HTML documents to HDML or its current implementation in WAP.
  • a user preferably inputs a query according to the present invention on a PDA, which communicates through a wireless service provider to a network, such as the Internet or an intranet.
  • the service provider may also preferably host a closed network.
  • the query is forwarded to a server, which translates the query into a defined search.
  • the two simple search strings are preferably interpreted as follows: each set of alphanumeric characters is treated as the first characters of a truncated string, present in the order of the sets in the query.
  • the sets may be separated by an optional arbitrary string, which may encompass one or more words (a word being defined as a sequence of characters separated by white space).
  • the interface text string input as processed and interpreted may be preferably further refined, as follows.
  • the sets of characters may be constrained as the beginning of words (character strings after a space).
  • the intervening string is constrained to be a terminal portion of a word, i.e., the intervening string includes a single, terminal space.
  • the system provides an WAP interface on a wireless communication device.
  • the device preferably communicates through the service provider, using http protocol, with at least one server.
  • the system may preferably have access to the Internet, a global network of computers employing TCP/IP communication protocol which supports the World Wide Web, a communication network on the Internet which supports hypertext communication using Hypertext Markup Language (HTML).
  • HTML Hypertext Markup Language
  • WWW World Wide Web
  • devices or “alternate platforms” include voice- and fax -based user agents, low-cost Network Computers, and handheld devices such as mobile phones and PDAs.
  • HTML While the WWW's infrastructure and protocols fully support these alternate platforms, HTML itself does not. In particular, the navigation and display models inherent to HTML are unsatisfactory when applied to a typical handheld device. However, combining the use of standard web protocols and infrastructure (for example, URLs, HTTP, SSL plus CGI, Perl, commercial web servers) with an alternate but complementary hypertext language, such as WML or other languages which are adapted for use with typical mobile wireless devices, such as HDML and TTML, provides display and navigation models designed to provide intuitive data access using a modified transaction paradigm rather than the document- based paradigm of HTML.
  • standard web protocols and infrastructure for example, URLs, HTTP, SSL plus CGI, Perl, commercial web servers
  • Handheld devices While there are many types, styles, and classes of handheld devices, they generally have many characteristics in common: • Small Display Size. Handheld devices are characterized primarily by a limited display size. A typical display is capable of displaying 4-10 lines of text 12-20 characters wide and may be graphical (bitmapped) or text-only. PDA-style displays may comprise 64x128 pixels to 640x480 pixels, in monochrome or color • Limited Input Capabilities. Handheld devices may or may not have a full keyboard and may or may not have a pointing/selection device.
  • the input keys on a data-ready mobile phone include only: The keys normally found on a telephone, usually numeric keys 0-9, *, #, with alphabet letters marked on numeric keys 2-9; Cursor/arrow keys (often just up and down or left and right); A number of dedicated function keys (SEND, END, etc.); and One or more "soft keys" with programmable labels.
  • Item selection is accomplished through numbered lists or using cursor keys to highlight a choice from a range of options and then directing a function to be performed on that item.
  • Full 2-D cursor control through pointing devices such as touch pads, touch screens, roller balls, are uncommon.
  • a full "QWERTY" keyboard is also uncommon.
  • HTTP Hypertext Transfer Protocol
  • a feature of HTTP is the typing and negotiation of data representation, allowing systems to be built independently of the data being transferred.
  • HDML in contrast to HTML, uses a "card” as the basic element, with a number of cards — a “deck” ⁇ required to make up an application.
  • Cards are individual units of data that are often, on some level, "atomic,” that is they cannot be subdivided into smaller pieces without losing context.
  • a deck of cards is linked internally and can be referenced by other decks and cards. Because the card is designed to capture discrete units of data, there are multiple types of cards: cards for displaying data, cards for entering data, and cards for listing indexes or lists of choices. Putting multiple types of data on a single card would imply the user has enough visual context in order to understand the differences. With the small display, the context would be lost.
  • WML as does HTML, communicates using HTTP.
  • a deck of cards may be designed to walk the user through a number of choices and data entry to result in a request which will return the specific data desired.
  • the end result could be a stock quote, a weather report, or a phone number, with varying levels of input and selection required to result in a call for the desired information from the WWW.
  • a deck of cards may be designed to walk the user through a number of choices and data entry to result in a request which will return the specific information requested. See, e.g., Berners-Lee, T., et.
  • the method for interpreting a user query is optimized to minimize the time the user must expend to input the query, while allowing focused requests for data.
  • the method also preferably follows an intuitive model of data structure, retained by the user, so that it is not difficult to learn the command syntax.
  • a user who is somewhat skilled in using the system and knowledgeable about the data to be retrieved will be able to efficiently use the system.
  • Naive users, i.e., those who are not skilled in using the system will preferably be presented with an intuitive, but shorthand style query input interface, which is easily learned.
  • the system will preferably offer a number of options.
  • One option is to preferably make available the text string contained in the intermediate (preprocessed) data format, formatted for the wireless device, such as an HDML card or deck, for downloading to the user device.
  • a second option is for the text search server to preferably communicate with the parent application host, translating user commands and formatting outputs in a form suitable for display on the wireless device, thus providing a single point of access to multiple servers. This, for example, preferably allows navigation of a single deck for the selected items, instead of one deck for each application.
  • the text search server may also preferably select a set of "hits" or records corresponding to the user query, and with each card or element on a card, provide sufficient information for the mobile user device to communicate directly with each of the host servers.
  • a hybrid approach may also be adopted, incorporating elements of each of the three options, or allowing the user to select from a host of other options which will be appreciated by those skilled in the art.
  • That server must also support WAP.
  • One advantage of employing the present invention is integration of multiple data sources as well as an optimized interface for the efficient retrieval of information.
  • the selection information may preferably also return an "offset" or location in the file where the user query criteria are met.
  • large files will be preprocessed according to a predetermined protocol into smaller, manageable records, which are the subject of the search selection process.
  • the preprocessing may be defined as a template, or customized by the user in advance.
  • the preprocessing is user-defined, the user's familiarity with the format and content of the data source is particularly advantageous for greater efficiency in subsequent use of the system.
  • the preprocessing may also preferably encompass an index -based scheme.
  • the source data is may be preferably processed to determine the word content of each file. While the order of terms may also be encoded, typically after each of the search terms is identified in a file or record, the content is searched to determine if it meets all criteria.
  • a preferred preprocessing of the raw data files removes extraneous spaces, normalizes the text to this upper case, and substitutes non-alphanumeric characters and punctuation with internal codes. Also, intra-record formatting is removed.
  • the user may preferably include within the search domain a local database, which may be searched by a local processor. Further, while mass transmission of large data files may be impractical, limited amounts of data may be transmitted by the present invention to the user device for processing.
  • the text search application need not reside on a central server or be physically separated from the user, the text search application is preferably separate from the user interface application.
  • the present invention preferably is capable of servicing the lowest common denominator, for example, a WAP mobile device with limited processing power and display capability.
  • the system may also preferably provide enhanced features to more capable user devices. These features may be defined in a user profile or setup preferences, or may be determined adaptively by identifying the type and capabilities of the user device. For example, a user may have various systems, such as a desktop, laptop and PDA, through which the same data retrieval system is accessed.
  • the computer system preferably communicates with the user device to determine its type and inherent capabilities.
  • the database may be remote from the user and accessed, for example through a network, through a packet data switched network (public or private), such as the Internet or an intranet, a telecommunication link, wireless link, cellular wireless link, or the like.
  • the preferred content communication protocol is the Wireless Application Protocol (WAP).
  • WAP Wireless Application Protocol
  • the user query may preferably be entered through by operation of a keyboard, a limited number of buttons, touchscreen, voice recognition or other means.
  • the universe of search databases is preferably divided into data search domains, which are selected by the user for application of the search query.
  • the data is preferably preprocessed to a normalized format, which may occur in advance or during processing of the user query.
  • Source data may, for example, have differing data formats, which are converted to a common format during preprocessing.
  • each of the ordered sets of alphanumeric characters is preferably translated as a beginning of a word in an alphanumeric string sequence.
  • the intervening alphanumeric string sequence may have a single space located at a terminal end of the alphanumeric string sequence.
  • the selected records preferably may be retrieved, and/or one or more selected records may be communicated to the user.
  • the system does not transmit a large volume of information for display to the user at one time, but rather segments the selected records according to a ranking or priority and transmits information relating to a limited number of records, allowing the user to prompt for further records.
  • Fig. 1 is a block diagram depicting the operation of a preferred embodiment of the present invention
  • Fig. 2 is a flow chart detailing a preferred embodiment of the present invention.
  • a user preferably inputs a search query consisting of the data matching parameters for the database search and an identification of the database(s) comprising the desired search domain into the user device 10 which transmits the search query 12 through a network 14 to the computer system 16.
  • a protocol interface 18 may preferably be employed to translate the data received from the network to a format which is compatible with the computer system.
  • the search query is preferably initially processed by the search engine controller 20, which separates the search query into its components of search criteria 22 and the source database identifier 24.
  • the engine controller preferably translates the search criteria, which provides the data matching parameters for the database search, to a formal search query which can be recognized by the database search engine 26, by the addition of truncator characters and order operators.
  • the source database identifier 24, which preferably defines the database(s) comprising the search domain, is preferably communicated to the database search engine to direct selection of the appropriate databases to be accesses in the search operation.
  • the databases 28 which can be accessed as required to accomplish the search include one or more Web servers, local databases, intranets, local area networks (LANs), wide area networks (WANs) or other searchable databases.
  • One preferred embodiment of this invention may also include a data preprocessor 30 which reformats large data files using a predefined protocol into smaller, more manageable records which are retained in a preprocessed database 32, for expedient access by the database search engine.
  • a data preprocessor 30 which reformats large data files using a predefined protocol into smaller, more manageable records which are retained in a preprocessed database 32, for expedient access by the database search engine.
  • the selected records or the addresses of their storage locations are preferably stored in the search records repository 34.
  • the identifiers and/or predetermined portions of the contents of one or more selected records are preferably tabulated by the records index function 36, and communicated to the user in a selected display format on the user device 10.
  • a protocol interface 18 may preferably be employed to translate the data received from the computer system to a format which is compatible with the network.
  • the user may request further data to be displayed from the selected records by responding to prompts or by other commands to display specified records which are executed by the records access function 38 and displayed on the user device.
  • the user may continue to request additional data from the selected records to be displayed on the user device, or may elect to perform additional database searches.
  • Fig. 2 shows a flow diagram of a method according to the present invention.
  • the method commences with the user optionally defining preferences and characteristics of system operation 50, such as user interface input and display formats, parameters used in search logic, database selection code definition and preprocessing format and methodology.
  • the user will preferably initially define a database search domain 52, which may be, for example, the user's personal information manager database.
  • the user then preferably enters a search query 54, consisting of one or more alphanumeric strings.
  • This user query is then preferably communicated to the computer system 56, and translated to a formal search query 58, by the addition of truncator characters and order operators.
  • the system preferably executes the formal search and selects records 60.
  • Information identifying one or more selected records is preferably communicated to the user 62, from which the user may determine whether to request further information 64. If the user requests such information, the content or an identifier of the content is preferably communicated to the user 66. The user may preferably elect to terminate the data retrieval process 68 or may interact further with the system 66, or alternatively 52 or 54.
  • the user would first initiate communication with the search engine using a wireless handheld portable device providing support for WAP, e.g., WML.
  • WAP wireless handheld portable device providing support for WAP, e.g., WML.
  • the user After identifying himself (a step which may be automatic and not require user intervention), the user would first define the data domain of interest, in this case schedules and/or meetings, which may be included in a full contact and personal information manager interface.
  • This data domain is predefined, and the data is either processed on demand or in advance to convert from a native format of the associated data management program to a text-only format of one record per string, omitting control characters, extended formatting, and the like, and presented using standard alphanumeric characters, for example in all capital letters.
  • the preprocessing software may provide translation from a wide variety of text source formats to a common intermediate format, preferably an intermediate format which may be converted to WAP (WML) for transmission to the user, avoiding the need to invoke the parent application.
  • WML WAP
  • the formatted text may also include a reference, such as a uniform resource locator (URL), to the primary data or parent application and primary data, allowing the user to then communicate directly with the parent application, for example to update data or obtain further related data.
  • URL uniform resource locator
  • CGI common gateway interface
  • a retrieved record or record identification may be accompanied by a complete search definition for a parent application, allowing the user to bypass screens of the parent application and avoiding inefficiency of passing communications through the text search application after selection.
  • the system according to the present invention may fully service the mobile client by formatting and transmitting all data requested.
  • the user knows that, in the data structure, name precedes telephone number, and types "BOB", space, "201", followed by an enter or confirm.
  • the query "BOB 201" is transmitted through a wireless service provider to a private switched data network, which interfaces with the Internet.
  • the WAP application and service provider pass through a Uniform Resource Locator (URL), with the user query appended as a parameter.
  • URL Uniform Resource Locator
  • the user query is directed to the user's data server.
  • the user query is then parsed as a text string search command by a text search application.
  • the text search application interprets the user query as a request for two sequential portions of the string, separated by an intervening string of arbitrary or zero size.
  • the limited search string is likely to retrieve only a small number of records. If the number retrieved exceeds the user's expectations, then, before examining the content of the records, the user may refine the query by adding a further restriction, such as the remainder of the telephone number, date of meeting, or other pertinent known information, or a narrower data domain selection, until a small number of records is retrieved.
  • WAP WML
  • a handheld device preferably communicates through a wireless network.
  • voice services are preferably supported through a telephone value added services server.
  • the handheld device may also preferably communicate using WML with a WAP proxy which receives input from a filter or a combined WAP proxy/filter.
  • the communicated data is derived from a Web server, which communicates in HTML.
  • This preferred embodiment provides a native WML WAP search server, which preferably receives and translates a user query from the handheld device (or any other device from the wireless network or Internet), through the existing infrastructure, including the Web Server, and preferably provides a response to the handheld device.
  • the WAP search server preferably searches the string database for matching records.
  • the string database contains records preferably derived from a preprocessor, which may be physically the same system as the WAP search server.
  • the preprocessor preferably obtains the raw data from one or more Web servers, local databases, intranets, and the like. Data domains may be defined by the source of the data, by content, or by other criteria. These criteria are defined by the user.
  • *norm++ islower(*s) ? toupper(*s) : *s;

Abstract

Procédé permettant d'extraire des informations d'une ou plusieurs bases de données (28) prédéfinies. L'utilisateur entre un ou plusieurs groupes de caractères alphanumériques dans un dispositif utilisateur (10). Les caractères alphanumériques sont transmis à un dispositif récepteur et dudit dispositif, sont entrés dans un outil de recherche (26) de base de données informatique. Ledit outil (26) est utilisé pour examiner les bases de données distinctes (28) à la recherche d'enregistrements qui contiennent les caractères alphanumériques. Les enregistrements contenant ces caractères sont identifiés et entrés dans le dispositif de transmission (10) pour être affichés sur le dispositif utilisateur (10).
PCT/US1998/021075 1998-10-07 1998-10-07 Systeme d'extraction dans une base de donnees WO2000020992A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
AU10689/99A AU1068999A (en) 1998-10-07 1998-10-07 Database retrieval system
PCT/US1998/021075 WO2000020992A1 (fr) 1998-10-07 1998-10-07 Systeme d'extraction dans une base de donnees

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US1998/021075 WO2000020992A1 (fr) 1998-10-07 1998-10-07 Systeme d'extraction dans une base de donnees

Publications (1)

Publication Number Publication Date
WO2000020992A1 true WO2000020992A1 (fr) 2000-04-13

Family

ID=22268040

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1998/021075 WO2000020992A1 (fr) 1998-10-07 1998-10-07 Systeme d'extraction dans une base de donnees

Country Status (2)

Country Link
AU (1) AU1068999A (fr)
WO (1) WO2000020992A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001086896A1 (fr) * 2000-05-05 2001-11-15 James Ewing Procede et systeme concernant des communications de protocole dans une infrastructure de serveur www pre-existant
DE10048743A1 (de) * 2000-09-29 2002-05-29 Siemens Ag Automatisierungsanlage
GB2374757A (en) * 2001-01-05 2002-10-23 Michael John Stubbs Remote audio-video instructional database
WO2003102815A1 (fr) * 2002-05-30 2003-12-11 Nokia Corporation Mecanisme d'interrogation base sur des symboles
EP1826943A1 (fr) * 2006-07-31 2007-08-29 Siemens Aktiengesellschaft Procede pour rechercher information dans un réseau

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4255796A (en) * 1978-02-14 1981-03-10 Bell Telephone Laboratories, Incorporated Associative information retrieval continuously guided by search status feedback
US5253341A (en) * 1991-03-04 1993-10-12 Rozmanith Anthony I Remote query communication system
US5781773A (en) * 1995-05-10 1998-07-14 Minnesota Mining And Manufacturing Company Method for transforming and storing data for search and display and a searching system utilized therewith
US5804803A (en) * 1996-04-02 1998-09-08 International Business Machines Corporation Mechanism for retrieving information using data encoded on an object

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4255796A (en) * 1978-02-14 1981-03-10 Bell Telephone Laboratories, Incorporated Associative information retrieval continuously guided by search status feedback
US5253341A (en) * 1991-03-04 1993-10-12 Rozmanith Anthony I Remote query communication system
US5781773A (en) * 1995-05-10 1998-07-14 Minnesota Mining And Manufacturing Company Method for transforming and storing data for search and display and a searching system utilized therewith
US5804803A (en) * 1996-04-02 1998-09-08 International Business Machines Corporation Mechanism for retrieving information using data encoded on an object

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"WIRELESS APPLICATION PROTOCOL ARCHITECTURE SPECIFICATION", WAP ARCHITECTURE VERSION 30 APR 1998, XX, XX, 30 April 1998 (1998-04-30), XX, pages COMPLETE, XP002919030 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001086896A1 (fr) * 2000-05-05 2001-11-15 James Ewing Procede et systeme concernant des communications de protocole dans une infrastructure de serveur www pre-existant
DE10048743A1 (de) * 2000-09-29 2002-05-29 Siemens Ag Automatisierungsanlage
DE10048743C2 (de) * 2000-09-29 2002-11-28 Siemens Ag Automatisierungsanlage
US6915174B2 (en) 2000-09-29 2005-07-05 Siemens Aktiengesellschaft Automation installation
GB2374757A (en) * 2001-01-05 2002-10-23 Michael John Stubbs Remote audio-video instructional database
GB2374757B (en) * 2001-01-05 2003-06-11 Michael John Stubbs Remote audio visual instruction system
WO2003102815A1 (fr) * 2002-05-30 2003-12-11 Nokia Corporation Mecanisme d'interrogation base sur des symboles
EP1826943A1 (fr) * 2006-07-31 2007-08-29 Siemens Aktiengesellschaft Procede pour rechercher information dans un réseau
WO2008014907A1 (fr) * 2006-07-31 2008-02-07 Nokia Siemens Networks Gmbh & Co. Kg Procédé pour chercher des informations dans un réseau

Also Published As

Publication number Publication date
AU1068999A (en) 2000-04-26

Similar Documents

Publication Publication Date Title
US7809716B2 (en) Method and apparatus for establishing relationship between documents
US8204881B2 (en) Information search, retrieval and distillation into knowledge objects
US7243095B2 (en) Prose feedback in information access system
US6745181B1 (en) Information access method
CA2578791C (fr) Desambiguisation de caracteres ambigus
US7376641B2 (en) Information retrieval from a collection of data
US7925975B2 (en) Searching for commands to execute in applications
US7136846B2 (en) Wireless information retrieval
US6446035B1 (en) Finding groups of people based on linguistically analyzable content of resources accessed
US7383299B1 (en) System and method for providing service for searching web site addresses
US20140344306A1 (en) Information service that gathers information from multiple information sources, processes the information, and distributes the information to multiple users and user communities through an information-service interface
WO2007070410A2 (fr) Appareil de recherche et de navigation de dispositif mobile
Aridor et al. Knowledge encapsulation for focused search from pervasive devices
US20020026472A1 (en) Service request method and system using input sensitive specifications on wired and wireless networks
WO2000020992A1 (fr) Systeme d'extraction dans une base de donnees
JP2002116983A (ja) ウェブコンテンツの変換方法およびシステム
US7343372B2 (en) Direct navigation for information retrieval
US20030120779A1 (en) Method for performing a search, and computer program product and user interface for same
US7127450B1 (en) Intelligent discard in information access system
JP4773761B2 (ja) 情報検索サーバー、情報検索方法、情報検索プログラム
EP1176518A2 (fr) Procédé et système dans un réseau informatique pour rechercher et associer des sites Web
US8478732B1 (en) Database aliasing in information access system
KR100491254B1 (ko) 웹사이트 디렉토리나 웹페이지에 대해 설명하는 단어들에하이퍼링크를 적용하는 검색 시스템 및 방법
KR20020062464A (ko) 메타 검색 엔진을 이용한 인터넷 상의 정보 검색 방법 및메타 검색 엔진 시스템
KR20020004041A (ko) 인터넷을 통한 파일 검색 서비스 시스템 및 방법

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH GM HR HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: CA

122 Ep: pct application non-entry in european phase