Abstract: Techniques for information retrieval include receiving a plurality of data records, each data record including data fields associated with a business enterprise, the data fields including a name of the business enterprise; updating a plurality of database records associated with the received plurality of data records stored in a database, each database record including attributes including the name of the business enterprise and an alias associated with the name of the business enterprise; receiving a query for a particular database record, the query including at least one of the name of the business enterprise or the alias associated with the name of the business enterprise; and preparing for display, in response to the query, one or more of the database records based on at least one of the name of the business enterprise or the alias associated with the name of the business enterprise.

Abstract: An important goal for database systems today is to provide elastic scale-out, i.e., the ability to grow and shrink processing capacity on demand, with varying load. Database systems are difficult to scale since they are stateful -- they manage a large database, and it is important when scaling to multiple server machines to provide mechanisms so that these machines can collaboratively manage the database and maintain its consistency. Database partitioning is often used to solve this problem, with each server machine being responsible for one partition. In this paper, we propose that the flexibility provided by a partitioned, shared nothing parallel database system can be exploited to provide elastic scale-out. The idea is to start with a small number of server machines that manage all partitions, and to elastically scale out by dynamically adding new server machines and redistributing database partitions among these servers. We present an implementation of this approach for elastic scale-out using VoltDB -- an in-memory, partitioned, shared nothing parallel database system. Our main goal in this paper is to identify several manageability problems that arise when using this approach for elastic scale-out. The paper presents some of these problems and outlines a research agenda for this area.

Abstract: Systems, methods, and computer program products are provided for conducting mobile and online financial transactions. Methods include receiving financial transaction instructions, wherein the instructions comprise a first alias and a second alias; associating the first alias with at least one payment account, and the second alias with at least one recipient account; and communicating a financial transaction notification to a recipient associated with the at least one recipient account.

Abstract: Despite the ubiquity of databases and their importance in digital forensic investigations, the area of database forensics has received very little research attention This paper presents an algorithm for reconstructing a database for forensic purposes Given the current instance of a database and the log of modifying queries executed on the database over time, the database reconstruction algorithm determines the data that was present in the database at an earlier time The algorithm employs inverse relational algebra operators along with a relational algebra log and value blocks of relations to perform database reconstruction Illustrative examples are provided to demonstrate the application of the algorithm and its utility in forensic investigations

Abstract: A server executing a social media identity and discovery application and method are provided that scan social networking sites for communications. The target content is found with content indicators when communications are put on a social networking site. The content is recorded and evaluated. If the identified content is contextually significant, the alias and the private user data are correlated based on events, and a notification of the correlation is sent to an agent or a contact center system. The agent may verify that the identity of a poster has been accurately correlated with a customer record in the database. The agent or the system has the opportunity to respond to the communication, despite the anonymity of the poster on the social networking site.

Abstract: Alias detection has been the significant subject being extensively studied for several domain applications, especially intelligence data analysis. Many preliminary methods rely on text-based measures, which are ineffective with false descriptions of terrorists' name, date-of-birth, and address. This barrier may be overcome through link information presented in relationships among objects of interests. Several numerical link-based similarity techniques have proven effective for identifying similar objects in the Internet and publication domains. However, as a result of exceptional cases with unduly high measure, these methods usually generate inaccurate similarity descriptions. Yet, they are either computationally inefficient or ineffective for alias detection with a single-property based model. This paper presents a novel orders-of-magnitude based similarity measure that integrates multiple link properties to refine the estimation process and derive semantic-rich similarity descriptions. The approach is based on order-of-magnitude reasoning with which the theory of fuzzy set is blended to provide quantitative semantics of descriptors and their unambiguous mathematical manipulation. With such explanatory formalism, analysts can validate the generated results and partly resolve the problem of false positives. It also allows coherent interpretation and communication within a decision-making group, using this computing-with-word capability. Its performance is evaluated over a terrorism-related data set, with further generalization over publication and email data collections.

Abstract: Database management and security is implemented in a variety of embodiments. In one such embodiment, data sets containing sensitive data elements are analyzed using aliases representing sensitive data elements. In another embodiment, the sensitive data elements are stored in an encrypted form for use from a secure access, while the alias is available for standard access.

