Query Optimization (epo) Patents (Class 707/E17.017)
  • Publication number: 20120310919
    Abstract: An apparatus and method of searching for an instance path based on an ontology schema are provided. The method of searching for an instance path based on an ontology schema, which is performed by an instance path search apparatus, includes (a) receiving two or more keywords from a user and generating a pair of instances with respect to the keywords, respectively, (b) extracting a pair of classes corresponding to each of the pairs of instances from an ontology instance database, respectively, (c) obtaining an ontology schema path with respect to each of the pairs of classes from an ontology schema path database, respectively, and (d) replacing start and end classes with corresponding first and second instances in each of the ontology schema paths and searching for an instance path connected between the first instance and the second instance, respectively.
    Type: Application
    Filed: May 17, 2012
    Publication date: December 6, 2012
    Applicant: KOREA INSTITUTE OF SCIENCE & TECHNOLOGY INFORMATION
    Inventors: Dong Min SEO, Han Min JUNG, Pyung KIM, Mi Kyoung LEE, Seung Woo LEE, Won Kyung SUNG
  • Publication number: 20120310916
    Abstract: System, method and computer program product for processing a query are disclosed. Query processing includes partitioning the stored data into a plurality of partitions based on at least one vertex in the plurality of vertexes, storing at least another triple in the plurality of triples on the at least one node, assigning, based on the triple containing the at least one vertex, at least one partition in the plurality of partitions corresponding to the triple to at least one node in the plurality of nodes, and processing, based on the assigning, the query by processing the plurality of partitions.
    Type: Application
    Filed: June 29, 2012
    Publication date: December 6, 2012
    Applicant: Yale University
    Inventors: Daniel Abadi, Jiewen Huang
  • Publication number: 20120310921
    Abstract: Techniques are disclosed for identifying impact of a patch. One embodiment of the invention provides a DBMS that is configured to manage one or more databases. The DBMS may receive a request to evaluate a patch for the DBMS. The DBMS provides a first execution environment that is not based on the patch and a second execution environment that is based on the patch. For each query, the DBMS compares a first access plan with a second access plan, where the first access plan is generated from the first execution environment and the second access plan is generated from the second execution environment. The DBMS identifies one or more queries having differing access plans, based on the comparisons.
    Type: Application
    Filed: June 1, 2011
    Publication date: December 6, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Randy L. Egan, Rafal P. Konik, Roger A. Mittelstadt, Mark W. Theuer
  • Publication number: 20120303608
    Abstract: Disclose is an improved approach for caching lexical values for RDF data. A compact, efficient resource ID to value mapping is stored in memory, where the cache is stored in memory such that the overhead of accessing and updating it is minimized. The advantage of this approach is improved query performance, since the database is performing less work with the in-memory RDF resource caching. In addition, throughput and performance of the database are also improved.
    Type: Application
    Filed: May 26, 2011
    Publication date: November 29, 2012
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Zhe WU, Vladimir KOLOVSKI
  • Publication number: 20120296890
    Abstract: There is provided a computer-executed method of executing a rowset insert against a database. The method comprises receiving a structured query language statement (SQL) specifying the rowset insert. Additionally, the method comprises raising an error for a first row of the rowset insert. The method also comprises updating a table for a second row of the rowset insert. Further, the method comprises updating a materialized view of the table based on the second row. Additionally, the method comprises performing a commit to the database. The table comprises the second row, and the updated materialized view is consistent with the table.
    Type: Application
    Filed: March 5, 2010
    Publication date: November 22, 2012
    Inventors: Sandhya Sundaresan, Suresh Subbiah, Michael J. Hanlon
  • Publication number: 20120296889
    Abstract: Local data caching for views with linked attributes are optimized based on net change notifications. Data requests may be made periodically to a server, each request with a specific set of constraints on timestamps of entity types involved in a view and each ordered by a primary item's identifier (ID). Applying the results of these requests to a client-side cache of the view results enables the client-side cache to stay “relatively fresh” with respect to the server's data. The server may handle view data requests where all conditions on related tables' columns are applied with an “and” operation, and the specific set of conditions on the timestamps of the related items are applied to get the net changes with minimum redundancy. The server may also handle stateless view data requests limited by the number of results, and a “sort by ID” may be applied to ensure consistent results over time.
    Type: Application
    Filed: May 17, 2011
    Publication date: November 22, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Dmitri Davydok, Praveen Upadhyay
  • Publication number: 20120290553
    Abstract: A method and system are disclosed for optimizing search engine operations to increase the likelihood of attaining financial goals in a syndicated commerce environment. An SEO algorithm is implemented to determine keyword options for a predetermined product based upon the product's description, its web page content, and other related information. The SEO algorithm is then used to determine the product's associated search traffic and rank-per-keyword from various search engines. This information, in addition to sales conversion rate information, is then used to estimate the likelihood of monetization for one or more keyword. The product web page content is then automatically revised with an optimized combination of keywords. Once optimized, various search engines are automatically notified of the revisions to the web content pages to improve organic search rankings.
    Type: Application
    Filed: October 12, 2011
    Publication date: November 15, 2012
    Inventors: Aron England, Steven Tedjamulia, Manish C. Mehta, Ronald Vincent Rose
  • Publication number: 20120284254
    Abstract: Methods and systems for submitting media object queries and receiving suggested answers for the media object queries. In one aspect, a method includes receiving from a first user a first media object and a first query relating to content in the first media object, presenting the first media object and the first query to multiple second users, receiving a suggested answer to the first query from each of two or more second users of the multiple second users, where at least two of the suggested answers are distinct, ranking the suggested answers, and presenting one or more of the ranked suggested answers to the first user.
    Type: Application
    Filed: July 18, 2012
    Publication date: November 8, 2012
    Applicant: GOOGLE INC.
    Inventors: Gaurav Garg, Abhishek Bapna
  • Publication number: 20120284255
    Abstract: In one aspect, in general, a method of generating a dataflow graph representing a database query includes receiving a query plan from a plan generator, the query plan representing operations for executing a database query on at least one input representing a source of data, producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan, and altering one or more components of the dataflow graph based on at least one characteristic of the at least one input representing the source of data.
    Type: Application
    Filed: May 2, 2011
    Publication date: November 8, 2012
    Inventors: Ian Schechter, Glenn John Allin
  • Publication number: 20120278308
    Abstract: Methods, systems, and apparatus, including computer program products, for generating search query suggestions directed to a particular website. In one aspect, a method includes receiving a first set of suggestion data defining custom suggestions for a first website. The first set of suggestion data includes one or more first n grams and one or more second n grams that each represent a selectable alternative to a first n gram. The method also includes generating a suggestion resource and providing a search query suggestion tool to the first website, the suggestion tool being configured to generate a search query input field for webpages on the first website, receive a query input entered in the search query input field, and request that one or more query suggestions be provided as selectable alternatives to the search query input.
    Type: Application
    Filed: December 30, 2009
    Publication date: November 1, 2012
    Applicant: GOOGLE INC.
    Inventor: Xin Zhou
  • Publication number: 20120278306
    Abstract: Provided are techniques for generating a Graphical User Interface (GUI) based on relationships between tables identified in a data model and displaying the GUI to enable selection of the tables and columns in the tables. Via the GUI, a selection of at least one of the tables and a selection of at least one of the columns in the at least one of the selected tables are received. A statement is generated based on the selected tables and the selected columns. The statement is executed to obtain results. The results are processed to create a data object having a hierarchical structure that indicates the relationships between the tables.
    Type: Application
    Filed: July 6, 2012
    Publication date: November 1, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Roberta J. Cochrane, Ronald C. Leung, Louis S.W. Mau
  • Publication number: 20120278307
    Abstract: A system and/or method are implemented to process queries to a database. In particular, the processing of queries to the database is enhanced by enhancing the determination of join orders of tables implicated in queries. Join orders between relatively large numbers of tables are determined by dividing the set of tables to be ordered into a plurality of subsets of tables, and ordering the individual subsets of tables.
    Type: Application
    Filed: July 11, 2012
    Publication date: November 1, 2012
    Applicant: PARACCEL, INC.
    Inventors: RICHARD L. COLE, YIJOU CHEN, WILLIAM J. MCKENNA, SERGEI PERFILOV, AMAN SINHA, EUGENE SZEDENITS, JR.
  • Publication number: 20120278159
    Abstract: A technique is taught that improves how an organization engages with customers. In an embodiment, keywords are discovered to optimize for, and to integrate with, advertising systems to advertise a company website. A set of advertisements is created that improve the click-through rate from users. A optimized landing page experience is created to provide a best user experience to drive issue resolution and sales.
    Type: Application
    Filed: April 24, 2012
    Publication date: November 1, 2012
    Inventors: Gangadharan KUMAR, Ravi VIJAYARAGHAVAN
  • Publication number: 20120278300
    Abstract: A method for searching multiple documents on a computer system includes steps for sending a query to a system core where the query is passed to a search component for searching the documents. The system core in turn receives results from the search component indicating related documents to the query and passes to a summarization component a specified number of the results. The summarization component processes related documents corresponding to the specified number of results to produce a multi-document summary. The system core receives the summary from the summarization component. The multi-document summary is received from the system core.
    Type: Application
    Filed: June 29, 2012
    Publication date: November 1, 2012
    Inventor: Dmitri Soubbotin
  • Publication number: 20120278305
    Abstract: Embodiments of the present invention relate to dynamically merging executable structures in a database system. In one embodiment, there is provided a method of dynamically merging executable structures in a database system that includes, in response to a query to the database system, extracting a stem and a branch of a query statement. The query statement includes query conditions, and the branch includes at least a subset of the query conditions. An executable structure of the stem is obtained from a cache of the database system, and an executable structure of the branch is generated. The executable structure of the stem and the executable structure of the branch are merged into a runtime executable structure.
    Type: Application
    Filed: April 11, 2012
    Publication date: November 1, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ke Wei Wei, Xin Ying Yang, Xiang Zhou
  • Publication number: 20120271814
    Abstract: Constraints that restrict how corresponding identifiable groups of files are stored in a database, are enforced on corresponding file data. In response to a query on any data from an identifiable group of files, the effect of the constraint on how the corresponding data is stored is determined. The original query is rewritten, based on the effect of the constraint, so that the rewritten query is directed to a particular subset of the data stored in the database. Consequently, the search space is restricted to an identifiable subset of the database and execution of the rewritten query is more efficient than execution of the original query.
    Type: Application
    Filed: April 24, 2012
    Publication date: October 25, 2012
    Inventors: Muralidhar Krishnaprasad, Zhen Hua Liu, Vikas Arora
  • Publication number: 20120271842
    Abstract: The system and method of the present invention allows for the determination of the relevance of a content item to a query through the use of a machine learned relevance function that incorporate query differentiation. A method for selecting a relevance function to determine a relevance of a query-content item pair comprises generating a training set comprising one or more content item-query pairs. Content item-query pairs in the training set are collectively used to determine the relevance function by minimizing a loss function according to a relevance score adjustment function that accounts for query differentiation. The monotocity of relevance score adjustment function allows the trained relevance function to be directly applied to new queries.
    Type: Application
    Filed: June 29, 2012
    Publication date: October 25, 2012
    Inventors: Gordon Sun, Zhaohui Zheng, Hongyuan Zha
  • Publication number: 20120271815
    Abstract: Optimizing SQL queries for Simple Network Management Protocol (SNMP) Management Information Base (MIB) tables. An SNMP client receives a source query defined in structured query language to access data stored in one or more MIB tables. The SNMP client parses the source query into one or more queries and sub-queries and applies sets of optimization rules and heuristics to the source query to generate a query execution plan for each set of optimization rules and heuristics applied to the source query. The SNMP client selects an optimal query execution plan from the generated query execution plans and rewrites the source query as a SNMP-based query using the optimization rules and heuristics specified in the optimal query execution plan. The SNMP-based query may then be used to retrieve the data requested by the source query without performing a full query scan of the MIB tables.
    Type: Application
    Filed: July 3, 2012
    Publication date: October 25, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David J. Pennell, SR., Alexander Pikovsky
  • Publication number: 20120265751
    Abstract: Optimizing the execution of a query in a multi-database system includes identifying a region within a table, the table being referenced in the query. The region is stored on data-storage devices on first and second system databases in the multi-database system. A first access plan for the query is developed, the first access plan comprising accessing the version of the region stored on the first system database. A second access plan for the query is developed, the second access plan comprising accessing the version of the region stored on the second system database. A selection is made between the first access plan and the second access plan to execute the query. The query is executed using the selected access plan to produce a result.
    Type: Application
    Filed: October 12, 2011
    Publication date: October 18, 2012
    Inventors: Douglas Brown, John Mark Morris
  • Patent number: 8290937
    Abstract: Techniques are described for managing query execution by estimating and monitoring query execution time. Embodiments of the invention may generally receive a query to be executed and calculate an initial estimated execution time for the received query. If the initial estimated execution time does not exceed a threshold amount of time, embodiments of the invention may submit the query for execution. Once execution of the query has begun, embodiments of the invention may calculate an updated estimated execution time for the executing query, and if the updated estimated execution time exceeds the threshold amount of time, may halt the execution of the query.
    Type: Grant
    Filed: August 30, 2010
    Date of Patent: October 16, 2012
    Assignee: International Business Machines Corporation
    Inventors: Eric L. Barsness, John M. Santosuosso
  • Patent number: 8290917
    Abstract: A query that identifies an input data source is received. The input data source is partitioned into a plurality of partitions. Each of the partitions includes a set of data elements with an associated set of indices for indicating an ordering of the data elements. A query type for a query operator in the received query is identified. It is determined whether a reordering of data elements will be performed based on the identified query type. The data elements in at least one of the partitions are reordered when it is determined based on the identified query type that reordering will be performed.
    Type: Grant
    Filed: June 2, 2008
    Date of Patent: October 16, 2012
    Assignee: Microsoft Corporation
    Inventors: Igor Ostrovsky, John Duffy
  • Publication number: 20120259840
    Abstract: In an optimizer within a Relational Database Management System improved ways in which a search space (the universe of possible join combinations) is generated and managed and improved ways in which the elements of a search space are evaluated so that among other things unpromising elements are efficiently dropped (pruned).
    Type: Application
    Filed: April 8, 2011
    Publication date: October 11, 2012
    Applicant: Sybase, Inc.
    Inventor: Anisoara NICA
  • Publication number: 20120259852
    Abstract: A computer-implemented method of providing users with contextually relevant data associates metadata tags with data items extracted from a variety of data sources that summarize the data items in searchable form using a common format. Contextual data is collected from the users indicative of their current situation. This data is then correlated with the metadata tags to identify data items of potential interest to the users taking into account their current situation. The identified data items are pushed to the relevant receiving devices in real time over a communications network to provide the identified users with information relevant to their current situation.
    Type: Application
    Filed: April 4, 2012
    Publication date: October 11, 2012
    Applicant: nTerop Corporation
    Inventors: Michael Aasen, Jordan Parsons, Sina Eizadshenass, Andrew Fisher
  • Publication number: 20120259839
    Abstract: Network security is enhanced in a multi-tenant database network environment using a query plan detection module to continually poll the database system to locate and raise an alert for suspect query plans. Security also can be enhanced using a firewall system sitting between the application servers and the client systems that records user and organization information for each client request received, compares this with information included in a response from an application server, and verifies that the response is being sent to the appropriate user. Security also can be enhanced using a client-side firewall system with logic executing on the client system that verifies whether a response from an application server is being sent to the appropriate user system by comparing user and organization id information stored at the client with similar information in the response.
    Type: Application
    Filed: June 20, 2012
    Publication date: October 11, 2012
    Applicant: SALESFORCE.COM, INC.
    Inventors: Eric Chan, Craig Weissman, Paul Nakada, Dave Moellenhoff, Todd McKinnon
  • Publication number: 20120254155
    Abstract: A method and system for providing up-to-date monitoring results in a virtual machine environment are described. In one embodiment, a host controller receives a new query pertaining to at least one object in a virtual machine system from a client, and determines whether the new query is similar to any queries previously received from other clients. If the new query is similar to any of the previously received queries, the host controller provides data pertaining to a result of a last execution of the similar query to the client. If the new query is not similar to any of the previously received queries, the host controller executes the new query and provides a result of an execution of the new query to the client.
    Type: Application
    Filed: March 28, 2011
    Publication date: October 4, 2012
    Inventors: Itamar Heim, Vitaly Elyashev, Amos Benari
  • Publication number: 20120254143
    Abstract: A natural language query tool comprising cascaded conditional random fields (CRFs) (e.g., a linear-chain CRF and a skip-chain CRF applied sequentially) processes natural language input to produce output that can be used in database searches. For example, cascaded CRFs extract entities from natural language input that correspond to column names or column values in a database, and identify relationships between the extracted entities. A search engine can execute queries based on output from the cascaded CRFs over an inverted index of a database, which can be based on one or more materialized views of the database. Results can be sorted (e.g., according to relevance scores) and presented in a user interface.
    Type: Application
    Filed: May 26, 2011
    Publication date: October 4, 2012
    Applicant: Infosys Technologies Ltd.
    Inventors: Kishore Indukuri Varma, Srikumar Krishnamoorthy, Radha Krishna Pisipati
  • Publication number: 20120254154
    Abstract: A database management system implemented in a cloud computing environment. Operational nodes are assigned as controller-nodes, compute-nodes or storage-nodes. The number of operational nodes, and their assignment as compute-nodes or storage-nodes can vary. Queries specify tables, with each such table assigned to a respective group of storage nodes. The number of operational nodes executing a given query may change by (a) changing the compute-nodegroup associated with a connection, or (b) adding or removing nodes from the compute-nodegroup; and/or distributing data from the tables among the nodes in a storage nodegroup.
    Type: Application
    Filed: May 3, 2012
    Publication date: October 4, 2012
    Inventors: Kenneth Rugg, Mrithyunjaya Annapragada, Douglas A. Shelley, Morgan Jones
  • Publication number: 20120254153
    Abstract: Hub based labeling is used, in databases, to determine a shortest path between two locations. Every point has a set of hubs: this is the label (along with the distance from the point to all those hubs). The hubs are determined that intersect the two labels. This information is used to find the shortest distance. A hub based labeling technique uses, in a database, a preprocessing stage and a query stage. Finding the hubs is performed in the preprocessing stage, and finding the intersecting hubs is performed in the query stage using relational database operators, such as SQL queries. During preprocessing, a forward label and a reverse label are defined for each vertex. The labels are generated using contraction hierarchies that may be guided by shortest path covers. A query, such as an SQL query, is processed using the labels to determine the shortest path.
    Type: Application
    Filed: November 2, 2011
    Publication date: October 4, 2012
    Applicant: Microsoft Corporation
    Inventors: Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
  • Publication number: 20120246146
    Abstract: 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: Application
    Filed: March 16, 2012
    Publication date: September 27, 2012
    Applicant: Industry-Academic Cooperation Foundation, Yonsei University
    Inventor: Won Suk Lee
  • Publication number: 20120246145
    Abstract: A system and method allowing customization of a user-interface into a data repository are disclosed. Customization options are provided via a hierarchy and/or compartmentalization of structured control files such as Extensible Markup Language (XML) files. The control files may be defined in a hierarchical fashion allowing a particular end-user or group of end-users to customize their interface without impacting other users of the same data and user-interface system. Compartmentalization of functions to specific files may also aid in ease of maintenance of customizations. Customization may include an ability to customize what data is shown on a screen and which capabilities are available on each screen for data interaction pertaining to a particular job responsibility. Capabilities to provide these and other customization options to an end-user are disclosed in a non-limiting embodiment of an import export trade transaction storage and retrieval system.
    Type: Application
    Filed: March 25, 2011
    Publication date: September 27, 2012
    Applicant: MANAGEMENT SYSTEMS RESOURCES, INC.
    Inventors: Steven Lloyd Crozier, Antonio Giuliano, Rajiv Manucha
  • Publication number: 20120239641
    Abstract: A method, article of manufacture, and apparatus for processing queries, comprising analyzing a query tree, determining at least one operator based on the query tree analysis, assigning a memory allocation for each of the at least one operator, and storing the assignment in a storage device. In some embodiments, a memory classification for each of the at least one operator is determined. In some embodiments, assigning a memory allocation for each of the at least one operator includes assigning a memory allocation based on the memory classification.
    Type: Application
    Filed: March 18, 2011
    Publication date: September 20, 2012
    Applicant: EMC CORPORATION
    Inventors: Sivaramakrishnan Narayanan, Florian Michael Waas, Joy Jie Kent
  • Patent number: 8271472
    Abstract: A portal having one or more associated data sources is defined, the portal including one or more portlets for displaying information associated with the one or more associated data sources. An index of the one or more associated data sources is generated. A search query is transmitted to a search engine. The index is searched for data associated with the search query. A result set is received based, at least in part, upon the index and the data associated with the search query.
    Type: Grant
    Filed: February 17, 2009
    Date of Patent: September 18, 2012
    Assignee: International Business Machines Corporation
    Inventors: Eric de Morentin Martinez, Mark Carl Hampton, Stefan Hepper
  • Publication number: 20120233149
    Abstract: Systems and methods for automatically determining the availability of resources, such as Internet advertising opportunities, are described herein. The systems and methods efficiently process bulk queries that specify multiple target values for at least one attribute associated with the resources, such bulk queries being useful for determining the availability of a wide variety of different resource types.
    Type: Application
    Filed: March 8, 2011
    Publication date: September 13, 2012
    Applicant: Yahoo! Inc.
    Inventors: Ramana Yerneni, Manu Sreenivasachar, Haiying Huang
  • Publication number: 20120233148
    Abstract: Provided are techniques for creating one or more fine-grained access control rules that are associated with a base table. A materialized query table is created from the base table without applying the one or more fine-grained access control rules associated with the base table when obtaining data from the base table. A fine-grained access control protection indicator is turned on for the materialized query table. In response to receiving a direct access request to the materialized query table in a query referencing the materialized query table, access is provided to the data in the materialized query table by applying one or more fine-grained access control rules associated directly with the materialized query table to the data in the materialized query table before returning the data.
    Type: Application
    Filed: March 9, 2011
    Publication date: September 13, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Yao-Ching S. CHEN, Curt L. COTNER, Gerald G. KIERNAN, David J. KUANG, Irene C. LIU, Regina J. LIU, Walid RJAIBI, Timothy J. VINCENT
  • Publication number: 20120226679
    Abstract: A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights.
    Type: Application
    Filed: March 2, 2011
    Publication date: September 6, 2012
    Applicant: Microsoft Corporation
    Inventors: Sreenivas Gollapudi, Sayan Bhattacharya
  • Publication number: 20120226713
    Abstract: In an example embodiment, signals are collected from one or more first channels in a communication network. The one or more first channels may include at least one of organic search, paid search, or social media. Based on the collected signals, a recommendation is made with respect to a campaign within a second channel.
    Type: Application
    Filed: March 1, 2012
    Publication date: September 6, 2012
    Applicant: BRIGHTEDGE TECHNOLOGIES, INC.
    Inventors: Lemuel S. PARK, Jimmy YU, Sammy YU
  • Publication number: 20120221549
    Abstract: A select query or a data referencing a calculation scenario is received by a database server from a remote application server. The specified calculation scenario is one of a plurality of calculation scenarios and it defines a data flow model that includes one or more calculation nodes. Each calculation node defines one or more operations to execute on the database server. Thereafter, the database server instantiates the specified calculation scenario and executes the operations defined by the calculation nodes of the instantiated calculation scenario to result in a responsive data set. This data set is then provided by the database server to the application server. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: May 3, 2012
    Publication date: August 30, 2012
    Applicant: SAP AG
    Inventors: Christoph Weyerhaeuser, Daniel Baeumges, Tobias Mindnich, Thomas Legler
  • Publication number: 20120221538
    Abstract: Methods, systems and computer program products for traversing a level in a search path in a tree data structure by recording a version number of a node on the search path, finding a child pointer in the node on the search path, recording a version number of a child node corresponding to the child pointer, reading a version number of the node on the search path, comparing the recorded version number of the node to the read version number of the node, reading at least one child pointer in the node and comparing the read child pointer to an address of the child node.
    Type: Application
    Filed: February 28, 2011
    Publication date: August 30, 2012
    Applicant: International Business Machines Corporation
    Inventor: Antti-Pekka Liedes
  • Publication number: 20120215764
    Abstract: Techniques are described for managing query execution using additional performance capabilities from a set of system resources. Embodiments may receive a query and calculate a first estimated execution time for processing the query using a first amount of performance capabilities from a first set of system resources. If embodiments determine that the first estimated execution time exceeds a threshold amount of time, a second estimated execution time is then calculated for processing the query using a second amount of performance capabilities from the first set of system resources. Here, the second amount of performance capabilities is in addition to the first amount of performance capabilities. If the second estimated execution time does not exceed the threshold amount of time, the query is executed using the second amount of performance capabilities from the first set of system resources.
    Type: Application
    Filed: February 17, 2011
    Publication date: August 23, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Eric L. Barsness, John M. Santosuosso
  • Publication number: 20120203761
    Abstract: A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.
    Type: Application
    Filed: February 8, 2011
    Publication date: August 9, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Giora Biran, Christoph Hagleitner, Timothy H. Heil, Russell D. Hoover, Jan Van Lunteren
  • Publication number: 20120203763
    Abstract: In a networked computer system that includes multiple nodes and multiple networks interconnecting the nodes, a database query optimizer takes network choice into consideration when optimizing a query. The query optimizer logs historical information for queries that includes network information. A network monitor determines network characteristics of the multiple networks. The query optimizer then selects a network for a query based on the network characteristics, and optionally based on the historical information as well. The result is a query optimizer that takes network choice into consideration, thereby providing a query that is optimized according to the characteristics of the networks.
    Type: Application
    Filed: April 17, 2012
    Publication date: August 9, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Eric L. Barsness, David L. Darrington, Amanda Peters, John M. Santosuosso
  • Publication number: 20120203772
    Abstract: Online information is retrieved for a user. An original query submitted by the user is received which includes a plurality of query terms the user associates with particular online information the user is interested in. The original query is then analyzed using data from an online knowledge repository and a historical query log of a search engine to determine central concepts of the original query. A revised query results from this analysis which includes one or more of the central concepts. The revised query is then submitted to the search engine. Search results for the revised query are then provided to the user.
    Type: Application
    Filed: February 7, 2011
    Publication date: August 9, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Silviu-Petru Cucerzan, Anthony James Fader
  • Publication number: 20120203762
    Abstract: One example discloses a database management system that can comprise a memory for storing computer executable instructions and a processing unit for accessing the memory and executing the computer executable instructions. The computer executable instructions can comprise a compiler to hold a query received at a query input, thereby preventing the query from executing based on a cost comparison between an estimated resource execution cost of a query plan for the query and cost rules.
    Type: Application
    Filed: February 4, 2011
    Publication date: August 9, 2012
    Inventors: SUBBARAO KAKARLAMUDI, Anan Mahasintunan, Zbigniew Omanski, Patrick M. Brown, Capirala Tharaknath, Arvind Narain
  • Publication number: 20120197870
    Abstract: A method is provided for transforming entity and relation data using a proxy engine. A proxy data engine can intercept a virtual query directed to a data provider application on a data repository device. The proxy data engine can transform the virtual query into a native query capable of being processed by the data provider application. The virtual query can include a virtual entity-relation object not included in the native query. The proxy data engine can transform a native result into a virtual result including the virtual entity-relation object. The native result can be a response to the native query and the native result can be received by the data provider application.
    Type: Application
    Filed: January 27, 2011
    Publication date: August 2, 2012
    Inventors: Jan Simon, Jan Trcka, Pavel Chmelicek
  • Publication number: 20120197867
    Abstract: A method and apparatus for generating at least one data record in respect to a database query comprising a fetch command. A database may be updated according to the at least one data record. In an exemplary embodiment, a database management system may be tested by performing the database query against the database. In another exemplary embodiment, a data record that satisfies the database query is generated in order to increase coverage when testing a database management system.
    Type: Application
    Filed: April 15, 2012
    Publication date: August 2, 2012
    Applicant: International Business Machines Corporation
    Inventor: Shady Copty
  • Publication number: 20120197866
    Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. The disclosed mechanisms provide for a single-scan of the table on which the group-by query is applied. When the table is scanned, each processing module dynamically keeps track of the row(s) having a value of the attribute on which the equality condition is applied that equals or exceeds the maximum attribute value (assuming a maximum equality condition is applied) previously encountered by the processing module. Subsequently, a global aggregation process is then performed to compute the query's result without rescanning the table. Queries featuring a minimum equality condition are similarly processed in accordance with the disclosed embodiments.
    Type: Application
    Filed: April 13, 2012
    Publication date: August 2, 2012
    Inventor: Yu Xu
  • Publication number: 20120197869
    Abstract: There is provided a computer-implemented method of executing a query plan against a database. An exemplary method comprises accessing a first subset of rows of a database table using a direct access method for an index. The query plan may comprise the direct access method. The exemplary method also comprises determining a processing cost of accessing the first subset of rows. The exemplary method further comprises modifying the direct access method for the index in response to determining that the processing cost exceeds a specified threshold. Additionally, the exemplary method comprises accessing a second subset of rows of the database table using the modified direct access method.
    Type: Application
    Filed: April 16, 2012
    Publication date: August 2, 2012
    Inventors: David W. Birdsall, Yung-Li L. Jow, Goetz Graefe
  • Publication number: 20120197865
    Abstract: A system and method for implementing incremental evaluation that is advantageous over nonincremental evaluation. The system and method incrementally maintain each individual aggregate value, for non-nested queries, using a constant amount of work.
    Type: Application
    Filed: June 25, 2010
    Publication date: August 2, 2012
    Applicant: CORNELL UNIVERSITY
    Inventors: Christoph E. Koch, Yanif Ahmad
  • Publication number: 20120191702
    Abstract: Adaptive index density in a database management system is provided, which includes receiving a number of partitions for an index for a database table, the index subject to creation. The adaptive index density also includes selecting a column from the database table, the column selected based upon an estimated frequency of execution of database queries for the column. The adaptive index density further includes calculating an estimated cost of executing each of the database queries for the column, and determining data to reside in each of the partitions of the index responsive to the estimated cost.
    Type: Application
    Filed: January 26, 2011
    Publication date: July 26, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: John G. Musial, Abhinay R. Nagpal, Sandeep R. Patil, Yan W. Stein
  • Publication number: 20120191696
    Abstract: Methods and apparatus, including computer program products, for selection of rows and values from indexes with updates. In general, rows of an index may be associated with validity flags that indicate whether a row has been updated with an update inserted in a delta index; one scheme for value identifiers may be used for an index and another scheme for one or more delta indexes where all of the indexes are, to at least some extent, compressed according to dictionary-based compression; and multiple delta indexes may be used in alternation such that one delta index may accept updates while another is being updated. The delta indexes may also have validity flags and all updates, such as modifications of values, deletion of records, and inserting of new records may be handled as updates accepted by one or more delta indexes.
    Type: Application
    Filed: April 5, 2012
    Publication date: July 26, 2012
    Inventors: Frank Renkes, Thomas Peh, Andrew Ross, Holger Schwedes, Wolfgang Stephan