Abstract: Queries may be accelerated with disjunctive equijoin conditions. A query is received and a disjunctive equijoin condition identified. Different strategies, such as creating a filter data structure for distinct equijoins may be implemented where the filter data structure is applied to the result of scan operations for the disjunctive equijoin conditions. These strategies may be incorporated into a query plan generated for the query, which is then executed to return a result for the query.

Abstract: A system is described. The system may include a storage device, which may include storage for data and a controller to write the data to the storage and to read the data from the storage. The storage device may also include an accelerator implementing at least one operation on files stored on the storage device. These operations may be drawn from a set including a merge operation and a split operation.

Abstract: Techniques for join elimination are described herein. Join elimination can identify and eliminate unnecessary joins in a query plan node. For example, join elimination can involve a semantic query optimization technique, which removes reference to a table whose columns are only referenced in join predicates if the joins do not filter/expand rows in the result. Such joins can cause significant performance issues on larger datasets if not optimized.

Abstract: A computer receives a visual specification, which specifies a data source, visual variables, and data fields from the data source. Each visual variable is associated with either data fields (e.g., dimension and/or measures) or filters. The computer obtains a data model encoding the data source as a tree of related logical tables. Each logical table includes logical fields, each of which corresponds to either a data field or a calculation that spans logical tables. The computer generates a dimension subquery for the dimensions and the filters. The computer also generates, for each measure, an aggregated measure subquery grouped by the dimensions. The computer forms a final query by joining the dimension subquery to each of the aggregated measure subqueries. The computer subsequently executes the final query and displays a data visualization according to the results of the final query.

Abstract: In response to identifying an update operation for a system table of a DBMS, a row that corresponds to the update operation is identified using a partial image of the update operation. A before image that corresponds to the row is gathered and a new before image of the row that reflects the update operation is generated by overlaying the before image with the partial image. In response to identifying a delete operation that relates to the system table, a row of the system table that corresponds to the delete operation is identified using an identifier of the delete operation. A before image that corresponds to this row is gathered. A new before image of the row of the system table that reflects the delete operation is generated by applying the delete operation to this before image.

Abstract: A record processing and storage system is operable to receive a plurality of row data that each indicate a batch number. Each of the plurality of row data is added to a pending row data pool. A plurality of pages is generated from the plurality of row data via a plurality of processing core resources. Each processing core resource in the plurality of processing core resources processing a corresponding subset of the plurality of row data by retrieving, in each time slice of a plurality of time slices, one row data from the pending row data pool with a most favorably ordered batch number of row data in the pending row data pool. Each processing core resource further processes the one row data in the in each time slice to participate in generation of at least one of the plurality of pages.

Abstract: A method is disclosed for a database system that includes a set of data blocks comprising records having attributes. The set of data blocks are instances of at least one block type. The block type is defined by a subset of one or more attributes of the attributes. An instance of the block type comprises records having one distinct group of values of the subset of attributes. The method includes detecting that a subset of one or more data blocks of the block type, of the set of data blocks, reached a first maximum number of records. The method includes determining an additional attribute of the attributes to define a new block type by the combination of the additional attribute and the subset of attributes that define the block type. The method includes creating one or more data blocks which are instances of the new block type.

Abstract: The present disclosure provides a method, system and computer program product for optimal query scheduling for resource utilization option. In an embodiment of the disclosure, a process for optimal query scheduling includes receiving in an information retrieval data processing system at a contemporaneous time, a request for deferred query execution of a specified query to a future time after the contemporaneous time. The method additionally includes determining a frequency of change of data corresponding to a field referenced in the specified query. Then, on condition that the frequency of change is below a threshold value, an intermediate time prior to the future time but after the contemporaneous time can be identified and the specified query scheduled for execution at the intermediate time instead of the future time. But, otherwise the specified query can be scheduled at the future time as originally requested.

Abstract: The storage device includes a first memory, a process device that stores data in the first memory and reads the data from the first memory, and an accelerator that includes a second memory different from the first memory. The accelerator stores compressed data stored in one or more storage drives storing data, in the second memory, decompresses the compressed data stored in the second memory to generate plaintext data, extracts data designated in the process device from the plaintext data, and transmits the extracted designated data to the first memory.

Abstract: A method for execution by a record processing and storage system includes receiving a plurality of records and corresponding row numbers. Pages are generated from the received records. Page metadata is generated for each page that includes row number span data based on row numbers of the records included in each page. Pairs of pages are identified in the plurality of pages based on having row number span data in their page metadata that include a row number span overlap. For each pair of pages, row number span data is updated for a first page in the pair by removing the row number span overlap with a second page in the pair. Reads of pages are performed based on their row number span data. Only records of each first page of each pair of pages having row numbers that are within the updated row number span data are read.