Abstract: While the use of pointers can be minimized by language mechanisms for data abstraction, alias avoidance and control, and disciplined software development techniques, ultimately, any verifying compiler effort must be able to verify code that makes use of them. Additionally, in order to scale, the verification machinery of such a compiler must use specifications to reason about components. This paper follows a natural question that arises from combining these ideas: can the general machinery of specification-based component verification also be used to verify code that uses instances of types that are more traditionally built-in, such as arrays and pointers? This paper answers the question in the affirmative by presenting a Location_Linking_Template, a concept that captures pointer behavior, and uses it to verify the code of a simple data abstraction realized using pointers. In this deployment, pointers have a specification like any other component. We also note that the concept can be extended and realized so that different systems can plug in alternative implementations to give programmers the flexibility to choose, e.g., manual memory management or automatic garbage collection depending on their performance concerns.

Abstract: A system and method for using a static or dynamically-generated alias to conduct financial transactions via a Near Field Communication Device at a merchant is provided. The system and method allows a user to provide an alias identifying the user in order to conduct transactions via a near field communication device without needing to transfer the user's account number. The method associates the alias with an account of the user. The alias may be a static alias or a dynamic alias. A dynamic alias is generated for a transaction based in part on a characteristic of the transaction. The method determines the account number associated with the alias and completes the transaction using the alias. The method may also evaluate the transaction to determine whether pre-determined rules are complied with and provide confirmation to the user and/or merchant that the transaction has completed.

Abstract: A system includes reception of a first query from a client device at a first database node of a database instance comprising two or more database nodes, the first query specifying a first database table which is partitioned among two or more of the two or more database nodes, determination of first partitioning metadata of the first database table, the first partitioning metadata usable to identify one of the two or more database nodes based on table key values, compilation of the first query at the first database node to generate first compiled code, and transmission of the first compiled code and the first partitioning metadata from the first database node to the client device.

Abstract: XML has recently emerged as the leading medium for data storage and data transfer over the World Wide Web due to its adaptable structure and flexibility in defining the tags. Many organizations had adopted XML as the principal facet in their online business applications. On the other hand, relational database is still widely used as the back-end database in most organizations. The diversity of these models need to be taken into account to ensure transparent and seamless integration. In this paper, we propose s-XML, an effective mapping scheme to bridge XML and relational database. Experimental results indicate that (1) s-XML is robust in terms of database storage and data loading; (2) s-XML processes query efficiently for complex chain and twig queries; and (3) s-XML is able to support large and skew-structured dataset as compared to relational DTD, Attribute and Edge approaches.

Abstract: There are two obvious methods to map a two-dimension relational database table onto a one-dimensional storage interface: store the table row-by-row, or store the table column-by-column. Traditionally, database system implementations and research have focused on the row-by row data layout, since it performs best on the most common application for database systems: business transactional data processing. However, there are a set of emerging applications for database systems for which the row-by-row layout performs poorly. These applications are more analytical in nature, whose goal is to read through the data to gain new insight and use it to drive decision making and planning. In this paper, we study the poor performance of row-by-row data layout for these emerging applications, and evaluate the column-by-column data layout opportunity as a solution to this problem. The solution will be analyzed and represented by graph. At the end of the paper we will see the comparative performance of Oracle 10g and MSSQLServer database.

Abstract: This paper proposed a feature selection with privacy preservation in centralized network. Data can be preserved for privacy by perturbation technique as alias name. In centralized data evaluation, it makes data classification and feature selection for data mining decision model which make the structural information of model in this paper. The application of gain ratio technique for better performance of feature selection has taken to perform the centralized computational task. All features don‟t need to preserve the privacy for confidential data for best model. The chi-square testing has taken for the classification of data by centralized data mining model using own processing unit. The alias data model for privacy preserving data mining has taken to develop the data mining technique to make best model without violating the privacy individuals. The proposed process of data miner task has made best feature selection and two type experimental tests have taken in this paper.

