Abstract: A data structure, database management system, and methods of validating data are disclosed. A data structure is described that includes a superset of interconnected relational databases containing multiple tables having a common data structure. The tables may be stored as a sparse matrix linked list. A method is disclosed for ordering records in hierarchical order, in a series of levels from general to specific. An example use with address databases is described, including a method for converting an input address having a subject representation into an output address having a preferred representation. Preferred artifacts may be marked with a token. Alias tables may be included. This Abstract is provided to comply with the rules, which require an abstract to quickly inform a searcher or other reader about the subject matter of the application. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: A system and method for accessing a relational database and estimating the selectivity of a query (e.g., an SQL query) in order to better predict the number of qualifying records for simple and complex queries. A dataset is created based upon queries applied against the database by the user community. The dataset is populated with information related to query conditions and their respective combinations. A regression function reflecting correlations between query conditions is generated and used as a data mining model to calculate table-specific estimates for the cardinality of subsequent queries. An appropriate access method is then selected from a set of available access methods based upon the number of estimated query-qualifying records. By periodically updating the regression model with FIFO managed queries, a self-tuning mechanism is achieved resulting in better selectivity/result size estimates for use in selecting access methods used in compiling subsequent SQL queries applied against the database.

Abstract: User activities in various applications are audited using a client-resident agent. An alias for an individual is associated with a user profile for the individual user. The user profile may contain data pertaining to the user's activities within one or more applications. Data in the user profile may be used to determine which actions are audited, and how the audit data is used.

Abstract: A system and method for controlling the use of addresses by using address computation techniques is described. A system comprising alias address creation software generates multiple alias addresses representing a single real address of a particular recipient. Each alias address is computed from data representing a prospective sender and a recipient. A sender is provided with an alias address by a recipient for communicating back to said recipient. Messages sent by a sender, employing alias addresses are analysed to a forwarding server which validates each alias address and checks it against a blocking list. Messages which pass these checks are directed to the recipient's real address registered with said forwarding server.

Abstract: User access to applications is controlled by associating an alias for an individual with a user profile for the individual; the user profile typically contains data referring to one or more applications. Access to an application is obtained using the data in the user profile, e.g., through automatic completion of forms or screens within an application. In addition, the user profile may be employed to limit user access to parts of an application, or to terminate a user's access to an application.

Abstract: The BilVideo video database management system provides integrated support for spatiotemporal and semantic queries for video. A knowledge base, consisting of a fact base and a comprehensive rule set implemented in Prolog, handles spatio-temporal queries. These queries contain any combination of conditions related to direction, topology, 3D relationships, object appearance, trajectory projection, and similarity-based object trajectories. The rules in the knowledge base significantly reduce the number of facts representing the spatio-temporal relations that the system needs to store. A feature database stored in an object-relational database management system handles semantic queries. To respond to user queries containing both spatio-temporal and semantic conditions, a query processor interacts with the knowledge base and object-relational database and integrates the results returned from these two system components. Because of space limitations, we only discuss the Web-based visual query interface and its fact-extractor and video-annotator tools. These tools populate the system's fact base and feature database to support both query types.

Abstract: A method and apparatus for applying an application of a database service, such as X.500 or LDAP, to a relational database, a database design and use of the database to perform such services. Specifically addressed is the problem of database searching, particularly search speed and complexity of search. The method and apparatus concern searching a directory service database, in which the scope of search area is initially prescribed and/or in which a filter is applied over the search area. Moreover, in dealing with an alias during a search, a unique set of areas is found which define areas of a search tree that need to be searched. A FLAG column is used to indicate if an alias points inside a subtree. The method and apparatus also enable single pass resolution in any one of a search, filter or subtree search of a directory service, the method and apparatus including the use of a path column to simultaneously apply an arbitrary filter over an arbitrary subtree. Further disclosed is a method and apparatus of retrieving data from a directory service database, which includes conducting search, collecting all entries that need to be retrieved, and retrieving entries in parallel.