Abstract: A method for estimating the selectivity of a database base table predicate, the cardinality of a join, and the cardinality of an aggregation. The method includes receiving a database query, the query comprising one or more query predicates and referencing one or more database tables. One or more join indexes are identified, the join index(es) defined on respective database tables referenced by the database query. The join index(es) comprises one or more join index predicates, and includes one or more join columns in its select list. The row count selected by the query predicates is calculated at least partly using the row count or statistics of the one or more join indexes. The selectivity of the base table predicate is calculated at least partly from the calculated row count. The cardinality of the join is estimated at least partly from the row count and statistics of the identified join index(es).

Abstract: A table creation request pertaining to a table in a database maintained on a multi-node data partitioning landscape that comprises a plurality of processing nodes can specify a number of partitions to be generated. At run time, a currently available number of processing nodes in the multi-node data partitioning landscape can be queried, and this currently available number of processing nodes can be compared with the specified number of partitions to be generated for the created table. The table can be generated with the specified number of partitions such that the generated partitions are located across the plurality of partitions according to a load balancing approach if the number of processing nodes equals the number of partitions to be generated or according to other information in the table request if the number of processing nodes does not equal the specified number of partitions.

Abstract: A mechanism is provided for secure data access in a parallel processing system. A database having two tables is provided. A subset of the tables' primary key attributes is considered sensitive. A first user is authorized to access the primary key's sensitive attribute in an unmasked format, while a second user is authorized to access same data in a masked format. Two security tables are generated having a plurality of entries mapping the values of the primary key attribute in the unmasked format to the values of the primary key attribute in the masked format. A security view is generated joining the two security tables. The security view grants the first user access to the values of the primary key's sensitive attribute in the unmasked format only and grants the second user access to the values of the primary key's sensitive attribute in the masked format only.

Abstract: Described herein is a technology for facilitating optimization of database queries is described herein. In some implementations, a first query is received. At least one scenario for optimization is automatically recognized by detecting specific syntax in the query. A second query is then automatically generated by re-writing the first query using a pre-defined operation corresponding to the recognized scenario.

Abstract: Embodiments of the present invention provide a database processing system for efficient partitioning of a database table with column-major layout for executing one or more join operations. One embodiment comprises a method for partitioning a database table with column-major layout, partitioning only the join-columns by limiting the partitions by size and number, executing one or more join operations for joining the partitioned columns, and optionally de-partitioning the join result to the original order by sequentially writing and randomly reading table values using P cursors.

Abstract: Methods, program products, and systems for filtering a distributed join are described. A computing device can receive a database join request to join a first table stored on a first system and a second table stored on a second system to create a related data set. The join request can include a filtering condition for filtering the related data set. The system can divide the filtering condition into a first sub-condition and a second sub-condition, and send the first sub-condition and a second sub-condition to the first system and second system, respectively. The first system and second system can then perform filtering locally, and send filtered intermediate result to the computing device.

Abstract: A method includes performing a query of a database. The query includes joining a first Domain-Model-sub-class table with a Domain-Model table based on identity attributes present in both the first Domain-Model-sub-class table and Domain-Model table to produce a first joined table. The query further includes joining the first joined table with an access control list (ACL) entry table based on an ACL object identity attribute present in both the first joined table and the ACL entry table to produce a second joined table. The query also includes joining the second joined table with a second Domain-Model-sub-class table based on an ACL security identity present in both the second joined table and the second Domain-Model-sub-class table to produce a third joined table.

Abstract: An invention is disclosed for scalable billing usage data storage. In an embodiment, users are billed on a monthly cycle. The data storage is divided into two partitions. First, the data is divided into an “L1” partition for each day of the billing cycle. Within each L1 partition, data is further divided into “L2” partitions based on a customer's subscription ID. Through such partitioning, each customer's billing usage data for a billing cycle is entirely contained within a single L2 partition, and that data may be retrieved without spanning partitions.

Abstract: A table creation request pertaining to a table in a database maintained on a multi-node data partitioning landscape that comprises a plurality of processing nodes can specify a number of partitions to be generated. At run time, a currently available number of processing nodes in the multi-node data partitioning landscape can be queried, and this currently available number of processing nodes can be compared with the specified number of partitions to be generated for the created table. The table can be generated with the specified number of partitions such that the generated partitions are located across the plurality of partitions according to a load balancing approach if the number of processing nodes equals the number of partitions to be generated or according to other information in the table request if the number of processing nodes does not equal the specified number of partitions.