Abstract: A method includes receiving a target Uniform Resource Locator (URL), receiving a scan of a Quick Response (QR) code, where the QR code includes an alias URL, and mapping the alias URL encoded on the QR code to the target URL.

Abstract: Entity aliases commonly exist and accurately detecting these aliases plays a vital role in various applications. In this paper, we use an active-learning-based method to detect aliases without string similarity. To minimize the cost on pairwise comparison, a subset-based method restricts the alias selection within a small-scale entity set. Within each generated entity set, an active learning based logistic regression classifier is employed to predict whether a candidate is the alias of a given entity. The experimental results on three datasets clearly demonstrate that our proposed approach can effectively detect this kind of entity aliases.

Abstract: The cloud database services are attractive for managing outsourced databases. However, the data security and privacy is a big concern hampering the acceptance of cloud database services. A straightforward way to address this concern is to encrypt the database, but an encrypted database cannot be easily queried.In this demo paper, we demonstrate that aggregate SQL queries with range conditions can be performed efficiently over encrypted databases, without decrypting the databases first, by using our new homomorphic encryption scheme. The techniques in this paper can be applied to existing Database Management Systems (DBMSs). Moreover, the techniques do not need to predetermine the maximum sum and number of data in one database table column. These features make our technologies suitable to manage long-standing and large encrypted databases.

Abstract: Physical design for shared-nothing databases includes decisions regarding the placement of data across a cluster of database servers. In particular, for each table in the database a distribution policy must be specified. In general, the choice of distribution policy affects the performance of query workloads significantly as individual queries may have to redistribute data on-the-fly as part of the execution. As is the case with a number of other physical design decisions, the problem is hard and poses substantial difficulties for database administrators. In this paper, we present FINDER, a design tool that optimizes data placement decisions for a database schema with respect to any given query workload. We designed FINDER with portability in mind: The tool is fully external to the target database system, i.e., does not require any code-level integration with the system, and avoids reverse engineering of query optimization techniques. Our experiments show FINDER converges quickly and delivers superior results compared to state-of-the-art solutions.

Abstract: A system and method for using an alias to conduct financial transactions at a merchant is provided. The system and method allows a user to provide an alias identifying the user or a business in order to conduct transactions without needing to know or provide actual account numbers. Aliases are associated with users and businesses and can be linked to financial accounts of the user and business. When the method determines that the user is attempting to conduct a transaction using the alias, the method determines the account number associated with the alias and completes the transaction using the alias. The method may also evaluate the transaction to determine whether pre-determined rules are complied with and provide confirmation to the user that the transaction has completed.

Abstract: This thesis presents a general model of access control. It uses a simple notion of an access permission token, which gives permission to reference an associated object. Sets of permission tokens ar ...

Abstract: Systems, methods performed by data processing apparatus and computer storage media encoded with computer programs for receiving user input specifying an alias of an intended communication recipient, comparing the specified alias with identities of one or more potential recipients identified based on implicit connections inferred from explicit information relating to the user, identifying a best matching recipient based on a result of the comparing, and initiating a communication instance with the identified best matching recipient.

Abstract: Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations.

Abstract: Static analysis cannot obtain the values of variables in actual program operation because it does not execute the code itself. It makes the detection of invalid arithmetic operation (IAO) in the field of static analysis difficult to achieve. This paper presents a practical model for IAO detection based on alias analysis. The model uses a triple to record information calculated in dataflow. In the process of dataflow analysis, we consider the alias relation of variables as one of the object of dataflow analysis. Through calculation of the dataflow statement involving alias relation, we can get a more accurate value of the variable. For inter-procedural analysis, we generate a procedure summary to record constraint of IAO. Experimental results show that this method can effectively reduce both false negatives and false positives of IAO, and improve test accuracy.