Abstract: The use of a scientific, on-line database for function approximation is a technique that can significantly reduce the computational demands for problems requiring the frequent evaluation of computationally expensive functions. In this paper we present several new algorithms which significantly improve the performance of software implementations of this database approach. These algorithms are of two types--first, algorithms designed to improve the database retrieval rates; and, second, algorithms that seek to reduce the size of the database and subsequently reduce the cost of database queries. We have developed a software implementation of algorithms called DOLFA. We present experimental results which detail the performance of the DOLFA software for one representative combustion application. We observe significant improvements in cumulative time needed for database operations and memory requirements in a comparison of DOLFA to the function tabulation software system ISAT.

Abstract: Methods and apparatus, including computer program products, for automated management and control of contact aliases. In general, in one aspect, the invention provides a computer implemented method for processing messages. The process includes maintaining rules of which a first rule specifies a first alias of a first sender to be used for messages sent from the first sender to a first group of one or more intended recipients. The process includes receiving a first message from the first sender to one or more intended recipients of the first group. The process includes changing the first message so that address information presented shows the first alias of the first sender.

Abstract: Described is a method and system for performing path-sensitive value flow analysis on a software program. Concrete state and value alias information is tracked along each statement and each relevant path in an abstract program and is stored as a symbolic state in a symbolic store. The value alias information includes a first set of aliases that identify aliases for a designated value that is being analyzed and a second set of aliases that identify possible aliases for the designated value. The value alias information is obtained using imprecise memory alias analysis. Along each relevant path for each statement, transforms are applied to the sets of aliases to update the first and second sets of aliases. The transforms are applied based on the type of statement being processed. Symbolic states existing at the same location are merged if the value alias information is identical within the symbolic states.

Abstract: A method is presented for managing applications using application-based names. A naming service registers an alias name; the alias name represents a first compound name that includes an application name that is associated with an application and a deployment name that is associated with a deployment attribute that characterizes a deployment of an instance of the application. The naming service is also able to generate an application-based name associated with an application; the application-based name represents a context within a naming system, and the application-based name is a second compound name that includes the alias name. Applications are managed within a data processing system using application-based names. The first compound name can be associated with a first topology-based name that represents a first context for organizing files that are related to the instance of the application.

Abstract: A digital content file having user history information is received at a first device. The user history information includes an alias name of a previous user of the digital content file. A user may review the user history information of the digital content file for information of the previous user of the digital content.

Abstract: A controlled database system is designed for rapid access of data records with reduced memory storage requirements. The database system employs a set of obfuscated data records stored in data crystals that can only be accessed and read by an iterator, which is not directly accessible by the users of the database. The iterator accesses information responsive to a predefined query sent from a customer application. Rather than providing general tools to customers for constructing any possible queries, such as is done in structured query language database systems, database systems embodying the present invention allow only predefined types of queries to be used by customer applications. By restricting the types of queries customer applications can call, valuable data records remain secure from unauthorized reconstruction or duplication while still allowing limited access for specific purposes.

Abstract: Embodiments of the present invention relate to a system and method for implementing functions of a register translation table of a computer processor, with reduced area requirements as compared to known arrangements.

Abstract: A method and apparatus for a microprocessor with a divided register alias table is disclosed. In one embodiment, a first register alias table may have a full set of read and write ports, and a second register alias table may have a smaller set of read and write ports. The second register alias table may include translations for those logical register addresses that are used less frequently. When the second register alias table is called upon to translate more logical register addresses than it has read ports, in one embodiment a pipeline stall may permit additional time to utilize the limited read ports. In another embodiment, additional build rules for a trace cache may be utilized.

Abstract: The present invention provides methods, systems, and computer program products for normalizing document search terms through use of an alias database, as may be found in an alias relationship file, such as a directory service. A gatherer module receives as input (or crawls through) several documents in series or in parallel and can recognize data segments as related to one of the aliases in the alias relationship file. The gatherer then associates the document appropriately so that a search engine may find all documents associated with a search term, regardless of whether the term has undergone several name changes (various aliases) over the course of time. Accordingly, a user may then search for a person's name, and receive as a search result all documents listing the person's name, as well as documents listing, for example, only the person's email address.

