International Business Machines Corporation

Jay H Unger

William H Tetzlaff

David Bruce Lection

Gerald P Bozman

James J Myers

Thyra Lynne Rauch

Alexander S Lett

Paul T Leone

Charles Edward Burkett

John Raithel Hind

Gennaro A Cuomo

Peter George Capek

David John Clark

Robert Baird

Michael E Moran

Roland Albert Merrick

Richard Dean Telford

George Eisenberger

Leonard Douglas Tidwell, Ii

Robert R Berbec

James J Slater

Jacqueline P De Vries

Don Hyatt

Elie Cassorla

Glen Fuller

Pete Gegen

A method compiles a hypertext file or collection of files into a single compiled file. The compiled file is generally much smaller in size than the original collection of files. The compiled file includes compressed text and objects corresponding to the text and objects within the original files input to the compiler, pre-parsed tag tree corresponding to the hypertext structure of the included files which facilitates rendering the compiled file by the browser, and a search index. The method of compiling a hypertext source includes parsing the tagged data at the server, to recognize and separate the tags in the file from the corresponding data. The data is compressed and stored into a compiled file, database or textbase. A pointer is assigned to each of the parsed tags, the pointer indicating a location in the compiled material of the compressed data relating to each of the parsed tags. The parsed tags and pointers are also stored in the compiled representation as a structured tree format.

Compiled structure for efficient operation of distributed hypertext

A method, system, and computer-readable code for a technique with which files encoded according to the Extensible Markup Language (XML) notation can be marked up to indicate that the content of the file (or some portion thereof) is dynamic in nature and is to be updated automatically to reflect changing information. The proposed technique provides a novel way to specify that a data repository should be accessed as the source of the updates. Techniques are defined for specifying that this data repository access occurs once, and for specifying that it occurs when a set of conditions are satisfied (which may include periodically repeating the data repository access and content update). In one aspect, the data repository is a database; in another aspect, the data repository is a file system. Preferably, the Lightweight Directory Access Protocol (LDAP) is used as an access method when the data repository being accessed is a database storing an LDAP directory.

Method for producing composite XML document object model trees using dynamic data retrievals

Systems, methods and computer program products are provided for building and displaying dynamic graphical user interfaces (GUIs) that can be updated automatically without requiring code-level modification and recompiling. In response to a request to display a particular GUI on a computer display, an Extensible Markup Language (XML) data group is selected from a plurality of XML data groups and an XML display layout is selected from a plurality of XML display layouts. The selected XML data group includes one or more aggregations of data hierarchically ordered within the selected XML data group. XML data items are hierarchically ordered within each of the aggregations of data. The selected XML display layout contains one or more areas that define respective GUI display spaces within which XML data items from the respective aggregations of data can be displayed. XML markup tags associated with each aggregation of data within the selected XML data group are matched with XML markup tags associated with a respective area contained within the selected XML display layout. The XML data items contained within each aggregation of data are rendered in hierarchical order within a respective GUI display space defined by a respective area within the XML display layout.

Systems, methods and computer program products for building and displaying dynamic graphical user interfaces

A method of facilitating hypertext navigation within a collection of linked files includes gathering a set of linked files for inclusion within the collection and identifying a map of links among the files. The map is then analyzed to determine groupings among the files based on relevance. Additional hypertext links are then created that link to files within the at least one group. The additional hypertext links are then stored in one of the files in the collection a new file that is added to the collection.

Method for automatically constructing contexts in a hypertext collection

Methods, systems and computer program products are provided for providing information in the form of an insertion to a user during delays in retrieving program material with an interactive system. This may include making a determination of whether the delay is going to be sufficiently long to provide the user with an insertion. In addition, the insertion may be customized to either the user or to the program material requested, or to both the user and the requested program material. The insertion may include control logic that provides the user with control over the insertion and/or the interactive system.

Methods, systems and computer program products for providing insertions

A method for compressing text includes steps of parsing words from text in an input file and comparing the parsed words to a predetermined dictionary. The dictionary has a plurality of vocabulary words in it and numbers or tokens corresponding to each vocabulary word. A further step is determining which of the parsed words are not present in the predetermined dictionary and creating at least one supplemental dictionary including the parsed words that are not present in the predetermined dictionary. The predetermined dictionary and the supplemental dictionary are stored together in a compressed file. Also, the parsed words are replaced with numbers or tokens corresponding to the numbers assigned in the predetermined and supplemental dictionary and the numbers or tokens are stored in the compressed file.

Efficient method for compressing, storing, searching and transmitting

A computer implemented method for minimizing the grant of pages locks and the number of outstanding locks while ensuring consistency of the copies of pages resident among a first, and a second data cache with the original pages in shared external storage. A first processor requesting a lock on a designated page is granted a lock over the group of pages including the designated page in the absence of a concurrent lock to the page or group held by another processor. Any changed page is copied through to external storage. Otherwise, a processor intending to alter a page causes a global lock manager to notify concurrent lock holders, invalidate copies of the page in their local caches, and obtain an exclusive lock to the requesting process for the duration of its operation on the page. After this the lock is demoted to share and the changed page also copied through to external storage.

Method for minimizing lock processing while ensuring consistency among

A computer-implemented method for the name-oriented accessing of files having at least zero records, any access path to files and records through an external store coupling the computer being defined by a pair of related directories. A first directory of record entries is sorted on a two-part token. The token consists of a unique sequence number assigned to the record and the sequence number of any parent record entry. Each record entry includes the token, file or record name, and external store address or pointer A traverse through the tokens constitutes a leaf-searchable B-tree. Rapid access to target records is by way of a name-sorted, inverted directory of names and tokens as a subset and which is reconstitutable from the first directory in the event of unavailability.

Method for dynamically expanding and rapidly accessing file directories

The operating principle permits a reader of an electronically published document to create notes, bookmarks, or annotations and relate them to a particular location in the document. The record of such annotations or 'place marks' can be stored within or separately from the published material. Annotations stored separately from the originally published document are associated by name with the document and can either be accessed by a particular individual reader and/or shared and exchanged between individuals with access to the same (or copies of the) published electronic document for a variety of purposes. The attachment of annotations is a capability provided to the reader of an electronic document and does not require any specific preparation on the part of the writer or editor of an electronic document. The association of annotations with a particular context within the document exploits the fact that the writer in constructing an electronically published document has indicated the structure of the document by 'marking up' the material and identifying major document elements such as chapters, sections, sub-sections, paragraphs, figures, etc. It also uses relative position within the 'finest' identified document element to fix the precise position of some annotations that the reader wants to pinpoint to a particular line or word position.

Method for associating annotation with electronically published material

A method to manage the access of data or pages mapped into a very large virtual external address space through a cache without disturbing the logical view of the data and without having to assign physical or real backing store to said logical view. A data cache is used in which pages are indexed according to a logical address intermediate to their virtual address and their physical location in external storage. Pages common to two or more files are updated in place in the cache, while pages bound to only one file are shadow copied.

Growing community of inventors

Mohegan Lake, NY, United States of America

Jay H Unger