Based On Joins Patents (Class 707/714)
-
Patent number: 8682885Abstract: Systems and methods for combining data objects are provided. A computer system may analyze each of the data objects, identify at least one possible combination operation between the data objects, and present the identified combination operation to a user interface. The identified combination operation may include a union or a join operation. The computer system may further determine a combination grade associated with the identified combination operation and present the combination grade to the user interface. Subsequently, the computer system may receive a selection of a particular presented combination operation via the user interface and execute the particular combination operation between the data objects.Type: GrantFiled: May 15, 2012Date of Patent: March 25, 2014Assignee: SAP AGInventors: David Lotan Bolotnikoff, Netanel Slomianski, Natan Teren, Dmitry Gorenchteine, Tal Sapan, Udi Cohen, Kobi Sasson, Shachar Soel
-
Publication number: 20140074818Abstract: A system joins predicate evaluated column bitmaps having varying lengths. The system includes a column unifier for querying column values with a predicate and generating an indicator bit for each of the column values that is then joined with the respective column value. The system also includes a bitmap generator for creating a column-major linear bitmap from the column values and indicator bits. The column unifier also determines an offset between adjacent indicator bits. The system also includes a converter for multiplying the column-major linear bitmap with a multiplier to shift the indicator bits into consecutive positions in the linear bitmap.Type: ApplicationFiled: September 13, 2012Publication date: March 13, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ronald J. Barber, Min-Soo Kim, Jae Gil Lee, Sam S. Lightstone, Guy M. Lohman, Lin Qiao, Vijayshankar Raman, Richard S. Sidle
-
Patent number: 8671091Abstract: For a database query that defines a plurality of separate snowflake schemas, a query optimizer computes separately for each of the snowflake schemas a logical access plan for obtaining from that schema's tables a respective record set that includes the data requested from those tables by that query. The query optimizer also computes a logical access plan for obtaining the query's results from the record sets in which execution of the logical access plans thus computed will result.Type: GrantFiled: August 2, 2006Date of Patent: March 11, 2014Assignee: Hewlett-Packard Development Company, L.P.Inventors: Mitch Cherniack, Shilpa Lawande, Nga Tran
-
Publication number: 20140067789Abstract: A method, apparatus, and stored instructions are provided for transforming a query representation by unnesting a predicate condition that is based on whether or not a result exists for a subquery of the predicate condition. An initial query representation is received. The initial query representation represents an initial query that includes an EXISTS-equivalent predicate or a NOT-EXISTS-equivalent predicate and at least one other predicate in a disjunction. The initial query representation is transformed into a semantically equivalent transformed query representation that represents a transformed query. The transformed query includes, instead of the EXISTS-equivalent predicate or a NOT-EXISTS-equivalent predicate, a join operator that references the data object.Type: ApplicationFiled: September 4, 2012Publication date: March 6, 2014Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Rafi Ahmed, Chun-Chieh Lin, Mohamed Zait
-
Publication number: 20140067790Abstract: A computer-implemented method is provided for constructing a minimum superset of data that complies with referential completeness as well as other specified data relationships. Given extraction criteria for the data, an iterative process analyzes the database for records to be included in the minimal superset. The iterative process includes: selecting a given table from a listing of tables implicated by the extraction criteria; identifying tables in the relational database having either a parent or a child relationship with the given table; evaluating concurrently and asynchronously each of the identified tables; and repeating these steps for each of the tables in the listing of tables.Type: ApplicationFiled: September 5, 2012Publication date: March 6, 2014Applicant: Compuware CorporationInventor: Andrew Lipin
-
Publication number: 20140067791Abstract: A system and method for improving performance of join operations is disclosed. The method in one embodiment includes building a graph of vertices and edges, which represent the tables and join conditions for a particular database schema. The method then traverses the graph to find a set of candidate join operations. The method further includes selecting from the set of subset of join operations that makes the best use of a given amount of memory, which means finding a collection of denormalizations which when residing in memory provide the most benefit and the least cost for the given amount of memory. The method then deploys the denormalizations so that current queries in a query processing system can use them instead of actually performing the joins.Type: ApplicationFiled: September 6, 2012Publication date: March 6, 2014Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Sam Idicula, Sabina Petride, Nipun Agarwal
-
Patent number: 8661019Abstract: According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.Type: GrantFiled: January 28, 2010Date of Patent: February 25, 2014Assignee: International Business Machines CorporationInventors: Latha Sankar Colby, Quanzhong Li, Fatma Ozcan, Mir Hamid Pirahesh, Eugene J. Shekita, Zografoula Vagena
-
Patent number: 8650181Abstract: In one embodiment the present invention includes an OLAP execution model using relational operations. In one embodiment, the present invention includes, a method comprising receiving a first query in an online analytic processor (OLAP) executing on one or more computers, the OLAP generating and comprising a model specifying a graph defining a plurality of nodes and a plurality of tiers, each node corresponding to a different operation on data. A second query is generated by the OLAP. The second query includes a plurality of layered subqueries each corresponding to one of the nodes in the graph for specifying the different operations on data. The second query is received in a relational engine coupled to the datastore. The relational engine executes the second query, and in accordance therewith, retrieves data.Type: GrantFiled: November 22, 2010Date of Patent: February 11, 2014Assignee: SAP AGInventors: Stefan Dipper, Erich Marschall, Tobias Mindnich, Daniel Baeumges, Christoph Weyerhaeuser
-
Publication number: 20140032526Abstract: In one example embodiment, a method is implemented to relink a data item. The method includes identifying that a data item, referenced by a referencing document, is absent from a data item location for the data item indicated by the referencing document. User preference data, indicating a designated relink location to search for absent data items, is accessed. The relink location is searched for the absent data items. Another example embodiment may include a method to relink a current data item to a replacement data item location by accessing user preference data and searching a relink location for a replacement data item in accordance with the relink location indicated by the user preference data.Type: ApplicationFiled: September 18, 2008Publication date: January 30, 2014Applicant: Adobe Systems IncorporatedInventors: Lance D. Bushore, Michael Easter, Thomas M. McDonald
-
Patent number: 8639664Abstract: Systems, methods, apparatus, and computer program products are provided for accessing, navigating, and displaying multiple versions of claims in an efficient and customer-friendly manner. In various embodiments, claims can be processed and stored such that they can be displayed via an interface in a graphical format (e.g., textual, circular, hierarchical, etc.).Type: GrantFiled: March 29, 2012Date of Patent: January 28, 2014Inventors: Tracy Ann Weber, Mark Galik, Christine Belanger
-
Publication number: 20140012835Abstract: Techniques are disclosed for generating statistical views in a database system. In one embodiment, a request is received to execute a database workload. One or more constraints pertaining to executing the database workload is retrieved. The database workload is evaluated to generate multiple statistical view candidates. The statistical view candidates are refined based on the one or more constraints. One or more statistical views are then generated based on the refined statistical view candidates.Type: ApplicationFiled: May 3, 2013Publication date: January 9, 2014Applicant: International Business Machines CorporationInventor: International Business Machines Corporation
-
Patent number: 8626744Abstract: Methods and apparatus, including computer program products, implementing and using techniques for executing a query in a computer to retrieve data from a relational database stored on a data storage device. A query is received that contains a CASE expression having one or more subqueries. A query execution plan is generated. The query execution plan uses a parameterized union all operator to keep the semantics of the CASE expression, and a nested loop join operator to drive data across the section of the query execution plan that executes the CASE expression without performing any join operations. The generated query execution plan is executed in the computer to retrieve data from the relational database.Type: GrantFiled: January 26, 2012Date of Patent: January 7, 2014Assignee: International Business Machines CorporationInventors: Qi Cheng, John F. Hornibrook, Jose A. Saborit, David C. Sharpe, Calisto P. Zuzarte
-
Publication number: 20140006379Abstract: 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.Type: ApplicationFiled: June 29, 2012Publication date: January 2, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Stefan Arndt, Gopi K. Attaluri, Ronald J. Barber, Guy M. Lohman, Lin Qiao, Vijayshankar Raman, Eugene J. Shekita, Richard S. Sidle
-
Publication number: 20140006380Abstract: 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.Type: ApplicationFiled: August 24, 2012Publication date: January 2, 2014Applicant: International Business Machines CorporationInventors: Stefan ARNDT, Gopi K. Attaluri, Ronald J. Barber, Guy M. Lohman, Lin Qiao, Vijayshankar Raman, Eugene J. Shekita, Richard S. Sidle
-
Patent number: 8620899Abstract: Techniques for generating a set of one or more materialized query table (MQT) candidates for a workload are provided. The techniques include receiving a workload, wherein the workload comprises a set of one or more queries, generating one or more best matching MQTs (BMQTs) based on one or more query blocks of the one or more queries by removing syntax that is not qualified for a MQT re-write, determining one or more frequently used multi-joins in the workload, using the one or more BMQTs and the one or more frequently used multi-joins to generate a set of one or more workload MQTs (WMQTs), and grouping one or more WMQTs and one or more BMQTs into one or more groups to merge into a set of a smaller number of MQTs and to cover the workload.Type: GrantFiled: February 9, 2010Date of Patent: December 31, 2013Assignee: International Business Machines CorporationInventors: Dongsheng Chen, Hong Min, Terence P. Purcell, Yefim Shuf, Xiaobo Wang, Zhongliang Zhang
-
Publication number: 20130346389Abstract: In accordance with embodiments, there are provided techniques for processing group membership data in a multi-tenant database system. These techniques for processing group membership data in a multi-tenant database system may enable embodiments to provide great flexibility to a tenant of the architecture to select the content that may be perceived by the tenant users while allowing the owner of the architecture control over the content.Type: ApplicationFiled: June 12, 2013Publication date: December 26, 2013Applicant: salesforce.com, inc.Inventors: Scott Yancey, Kedar Doshi, Yongsheng Wu
-
Patent number: 8612422Abstract: A method and system for rewriting Structured Query Language (SQL) statements. A SQL statement having search criteria including conditions pertaining to fields in database tables is received. A table from the SQL statement listing all combinations of the search criteria is created, every combination reflecting a subset of information used to determine combined results. A set of patterns among the possible combinations of the SQL statement based on the fields referenced in the combinations is identified. The table based on the set of patterns is sorted. Based on the sorting, the table is divided into temporary tables which are joined with the SQL statement. New temporary tables are generated. Each new temporary table includes results of a search conducted using a separate portion of the SQL statement as joined with the set of temporary tables. All results from the new temporary tables are combined into a single result table.Type: GrantFiled: March 21, 2012Date of Patent: December 17, 2013Assignee: International Business Machines CorporationInventors: Howard S. Bloom, Roy Froehlich, Thomas A. Jobson, Jr., Edith A. Kanyock, Charles F. Matula, Arnold M. Rosenberg
-
Publication number: 20130332449Abstract: The present invention provides a computer-implemented code generation system that generates data processing code from a directed acyclic graph (DAG). The generated code is both declarative and procedural, and can be run in a relational database or in a Map Reduce implementation using Apache Pig. Each node of the DAG specifies operations performed on tabular data that can be stored in a delimited plain text file, a spreadsheet, or a relational database.Type: ApplicationFiled: June 6, 2013Publication date: December 12, 2013Inventors: John David Amos, Oleg Merlugov
-
Patent number: 8606794Abstract: A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and (1338) updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.Type: GrantFiled: March 4, 2013Date of Patent: December 10, 2013Assignee: AT&T Intellectual Property II, L.P.Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amelie Marian-Guerrier, Divesh Srivastava
-
Publication number: 20130318067Abstract: Techniques are provided for hardware-accelerated relational joins. A first table comprising one or more rows is processed through a hardware accelerator. At least one join column in at least one of the one or more rows of the first table is hashed to set at least one bit in at least one bit vector. A second table comprising one or more rows is processed through a hardware accelerator. At least one join column in at least one of the one or more rows of the second table is hashed to generate at least one hash value. At least one bit vector is probed using the at least one hash value. A joined row is constructed responsive to the probing step. The row-construction step is performed in the hardware accelerator.Type: ApplicationFiled: May 23, 2012Publication date: November 28, 2013Applicant: International Business Machines CorporationInventors: Bharat Sukhwani, Sameh W. Asaad, Hong Min, Matthew S. Thoennes, Gong Su
-
Publication number: 20130311443Abstract: Systems and methods for combining data objects are provided. A computer system may analyze each of the data objects, identify at least one possible combination operation between the data objects, and present the identified combination operation to a user interface. The identified combination operation may include a union or a join operation. The computer system may further determine a combination grade associated with the identified combination operation and present the combination grade to the user interface. Subsequently, the computer system may receive a selection of a particular presented combination operation via the user interface and execute the particular combination operation between the data objects.Type: ApplicationFiled: May 15, 2012Publication date: November 21, 2013Applicant: SAP AGInventors: David Lotan Bolotnikoff, Netanel Slomianski, Natan Teren, Dmitry Gorenchteine, Tal Sapan, Udi Cohen, Kobi Sasson, Shachar Soel
-
Publication number: 20130311442Abstract: Systems and methods are provided for performing a database query. After receiving an identification of data item components and associations between the data item components, wherein the data item components include a measure and a category, a query generation system creates and executes a database query that comprises one or more Uqueries, wherein each Uquery comprises a Mx segment subquery and a U0 segment subquery. The Mx segment subquery is associated with a table that contains the measure, a table that contains columns for a calculated measure, or a correlated table, and the U0 segment subquery is associated with a table that contains the category, a table that contains columns for a calculated category, a dependent measure table, or a dependent filter table. The query generation system can generate a virtual results table by aggregating Uquery results from one Uquery with Uquery results from another Uquery.Type: ApplicationFiled: May 15, 2012Publication date: November 21, 2013Inventors: Thomas P. Weber, Frederick J. Levine, James P. Kelley
-
Publication number: 20130311444Abstract: An apparatus for conducting a hierarchical join on a hierarchically clustered data stream is disclosed. The apparatus may include a memory storing query conditions that each determine whether a Structured Query Language query is suitable for performing a non-buffering read operation on a hierarchical data storage. A processor in communication with the memory may be configured to receive a Structured Query Language (“SQL”) query from a client device and evaluate the SQL query for one or more of the query conditions stored in the memory. When the processor determines that the SQL query satisfies one or more of the query conditions, the processor may then perform a non-buffering read operation on the hierarchical data storage to obtain a hierarchically clustered data stream. The hierarchically clustered data stream may be evaluated to obtain a plurality of record results, which may be transmitted to the client device.Type: ApplicationFiled: March 13, 2013Publication date: November 21, 2013Applicant: Google Inc.Inventors: Bart Samwel, Chad Whipkey
-
Publication number: 20130311445Abstract: Provided is a join processing device that performs a similarity join process to plural tuples using an edit distance threshold value ? (positive integer). The join processing device includes a join processing unit that excludes, from a target of edit distance calculation, a pair of tuples that do not have any common character in an end portion ranging from a head character or a tail character to a (?+1)th character in a join key string in each of the tuples.Type: ApplicationFiled: November 7, 2011Publication date: November 21, 2013Applicant: NEC CORPORATIONInventor: Kazuyo Narita
-
Patent number: 8583626Abstract: A method, system and computer program product for identifying reference data tables in an Extract-Transform-Load (ETL) process, by identifying, by operation of one or more computer processors, at least a first reference data operator in the process, wherein the first reference data operator references one or more tables and evaluating at least a first table referenced by the reference data operator to determine whether the first table is a reference data table by assigning a score to the first table, wherein the score is indicative of the likelihood that the first table is a reference data table and wherein a reference data table contains a set of values that describes other data.Type: GrantFiled: March 8, 2012Date of Patent: November 12, 2013Assignee: International Business Machines CorporationInventors: Dan J. Mandelstein, Ivan M. Milman, Martin Oberhofer, Sushain Pandit
-
Publication number: 20130290294Abstract: A system, method, and non-transitory computer readable medium are disclosed herein to optimize nested queries. At least one field is associated with each row of data evaluated by at least one nested query. A value is assigned to the at least one field so as to indicate whether each row of data satisfies the at least one nested query. The at least one field associated with each row of data is evaluated to determine satisfaction of the at least one nested query.Type: ApplicationFiled: April 27, 2012Publication date: October 31, 2013Inventors: Matthew Steven Fuller, Charles Edward Bear
-
Publication number: 20130290293Abstract: A query statement is received that specifies a count distinct. Thereafter, a data flow graph that comprises a plurality of nodes for executing the query is generated. The nodes provide aggregation operations, sorting of results on join attributes and vertically appending columns of count distinct results with intermediate results from at least one of the aggregation operations. Thereafter, execution of the query is initiated using the data flow graph. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: April 26, 2012Publication date: October 31, 2013Applicant: SAP AGInventors: Christoph Weyerhaeuser, Tobias Mindnich, Daniel Baeumges, Gerrit Simon Kazmaier
-
Publication number: 20130290295Abstract: In at least some examples, a system includes a distributed database and control logic to enable updates and queries to the distributed database. The control logic applies a plurality of identifiers to the updates and queries to maintain distinct fault domains in the distributed database.Type: ApplicationFiled: April 30, 2012Publication date: October 31, 2013Inventors: Craig A. Soules, Alistair Veitch, Charles B. Morrey, III, Kimberly Keeton
-
Patent number: 8572067Abstract: A method to estimate the number of distinct value combinations for a set of attributes in a database system is disclosed. The method comprises utilizing frequency information within the set of attributes to provide a best estimate for the number of distinct value combinations. In a preferred embodiment, the utilizing step comprises estimating the number of distinct value combinations utilizing frequency information of the set of attributes based upon probability theory and further includes providing bounds on the distinct value information combinations utilizing the frequency information of the set of attributes. In so doing, an estimate for the number of distinct value combinations is provided.Type: GrantFiled: March 14, 2006Date of Patent: October 29, 2013Assignee: International Business Machines CorporationInventors: Calisto Paul Zuzarte, Xiaohui Yu
-
Publication number: 20130282694Abstract: A method and apparatus for resolving conjunctive queries, comprising relational predicates and external predicates, such as XML predicates. The method and apparatus obtain results from a relational engine or from an external engine, and then use the obtained results as input for the other engine, so as to optimize the activity of the other engine. The process may repeat further times, with the results obtained by the other engine being input to the first engine. The method and apparatus further disclose handling value, being isomorphic hierarchical sub-trees.Type: ApplicationFiled: June 18, 2013Publication date: October 24, 2013Applicant: TECHNION RESEARCH AND DEVELOPMENT FOUNDATION LTD.Inventors: Oded SHMUELI, Royi Ronen
-
Publication number: 20130275407Abstract: A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and (1338) updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.Type: ApplicationFiled: March 4, 2013Publication date: October 17, 2013Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amelie Marian-Guerrier, Divesh Srivastava
-
Patent number: 8554762Abstract: Generally described, the present disclosure is directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework disclosed herein, various modes are allowed to be built up on top of the core system.Type: GrantFiled: December 28, 2010Date of Patent: October 8, 2013Assignee: Amazon Technologies, Inc.Inventors: Brian S. O'Neill, Jason Shijia Long, Archit Shivaprakash, Olga I. Kuznetsova
-
Patent number: 8554760Abstract: There is provided a computer-implemented method of optimizing a query. An exemplary method comprises receiving a first query configured to generate a result set. The query may comprise an operation for an outer table, a first predicate, and a second predicate. The second predicate may comprise a subquery correlated to the operation. Additionally, the first predicate and the second predicate may be disjunctive. The exemplary method also comprises generating a first query tree representing the first query, and generating a second query tree representing a second query. The second query may be configured to generate the result set, and may not comprise the subquery. The exemplary method additionally comprises generating a query plan based on the second query tree.Type: GrantFiled: October 7, 2009Date of Patent: October 8, 2013Assignee: Hewlett-Packard Development Company, L.P.Inventors: Suresh Subbiah, Lars Fredriksen, Murali Mallela Krishna, Hansjorg Zeller
-
Patent number: 8554761Abstract: Methods, computing devices, and computer-readable media are provided for transforming an initial query with a single-table outer join predicate to a second, semantically equivalent query that includes a multi-table predicate instead of the single-table outer join predicate. Because the second query does not include the single-table outer join predicate, the second query may be available for further transformations or optimization techniques, may produce a more efficient or otherwise different execution plan, or may be executed more efficiently or differently. The single-table outer join predicate may be in a full outer join ON clause of the initial query or nested in a left outer-joined LATERAL VIEW of the initial query. The multi-table predicate may be in a WHERE clause of the second query. Unlike the initial query, the second query allows use of a temporary organization of data from multiple tables for evaluation of multiple rows of the left outer join.Type: GrantFiled: May 25, 2012Date of Patent: October 8, 2013Assignee: Oracle International CorporationInventor: Rafi Ahmed
-
Publication number: 20130262433Abstract: 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.Type: ApplicationFiled: April 2, 2012Publication date: October 3, 2013Inventors: James Qiu, Murali Vemulapati
-
Patent number: 8548983Abstract: Methods, computer-readable media, and machines are provided for transforming a query by removing a correlated predicate from a lateral view in an initial query. A query processor may transform the lateral view into a regular view such that a transformed query with the regular view is semantically equivalent to the initial query. The transformed query may support a larger set of access paths, join methods, and join permutations, may qualify for other transformations or optimizations, or may otherwise be executed or optimized differently from the initial query. The lateral view may reference an aggregation function, and the query processor may add a GROUP BY operator to the transformed query to preserve, after the correlated predicate has been pulled out of the lateral view, an interaction that was present between the aggregation function and the correlated predicate when the correlated predicate was in the lateral view.Type: GrantFiled: June 7, 2012Date of Patent: October 1, 2013Assignee: Oracle International CorporationInventor: Rafi Ahmed
-
Publication number: 20130254183Abstract: An apparatus and method are described for the discovery of semantics, relationships and mappings between data in different software applications, databases, files, reports, messages, or systems. In one aspect, semantics and relationships and mappings are identified between a first and a second data source. A binding condition is discovered between portions of data in the first and the second data source. The binding condition is used to discover correlations between portions of data in the first and the second data source. The binding condition and the correlations are used to discover a transformation function between portions of data in the first and the second data source.Type: ApplicationFiled: May 9, 2013Publication date: September 26, 2013Applicant: International Business Machines CorporationInventors: Alexander Gorelik, Lingling Yan
-
Patent number: 8543567Abstract: In accordance with embodiments, there are provided mechanisms and methods for generating a custom report using an on-demand database service. These mechanisms and methods for generating an on-demand database service custom report can enable embodiments to generate reports that reflect a relationship between at least two different objects. The ability of embodiments to provide such additional insight into database contents may lead to more efficient and effective reporting.Type: GrantFiled: August 8, 2012Date of Patent: September 24, 2013Assignee: salesforce.com, inc.Inventors: Jesse Collins, Mark A. Fischer, Thomas Kim, Thomas Joseph Tobin, Simon Wong
-
Patent number: 8538953Abstract: Provided is a method for processing a multi-way join query comprising: filling matrix-based synopses according to input source stream and generating a result vector evaluating a query equation defined by the matrix multiplication operation of the matrix-based synopses corresponding to nodes of a query walk; and generating a result tuple for the multi-way join query from the matrix-based synopses based on the result vector.Type: GrantFiled: March 16, 2012Date of Patent: September 17, 2013Assignee: Industry-Academic Cooperation Foundation, Yonsei UniversityInventor: Won Suk Lee
-
Publication number: 20130238596Abstract: A method, system and computer program product for identifying reference data tables in an Extract-Transform-Load (ETL) process, by identifying, by operation of one or more computer processors, at least a first reference data operator in the process, wherein the first reference data operator references one or more tables and evaluating at least a first table referenced by the reference data operator to determine whether the first table is a reference data table by assigning a score to the first table, wherein the score is indicative of the likelihood that the first table is a reference data table and wherein a reference data table contains a set of values that describes other data.Type: ApplicationFiled: March 8, 2012Publication date: September 12, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dan J. Mandelstein, Ivan M. Milman, Martin A. Oberhofer, Sushain Pandit
-
Patent number: 8533174Abstract: Disclosed herein is a multi-entity-centric integrated search system and method. The multi-entity-centric integrated search system includes an entity information acquisition server for receiving and analyzing a query term and determining entities and types of entities, and an integrated search result provision server for configuring an integrated search results page using results acquired from unit service calling units, such as an external API calling unit, a search engine calling unit, and an inference engine calling unit, and presenting integrated search results. The present invention is advantageous in that precise search results can be shown more rapidly, satisfaction with search results for a query term in which multiple entities coexist can be improved, the ambiguity of query terms is overcome, and an open platform capable of operating in conjunction with various types of web services is provided.Type: GrantFiled: July 17, 2008Date of Patent: September 10, 2013Assignee: Korea Institute of Science and technology InformationInventors: Han Min Jung, Mi Kyung Lee, Pyung Kim, Seung Woo Lee, Du Seok Jin, Jung Sun Yoon, Dong In Park, Won Kyung Sung, Sun Hwa Hahn
-
Publication number: 20130232133Abstract: Systems and methods are provided for performing a nested join operation. Partitioning key values are computed for an outer data source using a partitioning key function used to partition an inner table. A join process is established for each of a plurality of partitions of the inner table (at 204), with a given partition of the inner table representing a plurality of partitioning key values. Each row from the outer data source is routed to a join process according to its associated partitioning key value (at 206). The inner table is probed to return a row from the inner table having the partitioning key value associated with the row from the outer data source (at 208). The row from the outer data source and the row returned from the inner table are joined to form a row in a combined table (at 210).Type: ApplicationFiled: December 3, 2010Publication date: September 5, 2013Inventors: Awny K. Al-Omari, Qifan Chen, Michael J. Hanlon
-
Patent number: 8527552Abstract: Various embodiments of systems and methods for database consistent sample data extraction are described herein. The technique uses production data as input and outputs sample data in the same relational schema while preserving the integrity of joins of the different tables in the schema. For a given relational schema, the master tables are found. Then a subset is created by placing selection criteria in a query defining how to sample the data for these master tables. Following the joins, the dependent tables are added to the query automatically.Type: GrantFiled: July 7, 2011Date of Patent: September 3, 2013Assignee: Business Objects Software LimitedInventor: John O'Byrne
-
Patent number: 8527502Abstract: A system method and computer-readable media for searching an object oriented database are provided. The present invention may be employed to detect software bugs, deficiencies and/or errors in, affecting, or related to, an object database management system. The invented technique may use an SQL table join query to search for incomplete, damaged or erroneous software objects.Type: GrantFiled: March 29, 2007Date of Patent: September 3, 2013Inventor: Blade Makai Doyle
-
Patent number: 8527500Abstract: A document preprocessor preprocess a document to enhance the statistical features of the document. The system preprocesses the document by matching a prefix and a trailing context in the document with one or more matching prefixes in a transformation database, where the prefix is a first string of one or more tokens in the first document and the trailing context is a second string of one or more tokens in the first document that trail the prefix. Alternatively, the system preprocesses the document by computing cyclic permutations of the document, sorting these permutations and taking the last token from each of the sorted permutations.Type: GrantFiled: February 27, 2009Date of Patent: September 3, 2013Assignee: Red Hat, Inc.Inventor: James Paul Schneider
-
Publication number: 20130226901Abstract: A method, apparatus and article of manufacture for utilizing an abstract derived entity are disclosed. An abstract derived entity is a data object present in an abstract data model that may be referenced by other entities in the abstract data model as though it were a relational table present in a physical data source. In one embodiment, an abstract data model provides data access independent of the manner in which the data is physically represented in a set of physical data sources. In addition, an abstract derived entity may be used to provide aggregate data joined with other non-aggregate data. Aggregate data values are calculated from the column of a relational table, or other sets of input data. In one embodiment, an abstract derived entity may describe a describe relational table comprising a set of aggregate data used to form a column of the relational table joined to other columns formed from the sets of input data specified by the abstract derived entity.Type: ApplicationFiled: March 15, 2013Publication date: August 29, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: International Business Machines Corporation
-
Publication number: 20130226902Abstract: A data processing system, and an article of manufacturing, join rows associated with a source table column with rows associated with a target table column. A source node and a target node contain the source and target tables, respectively. A reduced representation of selected rows associated with the source table column is generated, as is a representation of the target table column. A filtering module filters the generated reduced representation of selected rows associated with the source table column through the generated representation of the target table column, the filtered generated reduced representation of selected rows identifying source table rows that do not have to be joined with the target table. The rows associated with the source table column minus the filtered generated reduced representation of selected rows are joined to the rows associated with the target table column.Type: ApplicationFiled: March 18, 2013Publication date: August 29, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: INTERNATIONAL BUSINESS MACHINES CORPORATION
-
Patent number: 8521723Abstract: A method, apparatus, and stored instructions are provided for transforming an initial query having a scalar subquery with correlated predicates into a transformed query having transformed predicates that are not in the scalar subquery. The transformed predicates correspond to the correlated predicates, but the transformed predicates are no longer correlated. The transformed predicates reference an outer join operation to preserve null values that may have been generated by the correlated predicates that were in the scalar subquery of the initial query. The transformed query is semantically equivalent to the initial query. When creating an execution plan for the transformed query, the query processor may choose from a much larger set of access paths, join methods, and join permutations than those that were available for the initial query. The transformed query may qualify for other transformations or optimizations, or may otherwise be executed or optimized differently from the initial query.Type: GrantFiled: July 18, 2012Date of Patent: August 27, 2013Assignee: Oracle International CorporationInventor: Rafi Ahmed
-
Publication number: 20130218866Abstract: Architecture that includes a multimodal graph modeling and computation system employed in a search framework. The framework utilizes entities to diversify and explore the results page. The multimodal graph modeling paradigm can include web modeling by way of a click graph, a web graph, a social graph, a geospatial graph, and an entity graph, for example. These graphs are then joined based on common properties such as links, clicks, and document entities. Computation can then be performed over the joined graphs to generate a related entity list and a related page list. These lists are then processed by a recommendation engine to provide recommendations to the user.Type: ApplicationFiled: February 20, 2012Publication date: August 22, 2013Applicant: Microsoft CorporationInventors: Richard J. Qian, Xiaodong Fan
-
Patent number: 8515945Abstract: System, methods and articles of manufacture for joining data in the database tables comprising, performing an index scan on a global index of a first database table, determining rows in the first database table that may be joined with a second database table based on a needed partitioning, wherein the needed partitioning is determined using an index scan, determining a number of partitions in the second database table, and joining each of the corresponding partitions in the first database table with a corresponding partitions in the second database table.Type: GrantFiled: November 16, 2010Date of Patent: August 20, 2013Assignee: Sybase, Inc.Inventors: Santosh Pendap, Sudipto Chowdhuri, Peter J. Schneider