Abstract: Methods and apparatus, including computer program products, for automated management and control of contact aliases. In general, in one aspect, the invention provides a computer implemented method for processing messages. The process includes maintaining rules of which a first rule specifies a first alias of a first sender to be used for messages sent from the first sender to a first group of one or more intended recipients. The process includes receiving a first message from the first sender to one or more intended recipients of the first group. The process includes changing the first message so that address information presented shows the first alias of the first sender.

Abstract: A method and system for sending image data on an image capturing apparatus, to specified destination(s). The image capturing apparatus includes a list of aliases for the various destinations which can be specified. The data to be sent, and the alias specifying the destination to which it is to be sent, is selected. The alias is then inserted into the data, and the modified data is downloaded to a host. The host contains a look-up table specifying the destination address(es) corresponding to the alias. The specified data is sent to this destination address.

Abstract: The present invention provides methods, systems, and computer program products for normalizing document search terms through use of an alias database, as may be found in an alias relationship file, such as a directory service. A gatherer module receives as input (or crawls through) several documents in series or in parallel and can recognize data segments as related to one of the aliases in the alias relationship file. The gatherer then associates the document appropriately so that a search engine may find all documents associated with a search term, regardless of whether the term has undergone several name changes (various aliases) over the course of time. Accordingly, a user may then search for a person's name, and receive as a search result all documents listing the person's name, as well as documents listing, for example, only the person's email address.

Abstract: Efficient low-level systems need more control over memory than safe high-level languages usually provide. As a result, run-time systems are typically written in unsafe languages such as C. This paper extends previous work on linear types, alias types, regions, and typed garbage collection to give type-safe code more control over memory. The approach is truly low-level: memory consists of a single linear array of words, with load and store operations but no built-in notion of an object. The paper constructs lists and arrays out of the basic linear memory primitives, and then introduces type sequences for building regions of nonlinear data. It then describes a Cheney queue typed garbage collector, implemented safely over regions.

Abstract: Parallel database systems are being used nowadays in a wide variety of systems, right from database applications to decision support systems. These implementations involve database processing and querying over parallel systems. For the parallel databases to be effective and efficient, various optimizing solutions need to be implemented. These solutions deal with various issues associated with such database systems : query optimization, data allocation within the database, etc.This paper will attempt to give the reader an understanding of the various issues involved in optimizing the performance of a parallel database system. The primary areas of focus will be system architecture, query optimization and data reallocation. It will look at related work done by other authors in this field and hopefully provide a thorough understanding of the solutions in this area.

Abstract: Assignment of a unique address identifier to a partition of a computing environment is provided by extending the applicability of hunt groups. A single-member hunt group is initiated to provide an alias address (e.g., hunt group ID) which is associated with the partition of the computing environment. A token (or token and password) facilitates the association between the alias address and the partition. Subsequent communication between the partition and a fabric switch of the computing environment will use the alias address as a source or destination address identifier, thereby uniquely identifying the partition.

Abstract: A consistent query protocol allows a database owner to publish a very short string c which commits her to a particular database D with special consistency property (i.e., given c, every allowable query has unique and well-defined answer with respect to D.) Moreover, when a user makes a query, any server hosting the database can answer the query, and provide a very short proof π that the answer is well-defined, unique, and consistent with c (and hence with D). One potential application of consistent query protocols is for guaranteeing the consistency of many replicated copies of D—the owner can publish c, and users can verify the consistency of a query to some copy of D by making sure π is consistent with c. This strong guarantee holds even for owners who try to cheat, while creating c. The task of consistent query protocols was originally proposed for membership queries by Micali and Rabin[18], and subsequently and independently, by Kilian [16]. In this setting a server can prove to a client whether or not a given key is present or not in a database, based only on a short public commitment c. We strengthen their results in several ways. For membership queries, we improve the communication complexity; more importantly, we provide protocols for more general types of queries and more general relational databases. For example, we consider databases in which entries have several keys and where we allow range queries (e.g. we allow a client to ask for all entries within a certain age range and a certain salary range). Towards this goal, we introduce query algorithms with certain inherent robustness properties— called data-robust algorithms—and show how this robustness can be achieved. In particular, we illustrate our general technique by constructing an efficient data-robust algorithm for proving consistency of orthogonal range queries (a particular case of a “join”query). The server’s proof convinces the client not only that all the matching entries provided are in D, but also that no others are present. Our guarantees hold even if the answer is the empty set. In the case of one-dimensional range queries we also show a new data-hiding technique—called explicit hashing—which allows us to a execute consistent query protocol π and at the same time protect the privacy of all other information in the database efficiently. In particular, we avoid the NP reductions required in a generic zero-knowledge proof. ∗Telcordia Technologies, Morristown, NJ, USA. †University of Toronto, Toronto, Ontario, Canada ‡MIT LCS, 200 Technology Square, NE43-446, Cambridge, MA 01239, USA.