Abstract: A computer-implemented method for analyzing and representing interpersonal relations includes: receiving, in a computer system, a user input requesting a representation of interpersonal relations regarding a person; executing, based on the user input and in a relational database, a relational-database query that selects relations involving the person, and that selects other persons involved in any of the selected relations, wherein the relational-database query is performed for each of the selected other persons until a maximum number of steps; and providing the representation of interpersonal relations in response to the user input, the representation indicating at least persons selected by the relational-database query.

Abstract: Apparatus, systems, and methods may operate to receive an original query plan, to transform the original query plan into an equivalent executable compact query plan, and to store the compact query plan on a machine readable device. Further activities may include computing maximal source sub-queries associated with the compact query plan, and computing semi-join reductions of the maximal source sub-queries to provide an executable derivative query plan, which may also be stored on a machine readable device. Additional apparatus, systems, and methods are disclosed.

Abstract: A hash integration system includes a hash join module including build and probe inputs. A hash aggregation module may aggregate on the probe input of the hash join module, and a hash table generation module may generate an integrated hash table including a record with values from the build and aggregated probe inputs. The hash join module may join the build and aggregated probe inputs to form a joined output.

Abstract: Enterprise systems, methods and computer program products are disclosed for providing value-based positioning for outer join database queries in an enterprise resource planning system operating on a specially programmed computer server. The computer implemented method comprises; receiving a query at a server and processing the query for inner join and then evaluating a returned value for Order by direction and whether the current row returns NULL. Depending on forward paging and reverse paging for outer join, the process involves changing an inequality operator depending on the evaluated Order by direction and whether the current row is NULL. The process for inner join and outer join queries is implemented on an application object server including a kernel instance, a query framework and query generation model and a data access layer engine to a database of the enterprise resource planning system.

Abstract: In accordance with the teachings described herein, systems and methods are provided for performing index joins. A database management application may receive an instruction to perform an index join operation between columns in a first table and a second table, wherein the database management application does not have direct access to an index of the first table or the second table for performing the index join operation. A query may be automatically generated by the database management application, wherein the query includes a where clause equality expression that equates an indexed column of the second table with a parameter or updatable constant. The database management application may substitute a value from a row of the first table may for the parameter or updatable constant, and cause the query to be executed on the index of the second table to fetch any one or more rows of the second table that satisfy the where clause by having an index value that matches the substituted value.

Abstract: A variety of query optimization techniques are described herein. A first query optimization technique, referred to herein as non-empty transformation, may be applied to queries that specify one or more measures, a dimensional context within which the measure(s) are to be evaluated, and a filter condition specifying that rows with only empty measure values be excluded from a result set. The non-empty transformation technique enables such queries to be rewritten into another format that can be executed more efficiently than the original queries. A second query optimization technique described herein involves restructuring an operator tree representation of a query so as to avoid unnecessary duplicated evaluation of extension columns. A third query optimization technique described herein automatically selects a minimum number of join columns having the lowest cardinality for implementing a join between two tables.

Abstract: Various systems and methods for financial analysis are provided. A system is provided comprising a first node comprising a public facing data store in communication with a private facing data store, wherein the first node further comprises a cooperative lookup module configured to locate a second node, a secure data connection between the first node and the second node, and wherein the first node is configured to request processed internal data from the second node.

Abstract: Techniques are provided for an accelerated join process in a relational database management system. The disclosed join method partitions a plurality of input records using a hash-based technique to form a plurality of partitioned blocks. The partitioned blocks are sorted to form sorted partitioned blocks. The sorted partitioned blocks are then compressed to form a plurality of compressed blocks of records. The compressed blocks of records are stored for each partition in a storage system. The compressed blocks of records associated with a pair of partitions can then be loaded into a main memory. The loaded compressed blocks of records are then decompressed and the decompressed blocks of records are merged into associated merged partitions. Finally, two of the merged partitions are joined by comparing records from each merged partition. In a multi-threaded implementation, multiple pairs of merged partitions can be joined in parallel.

Abstract: Enterprise systems, methods and computer program products are disclosed for providing caching of data retrieved from joined tables and an inheritance table hierarchy of a database in an enterprise. The computer implemented method comprises creating a queue of cursors of a statement associated with a database; evaluating a cursor of the queue and marking as one of a unique record and an object of an inheritance table; and, if a cursor of the queue is marked as one of a unique record and a unique object, then, storing data associated with one of the unique record and object in a data cache for subsequent retrieval, thus avoiding costly network calls. If the process leaves a cursor unevaluated, the method retrieves data from an enterprise database associated with the statement. The process is implemented on an application object server including a data access layer and a kernel instance.

