Query Optimization (epo) Patents (Class 707/E17.017)
  • Patent number: 10216859
    Abstract: In one embodiment, a method includes by a client computing device, sending a request for two or more categories of content for display in a user interface, wherein each of the categories of content are received from a different content source, and wherein each of the categories of content are displayed in a corresponding region of the user interface. The method further includes determining a space requirement for each of the categories of content, wherein the determining is based at least in part on information in the request and information stored on the client computing device. The method further includes allocating, based on the space requirements, space for each of the regions of the user interface, and displaying each of the categories of content in its corresponding region as the content is received.
    Type: Grant
    Filed: March 22, 2016
    Date of Patent: February 26, 2019
    Assignee: Facebook, Inc.
    Inventor: Yen-Ting Tung
  • Patent number: 10061767
    Abstract: Methods and apparatus are described herein for classifying user reviews or portions thereof as being related to various entities, and for associating extracted descriptive segments of text contained in those user reviews or portions thereof with entities based on the classifications. In various implementations, one or more categories of observed user interest may be identified based on a corpus of user queries. One or more segments of text related to the one or more categories of observed user interest may be detected in one or more user reviews associated with a product. Based on the detecting, the product may be indexed on the one or more categories of observed user interest in a searchable database. In some implementations, the searchable database may be accessible to one or more remote client devices, and may be searchable by the one or more categories of observed user interest to provide search results to be rendered by the one or more remote client devices.
    Type: Grant
    Filed: June 16, 2017
    Date of Patent: August 28, 2018
    Assignee: GOOGLE LLC
    Inventors: Advay Mengle, Jindong Chen, Charmaine Cynthia Rose D'Silva, Anna Patterson
  • Patent number: 9672537
    Abstract: A dynamic content controller is configured for communication with one or more data sources. The dynamic content controller comprises an analytics engine and a personalization engine coupled to the analytics engine. The analytics engine is configured to analyze cultural data collected from the one or more data sources during a current content browsing session. The personalization engine is configured to adapt content to be presented based at least in part on the analysis of the cultural data. The adaptation of the content to be presented is performed during the current content browsing session.
    Type: Grant
    Filed: December 11, 2014
    Date of Patent: June 6, 2017
    Assignee: EMC IP Holding Company LLC
    Inventors: David Dietrich, Ronald Wilfred Reidy, Beibei Yang, Barry William Heller
  • Patent number: 9443016
    Abstract: A system and method for a collection of digital items that includes generating a collection of result items, wherein each result item corresponds to result data of at least one query input, and wherein at least one result item includes a context property; storing the collection of result items as a first instance; and augmenting the collection in a second instance through at least the context property.
    Type: Grant
    Filed: February 10, 2014
    Date of Patent: September 13, 2016
    Assignee: Verbify Inc.
    Inventor: Bobby Lo
  • Patent number: 8954419
    Abstract: Techniques are provided for improving performance of parallel execution plans that include serial operations. A database server generates a parallel execution plan and includes one or more serial data flow objects in the parallel execution plan, each data flow object including one or more serial row sources. A parallel selector row source is associated with each serial data flow object included in the parallel execution plan. Each parallel selector row source coordinates with a query coordinator process the execution of the associated serial data flow object. In the event that that a plurality of serial data flow objects are included in a parallel execution plan, serial row sources included in the serial data flow objects may be executed concurrently by a separate parallel slave process, instead of sequential execution of each serial row source by the query coordinator process.
    Type: Grant
    Filed: May 22, 2012
    Date of Patent: February 10, 2015
    Assignee: Oracle International Corporation
    Inventors: Himani Apte, Thierry Cruanes
  • Patent number: 8903801
    Abstract: Techniques are provided for a fully-automated process for tuning database query language statements that selects database query language statements for tuning, tunes the database query language statements and generates tuning recommendations, tests the tuning recommendations, and determines whether to implement the tuning recommendations based on the test results. The fully-automated tuning process may also automatically implement certain tuning recommendations and monitor the performance of the database query language statements for which tuning recommendations have been implemented.
    Type: Grant
    Filed: August 8, 2008
    Date of Patent: December 2, 2014
    Assignee: Oracle International Corporation
    Inventors: Peter Belknap, Benoit Dageville, Karl Dias, Khaled Yagoub
  • Patent number: 8898146
    Abstract: A method and device may accept a first database query plan including a plurality of rows and a second database query plan including a plurality of rows, compare each row in the first database query plan with a corresponding row in the second database query plan, and based on each comparison, calculate a difference between the compared rows. Each difference may be recorded in an output file.
    Type: Grant
    Filed: September 22, 2010
    Date of Patent: November 25, 2014
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Maria G. Castellanos, Perla Ruiz
  • Patent number: 8862625
    Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.
    Type: Grant
    Filed: April 7, 2008
    Date of Patent: October 14, 2014
    Assignee: Teradata US, Inc.
    Inventors: Krishnan Meiyyappan, Liuxi Yang, Jeremy Branscome, Michael Corwin, Ravi Krishnamurthy, Kapil Surlaker, James Shau, Joseph I. Chamdani
  • Patent number: 8788484
    Abstract: Certain example embodiments described herein relate to techniques for user feedback driven dynamic query rewriting in complex event processing (CEP) environments. In certain example embodiments, the adjustment of already-initiated queries may be permitted during runtime in order to help continuously or substantially continuously meet a user's requirements. In certain example embodiments, parameters of a query may be adapted dynamically, e.g., without the need to redeploy it. Adaptable parameters in certain example embodiments may be identified and/or based on, for instance, an automatic determination from original query creation, user specifications, the way in which a user interacts with a user interface for visualizing the results of queries, etc.
    Type: Grant
    Filed: December 27, 2010
    Date of Patent: July 22, 2014
    Assignee: Software AG
    Inventors: Michael Cammert, Christoph Heinz, Jürgen Krämer, Tobias Riemenschneider
  • Patent number: 8756120
    Abstract: A hybrid context information matching approach may produce a customized product catalogue based on the user's context and the mobile device the user is using. A Knowledge Base (KB) and a KB manager, along with various processes perform specific collaborative tasks in order to achieve the overall goal of producing a customized product catalogue. In addition, the effort builds and/or updates the KB. Various contextual inputs are provided from both the user environment and data repositories. Hybrid matching is performed in order to determine optimal search results based on the contextual input provided.
    Type: Grant
    Filed: November 1, 2011
    Date of Patent: June 17, 2014
    Assignee: SAP AG
    Inventors: Felix Ntawanga, Ernest Ketcha Ngassam, Jan Harm Petrus Eloff, Marek Piotr Zielinski
  • Patent number: 8738651
    Abstract: A technique for cataloging documents based on user activity includes assigning documents to a relevant document list based on activity of a user of a device. In this case, at least two of the documents are associated with different applications. The technique then provides the relevant document list to the user.
    Type: Grant
    Filed: March 6, 2008
    Date of Patent: May 27, 2014
    Assignee: Lenovo (Singapore) Pte Ltd
    Inventors: Jennifer G. Zawacki, David C. Challener, Justin T. Dubs, James J. Thrasher
  • Publication number: 20140136511
    Abstract: Detection and use of relationships in tabular data is enhanced. A foreign-key-based relationship between two tables in memory is automatically discovered by a module. A view over table data is computationally augmented by adding an expandable hierarchical column. The expandable hierarchical column includes second table data that is related to rows of a first table by the discovered foreign-key-based relationship. A naming scheme for the added column is described. Sometimes the augmentation places an AddJoinColumn operator in a query expression tree; sometimes the tree is rewritten by moving a query operator or replacing a specified pattern of operators by a flat Join operation between two tables. Column expansion may be followed by reshaping data into a flat table, by getting a homogeneous query, by performing a join, or other operations.
    Type: Application
    Filed: November 15, 2012
    Publication date: May 15, 2014
    Applicant: MICROSOFT CORPORATION
    Inventors: Gregory Lawrence Hughes, Clemens Alden Szyperski, Michael James Coulson
  • Publication number: 20140136513
    Abstract: A database system maintains a feature set of a modern database system while operating directly on raw data files. Systems may use an adaptive indexing mechanism that maintains positional information to provide efficient access to raw data files, a flexible caching structure, and techniques for selective parsing and selective tokenizing. In doing so, possible performance bottlenecks associated with repeated parsing, tokenizing, and expensive data type conversion costs can be overcome.
    Type: Application
    Filed: November 15, 2012
    Publication date: May 15, 2014
    Applicant: Ecole Polytechnique Fédérale de Lausanne (EPFL)
    Inventors: Anastasia Ailamaki, Stratos Idreos, Ioannis Alagiannis, Renata Borovica, Miguel Sergio De Oliveira Branco
  • Publication number: 20140136512
    Abstract: Embodiments of the present invention provide a method, system and computer program product for pre-migration performance prediction of a database management system (DBMS). In an embodiment of the invention, a method for pre-migration performance prediction of a DBMS can include executing a calibration workload in a target DBMS to produce a conversion factor of cost of executing the calibration workload to temporal performance of executing the calibration workload. The method also can include subsequently submitting a sample workload from a database of a source DBMS for evaluation of cost of execution on an empty replica of the database in the target DBMS. Finally, the method can include predicting a temporal performance of the sample workload in the target DBMS as a product of the conversion factor and the cost of execution of the sample workload on the empty replica of the database in the target DBMS.
    Type: Application
    Filed: November 9, 2012
    Publication date: May 15, 2014
    Inventors: Austin Clifford, Enda McCallig
  • Publication number: 20140114952
    Abstract: The present invention extends to methods, systems, and computer program products for optimizing queries of parallel databases. Queries can be partially optimized at an optimizer that is unaware of its use to optimize queries for parallel processing. The optimizer can produce a data structure (e.g., a SQL Server MEMO) that encapsulates a logical serial plan search space. The logical serial plan search space may not incorporate any notion of parallelism into the plan space itself. A parallel-aware optimizer can parallelize the logical serial plan search space by augmenting the data structure (e.g., transforming the SQL Server MEMO into a parallel MEMO). Augmentation can be with data movement operations that move data associated one or more compute nodes in a distributed architecture. Cost estimates can be calculated for the operations contained in the parallelized data structure. The parallel plan with the lowest estimated cost can be selected for the query.
    Type: Application
    Filed: October 23, 2012
    Publication date: April 24, 2014
    Applicant: MICROSOFT CORPORATION
    Inventors: Eric R. Robinson, Alan Dale Halverson, Rimma V. Nehme, Srinath Shankar
  • Publication number: 20140114942
    Abstract: A search index for a collection of documents includes a plurality of keywords associated with the documents. Access to individual documents is detected based on searches employing the search index and keywords are recorded that are utilized in the searches and resulted in document access. The search index is modified to maintain the recorded keywords and remove keywords absent from the searches resulting in the document access.
    Type: Application
    Filed: October 23, 2012
    Publication date: April 24, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Igor L. Belakovskiy, Matthew E. Broomhall, Itzhack Goldberg, Boaz Mizrachi, Neil Sondhi
  • Publication number: 20140108378
    Abstract: A technique for factoring uncertainty into cost-based query optimization includes: determining the degree of uncertainty involved in the cost estimates for the query, determining the degree of sensitivity the query has to that uncertainty, and determining if there is an access path that performs well across the range of possible conditions that could occur at execution time, reducing the risk of performance spikes and performance volatility. If such an access path exists, select that access path; if not, perform parametric query optimization or query re-optimization.
    Type: Application
    Filed: October 17, 2012
    Publication date: April 17, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jason L. Alpers, Thomas A. Beavin, Patrick D. Bossman, Shuanglin Guo, Terence P. Purcell
  • Publication number: 20140108369
    Abstract: Systems and method of the present invention provide for one or more server computers configured to receive one or more keywords topically relevant to a content of a web page, request from a search engine a first metric comprising a quantity of times the keywords have appeared in a search query with one or more question keywords during a time period and a second metric comprising a probability of receiving a high rank associated with the one or more keywords and the one or more question keywords, receive, from the search engine, the first metric and the second metric, calculate a keyword effectiveness index from the first metric and the second metric, and generate and transmit to a client computer one or more recommendations to include a high ranked suggested content on the web page according to the keyword effectiveness index.
    Type: Application
    Filed: October 11, 2012
    Publication date: April 17, 2014
    Applicant: Go Daddy Operating Company, LLC
    Inventor: Rajinder Nijjer
  • Publication number: 20140101128
    Abstract: In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth.
    Type: Application
    Filed: October 5, 2012
    Publication date: April 10, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Lynnette E. Carston, Brian R. Muras, Andrew P. Passe
  • Publication number: 20140101131
    Abstract: In an embodiment, a hit percentage of an expected affinity for a first query is calculated, wherein the expected affinity comprises a first address range in a query plan cache, a hit percentage of a candidate affinity for the first query is calculated, wherein the candidate affinity comprises a second address range in a query plan cache, and if the hit percentage of the candidate affinity is greater than the hit percentage of the expected affinity by more than a threshold amount, query plans in the candidate affinity are swapped with query plans in the expected affinity.
    Type: Application
    Filed: October 8, 2012
    Publication date: April 10, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Publication number: 20140089294
    Abstract: Presented is a system and method for evaluating relational database queries in a distributed system. An optimized query plan is received by a control node. The query plan is decoded to a SQL statement that is semantically equivalent to the query plan, even though the query plan contains elements that have no direct analogue in SQL. The decoded SQL is transmitted to a compute node for execution.
    Type: Application
    Filed: September 26, 2012
    Publication date: March 27, 2014
    Applicant: MICROSOFT CORPORATION
    Inventors: Srinath Shankar, Rimma Nehme
  • Publication number: 20140074818
    Abstract: 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: Application
    Filed: September 13, 2012
    Publication date: March 13, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ronald J. Barber, Min-Soo Kim, Jae Gil Lee, Sam S. Lightstone, Guy M. Lohman, Lin Qiao, Vijayshankar Raman, Richard S. Sidle
  • Publication number: 20140074819
    Abstract: A method for providing optimized data representation of relations for in-memory database query processing is disclosed. The method seeks to optimize the use of the available memory by encoding relations on which the in-memory database query processing is performed and by employing auxiliary structures to maintain performance. Relations are encoded based on data patterns in one or more attribute-columns of the relation and the encoding that is selected is suited to a particular type of data in the column. Members of a set of auxiliary structures are selected based on the benefit the structure can provide and the cost of the structure in terms of the amount of memory used. Encoding of the relations is performed in real-time while query processing occurs, using locks to eliminate conflicts between the query processing and encoding.
    Type: Application
    Filed: September 12, 2012
    Publication date: March 13, 2014
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Sam Idicula, Kevin Moore, Brian Gold, Nipun Agarwal, Eric Sedlar
  • Publication number: 20140067789
    Abstract: 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: Application
    Filed: September 4, 2012
    Publication date: March 6, 2014
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Rafi Ahmed, Chun-Chieh Lin, Mohamed Zait
  • Publication number: 20140067792
    Abstract: A system includes a coordinator node and worker nodes in communication with the coordinator node. Each worker node stores data blocks. Each data block has data in a semi-structured format and each data block has an associated foreign table declaration specifying conversion of the data in the semi-structured format into a tabular format interpretable by a query language. A query processor executed by the coordinator node produces a distributed query plan in response to a query language query. The distributed query plan includes sub-queries. The sub-queries are executed by selected worker nodes of the worker nodes. The selected worker nodes use foreign table declarations to convert data in semi-structured formats into tabular formats of a distributed database to provide tabular data in response to the query language query.
    Type: Application
    Filed: August 30, 2012
    Publication date: March 6, 2014
    Applicant: CITUS DATA BILGI ISLEMLERI TICARET A.S.
    Inventors: Ozgun Ali Erdogan, Sumedh Suhas Pathak, Hadi Moshayedi
  • Publication number: 20140067791
    Abstract: 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: Application
    Filed: September 6, 2012
    Publication date: March 6, 2014
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Sam Idicula, Sabina Petride, Nipun Agarwal
  • Publication number: 20140059033
    Abstract: Systems, methods, and apparatuses, including computer program products, are provided for machine translation using information retrieval techniques. In general, in one implementation, a method is provided. The method includes providing a received input segment as a query to a search engine, the search engine searching an index of one or more collections of documents, receiving one or more candidate segments in response to the query, determining a similarity of each candidate segment to the received input segment, and for one or more candidate segments having a determined similarity that exceeds a threshold similarity, providing a translated target segment corresponding to the respective candidate segment.
    Type: Application
    Filed: April 23, 2008
    Publication date: February 27, 2014
    Applicant: Google Inc.
    Inventors: Hayden Shaw, Thorsten Brants
  • Publication number: 20140046928
    Abstract: In an embodiment, a first query is received that specifies a first object identifier. If a first query plan exists that implements the first query, except that the first query plan does not comprise the first object identifier and instead comprises a parameter marker in place of the first object identifier, a first query execution plan is created from the first query plan, substituting the first object identifier in the first query execution plan for the parameter marker, and the first query execution plan is executed to read a first object identified by the first object identifier.
    Type: Application
    Filed: August 9, 2012
    Publication date: February 13, 2014
    Applicant: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Publication number: 20140025658
    Abstract: A method, system, and computer program product for validating database table partitioning from partition advisors. The method commences by receiving a workload comprising a plurality of queries, then analyzes the queries to determine stratification buckets based on the usage of tables in the queries. Further analysis of the queries results in assigning the queries into one or more of the stratification buckets from which buckets a number n of queries (n being smaller than the total number of queries in the received workload) are drawn from the stratification buckets to form a representative workload having a confidence interval C and a margin of error M. Now, having a representative workload that is smaller, yet statistically representative of the received workload, a computer evaluates each of a plurality of partition schemes using the representative workload to determine an optimal partitioning scheme. The confidence interval C can be increased or decreased.
    Type: Application
    Filed: July 17, 2012
    Publication date: January 23, 2014
    Applicant: Oracle International Corporation
    Inventors: Murali THIYAGARAJAN, Praveen T.J. Kumar
  • Patent number: 8635207
    Abstract: A networked data processor maintains a database of information concerning potential evidence from litigants in legal proceedings supporting stipulated discovery agreements, and requiring meet-and-confer sessions prior to seeking court supervision. Individual or adverse parties can participate. Sources include data custodians, file repositories, electronic data, witnesses, etc. Managers and employees are polled to populate a database defining the litigant's organization and evidence. The evidence may be sequestered, copied and processed, e.g., filtered for confidentiality or privilege, analyzed as to format, and queried to assess the volume of data that would be responsive under alternative discovery specifications. Cost and time are assessed under alternative specifications and reports are provided for use in negotiating a discovery plan. A stipulated discovery plan may result, or if not, a meet-and-confer session is electronically managed in a multi-user teleconference.
    Type: Grant
    Filed: January 21, 2011
    Date of Patent: January 21, 2014
    Assignee: 26-F, LLC
    Inventor: Michael Marlin
  • Patent number: 8626789
    Abstract: Geocoding architecture based on information retrieval. The geocoding information retrieval system operates on locations and geographic entities. The architecture uses parameters in addition to the query string, if available. The parameters provide contextual information that enables filtering and sorting the results. The additional parameters include market, culture, map view, and user location. A geocoding triage process uses the query and context information provided and output of a machine-learning parser to select the data-lookup geocoders for processing the query. A results processing component collects the results from the underlying data-lookup geocoders, merges the results into a single list after normalizing the scores, and then re-sorts the results list.
    Type: Grant
    Filed: June 1, 2007
    Date of Patent: January 7, 2014
    Assignee: Microsoft Corporation
    Inventors: Harish Jayanti, Eugene Shinn
  • Publication number: 20140006381
    Abstract: Embodiments of the present invention provide query processing for column stores by accumulating table record attributes during application of query plan operators on a table. The attributes and associated attribute values are compacted when said attribute values are to be consumed for an operation in the query plan, during the execution of the query plan. Table column record values are materialized late in query plan execution.
    Type: Application
    Filed: June 29, 2012
    Publication date: January 2, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ronald J. Barber, Lin Qiao, Vijayshankar Raman, Richard S. Sidle
  • Publication number: 20140006382
    Abstract: Embodiments of the present invention provide query processing for column stores by accumulating table record attributes during application of query plan operators on a table. The attributes and associated attribute values are compacted when said attribute values are to be consumed for an operation in the query plan, during the execution of the query plan. Table column record values are materialized late in query plan execution.
    Type: Application
    Filed: August 16, 2012
    Publication date: January 2, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ronald J. BARBER, Lin Qiao, Vijayshankar Raman, Richard S. Sidle
  • Publication number: 20140006384
    Abstract: Systems and methods according to embodiments provide elasticity for complex event processing (CEP) systems. Embodiments may comprise at least the following three components: (1) incremental query optimization, (2) operator placement, and (3) cost explanation. Incremental query optimization allows avoiding simultaneous computation of identical results by performing operator-level query reuse and subsumption. Using automatic operator placement, a centralized CEP engine can be transformed into a distributed one by dynamically distributing and adjusting the execution according to unpredictable changes in data and query load. Cost explanation functionality can provide end users with near real-time insight into the monetary cost of the whole system, down to operator level granularity. Combination of these components allows a CEP system to be scaled up and down.
    Type: Application
    Filed: June 28, 2012
    Publication date: January 2, 2014
    Applicant: SAP AG
    Inventors: Zbigniew Jerzak, Thomas Heinze, Yuanzhen Ji
  • Publication number: 20140006379
    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.
    Type: Application
    Filed: June 29, 2012
    Publication date: January 2, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Stefan Arndt, Gopi K. Attaluri, Ronald J. Barber, Guy M. Lohman, Lin Qiao, Vijayshankar Raman, Eugene J. Shekita, Richard S. Sidle
  • Publication number: 20130346434
    Abstract: A computer-implemented method for determining whether a target text-string is correctly spelled is provided. The target text-string is compared to a corpus to determine a set of contexts which each include an occurrence of the target text-string. Using heuristics, each context of the set is characterized based on occurrences in the corpus of the target text-string and a reference text-string. Contexts are characterized as including a correct spelling of the target text-string, an incorrect spelling of the reference text-string, or including an indeterminate usage of the target text-string. A likelihood that the target text-string is a misspelling of the reference text-string is computed as a function of the quantity of contexts including a correct spelling of the target text-string and the quantity of contexts including an incorrect spelling of a reference text-string. In one application, the target text-string is received in a search query, the search executed following a spell-check.
    Type: Application
    Filed: September 30, 2011
    Publication date: December 26, 2013
    Applicant: GOOGLE INC.
    Inventor: Noam SHAZEER
  • Publication number: 20130346390
    Abstract: A cost monitoring system can monitor a cost of queries executing in a complex event processing system, running on top of a pay-as-you-go cloud infrastructure. Certain embodiments may employ a generic, cloud-platform independent cost model, multi-query optimization, cost calculation, and/or operator placement techniques, in order to monitor and explain query cost down to an operator level. Certain embodiments may monitor costs in near real-time, as they are created. Embodiments may function independent of an underlying complex event processing system and the underlying cloud platform. Embodiments can optimize a work plan of the cloud-based system so as to minimize cost for the end user, matching the cost model of the underlying cloud platform.
    Type: Application
    Filed: June 21, 2012
    Publication date: December 26, 2013
    Applicant: SAP AG
    Inventors: Zbigniew Jerzak, Thomas Heinze, Yuanzhen Ji
  • Publication number: 20130339339
    Abstract: Accelerated sub-string searches on large data sets can be performed using filtering processes that can improve or optimize run time performance. A first filtering process can include partitioning a binary tree into sections to enable an exact search to replace a substring search for part of the binary tree and for part of the binary tree to be potentially excluded from substring searching. A second filtering process can include comparing count representations of entries in the binary tree and of a received input string to potentially further exclude entries from substring searching.
    Type: Application
    Filed: June 15, 2012
    Publication date: December 19, 2013
    Inventors: Bin Qin, Michael Davis, David Lyons
  • Publication number: 20130339379
    Abstract: Systems and methods for information retrieval are provided that permit users and/or processing entities to access and define synthetic data, synthetic objects, and/or synthetic groupings of data in one or more collections of information. In one embodiment, data access on an information retrieval system can occur through an interpretation layer which interprets any synthetic data against data physically stored in the collection. Synthetic data can define virtual data objects, virtual data elements, virtual data attributes, virtual data groupings, and/or data entities that can be interpreted against data that may be stored physically in the collection of information. The system and methods for information retrieval can return results from the one or more collections of information based not only on the data stored, but also on the virtual data generated from interpretation of the stored data.
    Type: Application
    Filed: June 13, 2012
    Publication date: December 19, 2013
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Adam FERRARI, Joshua William KAPELL, Jason FURTADO, Matthew L. BRANDWEIN, Spiro MICHAYLOV, Omri TRAUB, Vladimir ZELEVINSKY, John HUFFAKER
  • Publication number: 20130339340
    Abstract: Systems and methods for using a semantic search to address business entities that fulfill certain criteria are provided. A free search term may be determined by a user for the semantic search. The free search term may include any object type, element or parameter the user would like to search for. An ontology which relates to a specific business or industry may be used for the semantic search. The ontology may include various business classes, roles, and individuals. In some implementations, the ontology may be generated from metadata of business objects. The semantic search may be conducted across the entire ontology to obtain search results that match the free search term. As a result, business entities that fulfill the free search term may be retrieved and provided to the user.
    Type: Application
    Filed: June 18, 2012
    Publication date: December 19, 2013
    Inventor: Ingo Pfitzner
  • Publication number: 20130332446
    Abstract: A repartitioning optimizer identifies alternative repartitioning strategies and selects optimal ones, accounting for network transfer utilization and partition sizes in addition to traditional metrics. If prior partitioning was hash-based, the repartitioning optimizer can determine whether a hash-based repartitioning can result in not every computing device providing data to every other computing device. If prior partitioning was range-based, the repartitioning optimizer can determine whether a range-based repartitioning can generate similarly sized output partitions while aligning input and output partition boundaries, increasing the number of computing devices that do not provide data to every other computing device. Individual computing devices, as they are performing a repartitioning, assign a repartitioning index to each individual data element, which represents the computing device to which such a data element is destined.
    Type: Application
    Filed: June 11, 2012
    Publication date: December 12, 2013
    Applicant: MICROSOFT CORPORATION
    Inventors: Jingren Zhou, Nicolas Bruno, Wei Lin
  • Publication number: 20130332437
    Abstract: Facilitating the searching of structured documents by identifying multiple element paths corresponding to multiple elements included in multiple structured documents, and for each of the element paths providing, for inclusion in a first searchable data structure, the element path exclusive of a value of the element corresponding to the element path and exclusive of an identifier of the structured document including the element corresponding to the element path, and providing, for inclusion in a second searchable data structure, the element path in association with a value of the element corresponding to the element path and in association with an identifier of the structured document including the element corresponding to the element path.
    Type: Application
    Filed: June 11, 2012
    Publication date: December 12, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Oren PAIKOWSKY, Shimon STARK, Yariv TZABAN
  • Publication number: 20130325841
    Abstract: Techniques are provided for a database server to identify a query that comprises an access check operator specifying a data access control policy, and if so, to re-write the query to produce an optimized query execution plan. A first technique rewrites a query comprising an access check operator based on the privileges associated with the database principal requesting the query. The rewritten query exposes the access predicates relevant to the requesting principal to subsequent database optimization processes. A second technique rewrites a query comprising an access check operator that specifies a data security policy that does not include a denied privilege. A third technique rewrites a query that comprises an access check operator specifying one or more database table columns that store row-specific access control lists. The rewritten queries are used to generate a query execution plan that provides for several query execution optimizations.
    Type: Application
    Filed: June 5, 2012
    Publication date: December 5, 2013
    Inventors: Tanvir Ahmed, Thomas Keefe, Chao Liang, Vikram Pesati
  • Publication number: 20130318068
    Abstract: Techniques are provided for improving performance of parallel execution plans that include serial operations. A database server generates a parallel execution plan and includes one or more serial data flow objects in the parallel execution plan, each data flow object including one or more serial row sources. A parallel selector row source is associated with each serial data flow object included in the parallel execution plan. Each parallel selector row source coordinates with a query coordinator process the execution of the associated serial data flow object. In the event that that a plurality of serial data flow objects are included in a parallel execution plan, serial row sources included in the serial data flow objects may be executed concurrently by a separate parallel slave process, instead of sequential execution of each serial row source by the query coordinator process.
    Type: Application
    Filed: May 22, 2012
    Publication date: November 28, 2013
    Inventors: Himani Apte, Thierry Cruanes
  • Publication number: 20130318069
    Abstract: A query plan predictor receives a query instance according to a query template having a set of parameters. The query plan predictor determines a plan space point for the query instance which is based upon the set of parameters. The query plan predictor predicts a predicted query plan for the plan space point, which is selected from a map of query plans according to a confidence threshold from a plan cache that includes at least one histogram. Each histogram is representative of a cached query plan in the plan cache combined with a previously-selected locality-sensitive hashing function. The histogram stores a frequency distribution of a mapping of sample plan points for the cached query plan by the locality-sensitive hashing function.
    Type: Application
    Filed: May 24, 2012
    Publication date: November 28, 2013
    Applicant: Sybase, Inc.
    Inventors: Günes AluÇ, David E. Dehaan, Ivan T. Bowman
  • Publication number: 20130318067
    Abstract: 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: Application
    Filed: May 23, 2012
    Publication date: November 28, 2013
    Applicant: International Business Machines Corporation
    Inventors: Bharat Sukhwani, Sameh W. Asaad, Hong Min, Matthew S. Thoennes, Gong Su
  • Publication number: 20130311443
    Abstract: 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: Application
    Filed: May 15, 2012
    Publication date: November 21, 2013
    Applicant: SAP AG
    Inventors: David Lotan Bolotnikoff, Netanel Slomianski, Natan Teren, Dmitry Gorenchteine, Tal Sapan, Udi Cohen, Kobi Sasson, Shachar Soel
  • Publication number: 20130311441
    Abstract: A system includes a master node and worker nodes controlled by the master node. Each worker node stores 25 or more modular blocks of a distributed database, where each modular block has a size of 5 G bytes or less and has an associated log file.
    Type: Application
    Filed: January 6, 2012
    Publication date: November 21, 2013
    Applicant: CITUS DATA BILGI ISLEMLERI TICARET A.S.
    Inventors: Ozgun Ali Erdogan, Sumedh Suhas Pathak
  • Publication number: 20130311442
    Abstract: 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: Application
    Filed: May 15, 2012
    Publication date: November 21, 2013
    Inventors: Thomas P. Weber, Frederick J. Levine, James P. Kelley
  • Publication number: 20130297586
    Abstract: Provided are a computer implemented method, computer program product, and system for re-writing a query. A query including a query predicate is received. It is determined that the query predicate includes one column with an associated predicate mapper. An equivalent predicate is generated for the query predicate using the predicate mapper that provides a mapping from the one column to another column. A cost of the query with the equivalent predicate is evaluated. In response to determining that the cost of the query is optimal, the query is rewritten to replace the query predicate with the equivalent predicate.
    Type: Application
    Filed: May 7, 2012
    Publication date: November 7, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Sweta Singh, Renu P. Sumam