Abstract: Since the main purpose of a model written in VHDL-AMS is to describe a hardware design, it should be made as easy as possible to read and understand. In this chapter, we introduce aliases as a means of making a model clearer. As in everyday use, an alias is simply an alternate name for something. We see how we can use aliases in VHDL-AMS for both data objects and other kinds of items that do not represent data in a model.

Abstract: A directory tag for each cache line in a memory within a multiprocessor distributed memory system includes a share mask and an alias signature The share mask is used to keep track of entities of the system that share the cache line, and is encoded into a fixed length field having a number of bits that is significantly less than the number of the entities The share mask is utilized for maintaining coherency among shared data in the system Before a request to access a location of a memory is granted, the share mask is used to identify each entity or a group of entities that share the particular location, and an invalidate message is sent to each of the identified entity or group of entities, eliminating the need to broadcast the message to all entities in the system, and thus conserving the communication bandwidth of the system The alias signature in the directory tag is compared with an alias signature computed from the memory access request to prevent data corruptions that may occur due to incorrect memory aliasing

Abstract: A method, system and article of manufacture for accessing data in a database independent of the particular manner in which the data is physically represented and for preventing alterations of data in the database when a query is executed against the database are provided. One embodiment provides a method of preventing alterations of data in a database when a query is executed against the database. The method comprises providing a logical representation of the data defining a plurality of logical fields abstractly describing associated physical entities of the data; receiving an abstract query comprising at least one logical field of the plurality of logical fields; and locking the at least one logical field before executing the abstract query.

Abstract: A system for determining a spanning tree for a computer network is disclosed. The system includes a computing device and a computer-readable medium. The computer-readable medium is part of the computing device or is in electronic communication with the computing device. The computer-readable medium comprises executable instructions for implementing a method for determining the spanning tree for the computer network. Multicast alias domains from the computer network are discovered. The discovery of communication metrics by the multicast alias domains is coordinated. The communication metrics from the multicast alias domains are determined. A minimum spanning tree for the computer network is constructed by using the communication metrics. The minimum spanning tree is stored and used in computer system administration.

Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a common variable that is aliased with another formal parameter is modified. Compilers, assuming standard-conforming programs, consider that an assignment to one variable will not change the value of any other variable, allowing optimizations involving the aliased variables. Higher performance results but anything may happen: the program may appear to run normally, or may produce incorrect answers, or may behave unpredictably. The results may depend on the compiler and the optimization level. To guarantee the standard conformance of programs and to maintain the referential transparency in order to make program analyses exact and program optimizations safe, precise alias information retrieval at a reasonable cost, especially the determination of overlaps between arrays are studied in this paper. Static analyses and code instrumentation are used to find all violations of the prohibitions against aliasing in Fortran code. Alias violation tests are inserted only at places where it cannot be proved statically that they are useless in order to reduce the number of dynamic checks at run-time. A specific memory location naming technique is used to compact representation and enhance the precision of alias analysis. Modifications on the dependence graph created by aliasing are also studied to show the impact of aliases on some program optimizing transformations. Experimental results on SPEC95 benchmark are presented and some related issues are also discussed.