Abstract: A query that is submitted to a database is analyzed so as to determine a join order restriction. The join order restriction is associated with a join between two tables of a plurality of tables of the database that participate in the query. The join order restriction constrains its associated join to be executed prior to another join of the query. At least one join plan is generated, the join plan being constrained by the join order restriction. Different join plans include different join orders. A join plan is selected from among the join plans for execution of the query.

Abstract: According to one embodiment, a file system (FS) of a storage system is partitioned into a plurality of FS partitions, where each FS partition stores segments of data files. In response to an input and output (IO) request for accessing a first of the FS partitions, a second of the FS partitions is selected that is currently in a ready state for access. The second FS partition is then removed from the ready state for access. The first FS partition is brought into a ready state for access.

Abstract: Methods and systems for performing a query over joined tables in the context of inexact matching provide efficient search engine functionality. The systems and methods are used to perform an efficient query on a parent table and joined child tables. Search grams are determined based on the query and parent records and child records are scanned for the search grams. Gram scores are computed based on a degree of matching between the parent and child records and the search grams.

Abstract: Embodiments of the invention relate to improved input/output efficiency for online analysis processing in a relational database. An aspect of the invention includes selecting a table from a relational database. The table is split by column into sub-tables, with at least one of the sub-tables including at least two columns. Each sub-table is written into a corresponding table of a row-based storage database.

Abstract: Method and apparatus for analyzing a document against a managed research domain are provided. In one embodiment, a managed research domain provides an infrastructure where logical statements in research documents stored in the research domain repository are quantified and semantically analyzed. A user may submit a draft research document for analysis against the managed research domain to compare the draft against the current research knowledge in particular topics. The draft research document is annotated to reflect how the logical statements in the draft compare to the statements made on similar topics in the managed research domain.

Abstract: In one embodiment, a method for storing a snapshot of data in a database includes creating a root indirection set for the snapshot of data and maintaining a deleted pattern in the database. The deleted pattern is not removed from a pattern set for a node in a table of the database when the pattern is deleted in the database. The method includes providing access to the snapshot of data using the created root indirection set, the created root indirection set accessing the deleted pattern.

Abstract: A method for storing and retrieving data in a storage node of a data store and storage node of a data store, storing in main-memory at least one segment of a relational table The storage node includes at least one computational core running at least one scan thread each dedicated to the scanning of one of the at least one segment. At least one scan thread uniquely, continuously and exhaustively scans the dedicated segment of the relational table. The storage node receives and processes batches of query and update operations for the at least one segment of the relational table. The query and update operations of a batch are re-indexed at beginning of each scan by the scan thread. Then, the indexed query and update operations of a batch are independently joined to data records of said segment that match with predicates of the indexed query and update operations.

Abstract: Various embodiments illustrated and described herein pertain to at least one of systems, methods, databases, and instructions stored on computer-readable mediums for data allocation identification. One method according to some embodiments includes determining a database allocation of an entity and identifying a domain directly associated with the entity. The method may further include determining at least one header table field directly associated with the entity by identifying a directly associated type definition linked to the directly associated domain, wherein the directly associated type definition refers to the header table field, wherein each header table field is in a corresponding header table. This, and other embodiments, are illustrated and describe in detail herein.

Abstract: A data join system of the present invention includes a table determination unit 11 selecting a record b as a join target if a value of a key item included in a record a acquired by a data write unit from a table A falls within a first predetermined range set based on a value of a key item included in the record b stored in a table B, a data join unit joining the selected record b with the record a to generate a record c, and a data write unit storing the record c into a table C. Thus, the success rate of data join can be improved while the accuracy of join of the record b and the record a to be joined is improved.

Abstract: In certain examples, a mechanism is provided for automatically performing join operations. Source data is received and a metadata model is received. The metadata model includes a hierarchical structure. The source data is aligned to the hierarchical structure in the metadata model to form a source data hierarchy. Based on the source data hierarchy, the source data is joined to geocoded information.

Abstract: Described is associating metadata with different sources of data (e.g., database tables) that allows a single view of data from the sources to be created. An administrator creates baseviews corresponding to database tables and associates metadata with the baseviews, including primary key metadata for the baseviews and meta-tags for one or more of the columns of each baseview. A user selects fields (corresponding to table columns) from a starting baseview, along with fields from any other baseview that has metadata that matches the starting baseview's metadata. A join mechanism automatically creates the view if a metadata match is detected.

Abstract: Techniques for accelerating an operation in a database management system are provided. The techniques include reading data pertaining to a database management system operation from a storage unit, sending the database management system operation data to an accelerator unit, and processing the database management system operation data via the accelerator unit, wherein processing the data via the accelerator unit comprises using a multithreaded execution unit and compression hardware to perform the database management system operation with reduced execution time.