Abstract: Many celebrities and experts from various fields may have been referred by not only their personal names but also by their aliases on web. Aliases are very important in information retrieval to retrieve complete information about a personal name from the web, as some of the web pages of the person may also be referred by his aliases. The aliases for a personal name are extracted by previously proposed alias extraction method. In information retrieval, the web search engine automatically expands the search query on a person name by tagging his aliases for complete information retrieval thereby improving recall in relation detection task and achieving a significant mean reciprocal rank (MRR) of search engine. For the further substantial improvement on recall and MRR from the previously proposed methods, our proposed method will order the aliases based on their associations with the name using the definition of anchor texts-based co-occurrences between name and aliases in order to help the search engine tag the aliases according to the order of associations. The association orders will automatically be discovered by creating an anchor texts-based co-occurrence graph between name and aliases. Ranking support vector machine (SVM) will be used to create connections between name and aliases in the graph by performing ranking on anchor texts-based co-occurrence measures. The hop distances between nodes in the graph will lead to have the associations between name and aliases. The hop distances will be found by mining the graph. The proposed method will outperform previously proposed methods, achieving substantial growth on recall and MRR.

Abstract: Traditional alias analysis is expensive and ineffective for dynamic optimizations In practice, dynamic optimization systems perform memory optimizations speculatively, and rely on hardware, such as alias registers, to detect memory aliases at runtime Existing hardware alias detection schemes either cannot scale up to a large number of alias registers or may introduce false positives Order-based alias detection overcomes the limitations However, it brings considerable challenges as how software can efficiently manage the alias register queue and impose restrictions on optimizations In this paper, we present SMARQ, a Software-Managed Alias Register Queue, which manages the alias register queue efficiently and supports more aggressive speculative optimizations We conducted experiments with a dynamic optimization system on a VLIW processor that has 64 alias registers The experiments on a suite of SPECFP2000 benchmarks show that SMARQ improves the overall performance by 39% as compared to the case without hardware alias detection By scaling up to a large number (from 16 to 64) of alias registers, SMARQ improves performance by 10% Compared to a technique with false positives (similar to Itanium), SMARQ improves performance by 13% To reduce the chance of alias register overflow, the novel alias register allocation algorithm in SMARQ reduces the alias register working set by 74% as compared to a straightforward alias register allocation based on program order

Abstract: While database has large amount of data,the inquires will have a series of problems like system response time is too long and take up too many system resources.So the query optimization research on the mass of data based on Oracle database is necessary.It uses the various measures and methods to improve the response speed based on Oracle database such as reasonably designing the database structure,the use of the index,partition,SQL optimization method.In addition,pagination display the query results can also greatly improve query speed.Experiments show the optimization obviously improves the speed a lot.

Abstract: In this paper we have presented a loss-less compression technique namely H-HIBASE (compression enhancement of HIBASE technique using Huffman Coding). Due to disk based compression, H-HIBASE supports very large database with acceptable storage volume. Insertion, deletion and update mechanisms on the architecture have been presented and analyzed. The architecture executes query directly on compressed data and it is capable of executing all types of SQL queries. The experimental evaluation has been performed with synthetic and real data. The experimental result has been compared with DHIBASE and widely used Oracle database. We have evaluated the storage performance in comparison with DHIBASE and Oracle database. The storage performance that has been achieved in HHIBASE is 25 to 40 percent better than the Oracle database for real and synthetic data. The query performance that has been achieved in H-HIBASE is 10 to 25 percent better than that of DHIBASE.

Abstract: A method in gateway node (100) for handling an address of a resource of a device (110) in a communications network, the method comprising: generating a first alias representing the address of the device (110) resource,storing the generated alias, in association with the address, receiving a request from an application (120) including the address of the device (110) resource,translating the address to the stored alias, and forwarding the request including the alias to the device (110), thereby enabling the device to resolve the request by use of the alias in said request.

Abstract: Systems and methods for configuring an analog process alarm in digital control devices are provided. In one example embodiment, a system may include a logic editor configured to create templates, including one or more alias names for corresponding one or more analog alarm sub-variables associated with an analog process variable, within the digital control system; a human-machine interface configured to provide to a user an analog alarm virtual block diagram visualizing processing logic associated with the analog process variable within the digital control system and to receive from the user a request to select a template from the created templates; and a template generator configured to automatically generate, based on the selection of the template, the alias names for the corresponding analog alarm sub- variables of the analog process alarm. The alias names may be defined directly on the analog process variable.