Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Methodology for Query Search Structure Addressing for Calendar Users

IP.com Disclosure Number: IPCOM000104448D
Original Publication Date: 1993-Apr-01
Included in the Prior Art Database: 2005-Mar-19
Document File: 2 page(s) / 77K

Publishing Venue

IBM

Related People

Jackson, BK: AUTHOR [+4]

Abstract

In an electronic calendar system, users may be cognizant of the fact that they do not know the address of a calendar user. However, users may possess some information on the calendar user. The electronic address is merely a means for accessing the user's personal calendar. There is a desire for mail office systems to automatically let the user specify a predicate search parameter as an electronic address. Users in such situations would appreciate a service that allows for addresses to be specified as a search term for a calendar user.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Methodology for Query Search Structure Addressing for Calendar Users

      In an electronic calendar system, users may be cognizant of the
fact that they do not know the address of a calendar user.  However,
users may possess some information on the calendar user.  The
electronic address is merely a means for accessing the user's
personal calendar.  There is a desire for mail office systems to
automatically let the user specify a predicate search parameter as an
electronic address.  Users in such situations would appreciate a
service that allows for addresses to be specified as a search term
for a calendar user.

      Upon a user specifying an address in a specified Search
Construct format at access time, a Query Resolution Service accepts
the address as a query parameter.  The parameter is submitted through
a Syntactical Verifier to ensure the construct is of the correct
format.  Subsequently, a Semantic Verifier service assures that the
specified address is semantically correct.  Upon these conditions
being valid, a Query Protocol Engine performs an associated query.
The protocol engine allows for the addresses to be decomposed into
components to allow multiple searches if specified.  For example, a
user may have specified an address of "MARK* @ NODE1 ºº NODE2".  This
single address when passed to the Query Protocol Engine designates
that any directory data base queries on a userid with the prefix of
MARK either at NODE1 or NODE2 should be used as the address for the
calendar user.  In the case of multiple results, the user can select
from the returned response's valid format.  Misspelled or an
otherwise incorrect address is submitted through a series of rules to
determine potentially known replacements for the address.  Those
skilled in the art recognize a plurality of Boolean constructs can be
developed to allow multiple criteria to be specified.  A user...