Abstract: Systems, methods, and devices for sorting and processing various types of graph data are described herein. Partitioning graph data into master data and associated slave data allows for sorting of the graph data by sorting the master data. In another embodiment, promoting a data bucket having a first data bucket size to a data bucket having a second data bucket size greater than the first data bucket size upon reaching a memory limit allows for the reduction of temporary files output by the data bucket.

Abstract: Architecture that maps document data (e.g., XML-extended markup language) into columns of one table, thereby avoiding schema normalization problems through special data storage. Moreover, an algorithm is described that can translate a query (e.g., in XPath (XML path language), a query language for navigating through document elements and attributes of an XML document) into a relational algebra query of the document column representation. Based on the characteristics of the new mapping, query rewriting rules are provided that optimize the relational algebra query by minimizing the number of joins. The mapping of XML documents to the table is based on a summary structure and a hierarchical labeling scheme (e.g., ordpath) to enable a high-fidelity representation. Annotations are employed on the summary structure nodes to assist in mapping XML elements and attributes to the table.

Abstract: Various embodiments of systems and methods for join tuple assembly by partial specializations are described herein. The join tuple assembly by partial specializations is a phase of the method for join query evaluation by semi-join reduction. By using partial specializations of the non-join part of the WHERE clause of a join query and matching sets, the join tuple assembly is organized in a manner that all computations are necessary, none are repeated, and failure to complete a partial join tuple to a full tuple is detected as early as possible. The method can be applied to inner and outer joins, and to arbitrary join graphs and non-join conditions in the WHERE clause. It can also be used outside the context of semi-join reductions.

Abstract: The present invention is directed to methods and systems for rendering perceivable stimuli representative of information processing by a multi-tenant architecture that pre-fetches a portion of a subset of data on a multi-tenant architecture and emulates a result set of data in accordance with a report definition. To that end the method comprises identifying a subset of data on the multi-tenant architecture that is subject to a report definition. A portion of the subset is pre-fetched and analyzed to emulate a result. The emulated result is transmitted to a computer system of a user of the multi-tenant architecture. Perceivable stimuli is generated on the user computer system, in response to receiving the emulated result.

Abstract: A data repository system and method are provided. A method in accordance with an embodiment includes an operation that can be used to port data from one or more existing database partitions to new database partitions according to a minimally progressive hash. The method can be used to increase the overall size of databases while a system runs hot, with little or no downtime.

Abstract: A processor is operated to combine a first row of a dimension table in a data warehouse with a second row in the dimension table. The result is a combined row that includes a row identification key for the first row and a row identification key for the second row. The row identification key for the first row joins the combined row to fact data from a prior time period. The second row corresponds to a current time period that is later than the prior time period. The processor is also operated to join at least a portion of the combined row to at least a portion of the corresponding row in a fact table associated with the dimension table. The fact data from the prior time period is included in the corresponding row in the fact table.

Abstract: In a database system, a query to perforin an ordered analytic function is received. The query contains a clause specifying creation of dynamic partitions, where the clause contains a partitioning condition to specify the dynamic partitions. During processing of the query, the dynamic partitions are identified based on evaluating the partitioning condition.

Abstract: Architecture which provides that certain data-bound objects in the report can be configured by the report author to use data from a specific query result rather than take data from the containing data bound object. The report author defines a relationship between the data in the contained object and the data in the container, allowing instances of the descendant object to be correlated with instances of the ancestor object. This relationship can be either explicit with join conditions or implicit due to an intrinsic hierarchical relationship between the query results.

Abstract: A system and associated method for automatically processing keyword for video content. The video content contains image frames and an audio stream. An image pattern table for image patterns from the image frames and a word pattern table for word patterns from the audio stream are generated by use of respective pattern names provided by pattern recognition tools. Each pattern is associated with a respective count indicating a number of appearances of each pattern. A respective weight of each pattern is calculated as a relative frequency of each pattern. The image pattern table and the word pattern table are merged to generate a keyword list. A predefined number of most frequently appeared patterns are selected by examining the respective weight of each pattern and metadata associated with the video content are updated to utilize pattern names of the selected patterns as keyword for web searches.

Abstract: A database management program capable of joining three or more tables in a manner that the storage capacity of a memory is more efficiently used. The database management program is configured (programmed) as a program that creates some working tables (WT2-WT4) which hold the information (record identifiers in each table) with which a table in which two tables are joined can be created, and then, by collecting required item values from each table based on the information in the working tables, creates the table whose creation is instructed.