International Business Machines Corporation

Tandem Computers Incorporated

Robbert Van Der Linden

Uttam Jain

Brian Shaun Vickery

Nimrod Megiddo

Fatma Ozcan

William J Carley

Michael John Skarpelos

James M Lyon

Matthew C McCline

Umar F Minhas

Guy Maring Lohman

Richard Sefton Sidle

Satoshi Hada

Simon Kurt Johnston

Lawrence Scott Rich

Edison Lao Ting

Michiharu Kudo

Ioana Roxana Stanoi

Tuong Chanh Truong

Martin Paul Nally

Akihiko Tozawa

Naishin Seki

James Peter Branigan

Henrik Loeser

David Paul Charboneau

Quanzhong Li

Thomas Fanghaenel

Stefan Tobias Mayr

Brain S Vickery

The embodiments relate to assigning data to processors of a file system. Metadata associated with respective blocks of data, and an initial batch of the blocks is assigned to nodes of a file system based on the metadata. Unassigned blocks are selectively assigned to one or more of the nodes. The selective assignment includes constructing a linear regression model based on node data, and determining a value for each node based on the linear regression model. Each value is associated with a predicted load corresponding to a new assignment of one or more unassigned blocks.

Assignment of data within file systems

An improved method and system for providing path-level access control to a structured document in a collection stored in a database, where the structured document includes a plurality of nodes is disclosed. The method includes the steps of providing an access control policy for the collection, where the access control policy comprises a plurality of access control rules, generating a path for each node of the plurality of nodes in the document, and generating for each path associated with a node a corresponding value expression based on at least one access control rule of the plurality of access control rules. According to the method and system of the present invention, the corresponding value expression is utilized during access control evaluation to determine whether a user is allowed to access a node in the structured document.

Providing path-level access control for structured documents stored in a database

Embodiments of the invention relate to a multi-level database compression technique to compress table data objects stored in pages. A compact dictionary structure is encoded that represents frequent values of data at any level of granularity. More than one level of compression is provided, wherein input to a finer level of granularity is an output of a coarser level of granularity. Based upon the encoded dictionary structure, a compression technique is applied to a stored page to compress each row on the page. Similarly, a de-compression technique may be applied to decompress the compressed data, utilizing the same dictionary structures at each level of granularity.

Multi-level database compression

Resources are typically stored in homogenous data structures by shredding resource data into database tables destroying a native format of the resources. Typical approaches to indexing the resources rely on users indicating properties that should be indexed, using full text searches to create resource index documents, and other such labor and computation intensive processes. Functionality can be implemented to dynamically generate the resource index documents based on resource properties with minimal user input. The resource index documents can be in a common format to facilitate access to resources stored in heterogeneous native resource formats.

Indexing heterogeneous resources

A method, computer readable medium, and system for storing a structured document in its native format in a database are provided. The method, computer readable medium, and system include receiving the structured document, generating a hierarchical node tree comprising a plurality of nodes, where the node tree represents the structured document, and storing the plurality of nodes in at least one record in the database.

Method and system for storing structured documents in their native format in a database

A system for associating information related to a component of a structured document that is stored in its native format in a database system includes generating a hierarchical node tree comprising a plurality of nodes, where each node represents a component in the structured document, and generating a path associated with each node, where the path follows the hierarchical structure of the structured document from a root node to the node. In each node, an identifier associated with the path is stored. A table is provided that correlates the identifier with information related to the associated path. The information applies to the component represented by the node.

Associating information related to components in structured documents stored in their native format in a database

A system and method is provided for processing XQuery Updates on an Extensible Markup Language (XML) document. The XQuery Updates are processed in three phases. The first phase includes creating a pending update list (PUL) including all update operations to be performed on nodes in a fragment of the Extensible Markup Language (XML) document. The second phase includes sorting the PUL. The third phase includes applying the sorted PUL to each node in the XML fragment during a single traversal of the XML fragment.

Three-phase single-pass efficient processing of Xquery update

A method and system for querying a structured document stored in its native format in a database, where the structured document includes a plurality of nodes that form a hierarchical node tree, is disclosed. The method includes providing at least one child pointer in each of the plurality of nodes, where the at least one child pointer points to a corresponding child node of the plurality of nodes, and storing a hint in each of the at least one child pointers. The hint is then utilized to navigate the hierarchical node tree during query evaluation.

Method and system for querying structured documents stored in their native format in a database

A method for associating information related to a component of a structured document that is stored in its native format in a database system includes generating a hierarchical node tree comprising a plurality of nodes, where each node represents a component in the structured document, and generating a path associated with each node, where the path follows the hierarchical structure of the structured document from a root node to the node. In each node, an identifier associated with the path is stored. A table is provided that correlates the identifier with information related to the associated path. The information applies to the component represented by the node.

A fault tolerant computer system distributes audit trail files containing audit records, across an arbitrary number of disk volumes. After one audit trail file becomes full, audit records are directed toward a next audit trail file stored on a different disk volume. Storage of newly generated audit rotates through the disk volumes in round-robin fashion. Full audit trail files are eventually archived and their space becomes available again for renaming and storage of newly generated audit records. The number of audit records available for on-line recovery after a failure is not limited to the storage capacity of any single disk volume. Furthermore, there is no contention for disk access between archiving of full audit trail files and storage of newly generated audit records.

Multi-volume audit trails for fault tolerant computers

Growing community of inventors

Scotts Valley, CA, United States of America

Robbert Van Der Linden