Query Optimization (epo) Patents (Class 707/E17.017)
  • 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
  • Publication number: 20130290292
    Abstract: A query is received, and in response, an initial data flow graph is generated that includes a plurality of nodes for executing the query with at least one of the nodes having at least one associated hint. The initial data flow graph is subsequently optimized using a model optimizer having a rules engine using a plurality rules to optimize the initial data flow graph. The at least one associated hint is used by the model optimizer to change how at least one of the plurality of rules is applied. Thereafter, execution of the query is initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: April 26, 2012
    Publication date: October 31, 2013
    Applicant: SAP AG
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Daniel Baeumges, Gerrit Simon Kazmaier
  • Publication number: 20130290298
    Abstract: A query is received and an initial data flow graph comprising a plurality of nodes is generated for executing the query. The initial data flow graph is optimized using a model optimizer that accesses at least one of a plurality of patterns to identify a matching pattern and executes at least one optimization rule associated with a matching pattern. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: April 26, 2012
    Publication date: October 31, 2013
    Applicant: SAP AG
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Daniel Baeumges, Gerrit Simon Kazmaier
  • Publication number: 20130290295
    Abstract: In at least some examples, a system includes a distributed database and control logic to enable updates and queries to the distributed database. The control logic applies a plurality of identifiers to the updates and queries to maintain distinct fault domains in the distributed database.
    Type: Application
    Filed: April 30, 2012
    Publication date: October 31, 2013
    Inventors: Craig A. Soules, Alistair Veitch, Charles B. Morrey, III, Kimberly Keeton
  • Publication number: 20130290294
    Abstract: A system, method, and non-transitory computer readable medium are disclosed herein to optimize nested queries. At least one field is associated with each row of data evaluated by at least one nested query. A value is assigned to the at least one field so as to indicate whether each row of data satisfies the at least one nested query. The at least one field associated with each row of data is evaluated to determine satisfaction of the at least one nested query.
    Type: Application
    Filed: April 27, 2012
    Publication date: October 31, 2013
    Inventors: Matthew Steven Fuller, Charles Edward Bear
  • Publication number: 20130290297
    Abstract: A query is received which causes an initial data flow graph that includes a plurality of nodes that are used to execute the query is generated. Thereafter, the initial data flow graph is optimized using a model optimizer that includes an optimizer framework and an application programming interface (API). The optimizer framework provides logic to restructure the initial data flow graph and a rules engine for executing one or more optimization rules. The API allows for registration of new optimization rules to be executed by the rules engine. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: April 26, 2012
    Publication date: October 31, 2013
    Applicant: SAP AG
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Daniel Baeumges, Gerrit Simon Kazmaier
  • Publication number: 20130290293
    Abstract: A query statement is received that specifies a count distinct. Thereafter, a data flow graph that comprises a plurality of nodes for executing the query is generated. The nodes provide aggregation operations, sorting of results on join attributes and vertically appending columns of count distinct results with intermediate results from at least one of the aggregation operations. Thereafter, execution of the query is initiated using the data flow graph. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: April 26, 2012
    Publication date: October 31, 2013
    Applicant: SAP AG
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Daniel Baeumges, Gerrit Simon Kazmaier
  • Publication number: 20130290296
    Abstract: A system, method, and non-transitory computer readable medium are provided to access a graph comprising a plurality of nodes and at least one edge. Each node is associated with at least one database operation. Computer code is constructed that corresponds to the graph in accordance with a nesting level. The nesting level represents a degree of temporary storage to be allocated for intermediate output produced by the at least one database operation.
    Type: Application
    Filed: April 26, 2012
    Publication date: October 31, 2013
    Inventors: Alkiviadis Simitsis, William K. Wilkinson
  • Publication number: 20130262431
    Abstract: A method for matching a search request from a client device includes detecting the search request from the client device, storing content listings within a content database where each of the content listings represents content, and searching for a match result between the search request and the content listings. A subscription to a subscribed content provider is detected and associated with the client device. The match result is displayed to indicate the content listings associated with the subscribed content provider.
    Type: Application
    Filed: March 27, 2012
    Publication date: October 3, 2013
    Applicant: ROKU, INC.
    Inventors: Gregory Mack Garner, David A. Westerhoff, Wendy M. Abowd, Thomas C. Markworth, Patrick Ellis, Jonathan Colorado Criswell
  • Publication number: 20130262436
    Abstract: A database query governor determines when a query cannot be executed within a defined time threshold, but still executes the query or some variant of the query so partial results for the query may be returned to the user after executing for less than the defined time threshold, instead of an error message indicating the query was not executed at all. The partial results provide information to the user that may be sufficient for some applications, or may indicate to the user how the query could be modified to run in less time.
    Type: Application
    Filed: March 30, 2012
    Publication date: October 3, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Eric L. Barsness, John M. Santosuosso
  • Publication number: 20130262435
    Abstract: An adaptive query execution plan enhancement is provided by: selecting a sample of literal sets from an execution history of a query statement; determining a plurality of access paths by applying each literal set in the sample to the query statement; for each given access path of the plurality of access paths, determining a total execution cost by applying each literal set in the sample to the given access path; and selecting a preferred access path from the plurality of access paths based on the total execution costs for each given access path. A plurality of preferred access paths for a plurality of query statements in an application workload is collected and may be presented as a query execution plan enhancement recommendation to users.
    Type: Application
    Filed: March 28, 2012
    Publication date: October 3, 2013
    Applicant: International Business Machines Corporation
    Inventors: Patrick D. BOSSMAN, Curt L. COTNER, You-Chin FUH, Adarsh S. PANNU, Kun Peng REN
  • Publication number: 20130238596
    Abstract: A method, system and computer program product for identifying reference data tables in an Extract-Transform-Load (ETL) process, by identifying, by operation of one or more computer processors, at least a first reference data operator in the process, wherein the first reference data operator references one or more tables and evaluating at least a first table referenced by the reference data operator to determine whether the first table is a reference data table by assigning a score to the first table, wherein the score is indicative of the likelihood that the first table is a reference data table and wherein a reference data table contains a set of values that describes other data.
    Type: Application
    Filed: March 8, 2012
    Publication date: September 12, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Dan J. Mandelstein, Ivan M. Milman, Martin A. Oberhofer, Sushain Pandit
  • Publication number: 20130238612
    Abstract: An approach is provided for determining refined search results for a query. The approach involves processing one or more interactions of a user with one or more content items to cause, at least in part, an accumulation of the one or more interactions of the user. The approach also involves processing the accumulation of the one or more interactions to determine one or more interaction patterns. The approach additionally involves determining one or more user preferences based, at least in part, on the one or more interaction patterns. The approach further involves causing, at least in part, a scope of one or more search results for a query to be based, at least in part, on the one or more user preferences.
    Type: Application
    Filed: March 8, 2012
    Publication date: September 12, 2013
    Applicant: XEROX CORPORATION
    Inventors: Jason C. TSONGAS, Matthew O. SCRAFFORD, Daniel A. COCCIA
  • Publication number: 20130238549
    Abstract: Systems, methods and computer program products that provide a framework for the creation, editing, manipulation and use of model-based, multidimensional analysis services (MAS) cubes and using substitute dimensions in such cubes are disclosed. To permit a user to obtain better and automatic access to business intelligence, a method of generating a model-based MAS cube comprises creating a data source comprising a data warehouse in the memory via the processor, creating a data source view providing a dimension, a fact and an outrigger from the created data source, and creating the MAS cube comprising at least one measure group. Using substitute dimensions comprises finding all relevant substitutions for a measure group, creating a table for the measure group in the data source view, adding a property as the primary key of the substitute dimension and generating a query containing an inner join logical link between the substitute and original dimension.
    Type: Application
    Filed: March 7, 2012
    Publication date: September 12, 2013
    Applicant: MIRCOSOFT CORPORATION
    Inventors: Vijay Aski, Danny H. Chen, Chris Lauren
  • Publication number: 20130232132
    Abstract: A method for managing the Search Engine Optimization (SEO) content of web pages is disclosed. In one embodiment, such a method includes providing a set of web pages organized in a hierarchical structure. Each web page has an SEO content pattern associated therewith. The method establishes an inheritance scheme for the hierarchical structure such that the SEO content patterns of parent web pages are inherited by children web pages. The method further enables a user to override the inheritance scheme for selected web pages such that the SEO content patterns of the selected web pages override the SEO content patterns of their respective parent web pages. A corresponding apparatus and computer program product are also disclosed.
    Type: Application
    Filed: March 4, 2012
    Publication date: September 5, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Pavan Kini, Rakesh Nagaraja Kote, Karson Ng, Walfrey Ng, Siddharth C. Ravi Kanth Rao, Guru Prasad Shamanna
  • Publication number: 20130226904
    Abstract: A lowest common ancestor of a first data sequence and a second data sequence is determined. Based on the lowest common ancestor, symbols that differ between the first data sequence and the second data sequence are identified. A distance between the first data sequence and the second data sequence is determined based on the symbols.
    Type: Application
    Filed: February 27, 2012
    Publication date: August 29, 2013
    Inventors: Abdullah A. MUEEN, Krishnamurthy Viswanathan, Chetan K. Gupta
  • Publication number: 20130218866
    Abstract: Architecture that includes a multimodal graph modeling and computation system employed in a search framework. The framework utilizes entities to diversify and explore the results page. The multimodal graph modeling paradigm can include web modeling by way of a click graph, a web graph, a social graph, a geospatial graph, and an entity graph, for example. These graphs are then joined based on common properties such as links, clicks, and document entities. Computation can then be performed over the joined graphs to generate a related entity list and a related page list. These lists are then processed by a recommendation engine to provide recommendations to the user.
    Type: Application
    Filed: February 20, 2012
    Publication date: August 22, 2013
    Applicant: Microsoft Corporation
    Inventors: Richard J. Qian, Xiaodong Fan
  • Publication number: 20130204811
    Abstract: To provide an optimized query generating device capable of generating an optimized query to be given with domain knowledge when generating a discriminant model on which the domain knowledge indicating user's knowledge or analysis intention for a model is reflected. A query candidate storage means 86 stores candidates of a query which is a model to be given with domain knowledge indicating a user's intention. An optimized query extraction means 87 extracts queries having low uncertainty of a discriminant model estimated by queries given with domain knowledge when the domain knowledge is given thereto from query candidates.
    Type: Application
    Filed: May 31, 2012
    Publication date: August 8, 2013
    Applicant: NEC CORPORATION
    Inventors: Satoshi MORINAGA, Ryohei FUJIMAKI, Yoshinobu KAWAHARA
  • Publication number: 20130204861
    Abstract: A method and apparatus for facilitating finding a nearest neighbor in a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving information indicative of a query point and information indicative of a node in the database tree; determining, by use of a processor, a lower-bound estimate based on the node and the query point, wherein the lower-bound estimate corresponds to a distance from the query point to the node; determining, by use of the processor, a temporary result corresponding to a distance to a nearest neighbor based on at least one child node of the node, the query point, and the lower-bound estimate; pruning one or more of the plurality of nodes based on the lower-bound estimate and a pruning bound; and returning a result indicative of a nearest neighbor of the query point.
    Type: Application
    Filed: February 3, 2012
    Publication date: August 8, 2013
    Applicant: QUOVA, INC.
    Inventor: Armand Erik Prieditis
  • Publication number: 20130198165
    Abstract: Techniques are disclosed for generating statistical views in a database system. In one embodiment, a request is received to execute a database workload. One or more constraints pertaining to executing the database workload is retrieved. The database workload is evaluated to generate multiple statistical view candidates. The statistical view candidates are refined based on the one or more constraints. One or more statistical views are then generated based on the refined statistical view candidates.
    Type: Application
    Filed: January 30, 2012
    Publication date: August 1, 2013
    Applicant: International Business Machines Corporation
    Inventors: Qi Cheng, John F. Hornibrook, Ting Y. Leung, Xin Wu, Daniel C. Zilio, Calisto P. Zuzarte
  • Publication number: 20130198164
    Abstract: Methods and apparatus, including computer program products, implementing and using techniques for executing a query in a computer to retrieve data from a relational database stored on a data storage device. A query is received that contains a CASE expression having one or more subqueries. A query execution plan is generated. The query execution plan uses a parameterized union all operator to keep the semantics of the CASE expression, and a nested loop join operator to drive data across the section of the query execution plan that executes the CASE expression without performing any join operations. The generated query execution plan is executed in the computer to retrieve data from the relational database.
    Type: Application
    Filed: January 26, 2012
    Publication date: August 1, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Qi Cheng, John F. Hornibrook, Jose A. Saborit, David C. Sharpe, Calisto P. Zuzarte
  • Publication number: 20130185321
    Abstract: An apparatus and a method of optimizing queries through scheduling User Defined Operators (UDOs) in a Data Stream Management System (DSMS), are provided. The apparatus includes a query optimizer configured to receive queries, each of the queries including the UDOs and data streams subject to respective operations of the UDOs, and group the data streams and UDOs into scheduling units, each of the scheduling units including one of the data streams and one of the UDOs. The apparatus further includes a scheduler configured to schedule an execution order in which the scheduling units are executed.
    Type: Application
    Filed: June 20, 2012
    Publication date: July 18, 2013
    Applicant: Samsung Electronics Co. Ltd.
    Inventors: Seung-Woo RYU, Seok-Jin Hong, Kyoung-Gu Woo, Ki-Yong Lee
  • Publication number: 20130185281
    Abstract: A flexible database and iterative spatial search process is described. In an embodiment, a flexible database server is described which takes input queries in the form of XML strings describing a search specification and parses them using a stored procedure. Searching is performed by generating a temporary table for each term in the search specification and then comparing the temporary tables to pre-existing tables within the database to identify datasets that meet the search specification. An application is also described which generates the XML string in response to user input and which displays the results to a user. The application provides a user interface which enables users to select attributes of results, such as the spatial data associated with a dataset, to include in a second search specification and to trigger this new search.
    Type: Application
    Filed: January 17, 2012
    Publication date: July 18, 2013
    Applicant: MICROSOFT CORPORATION
    Inventors: Lucas Neal Joppa, Andrew Bryan Roberts, Richard James Williams
  • Publication number: 20130179434
    Abstract: The present disclosure is related to managing delivery of items of invitational content based on a feature-based model. Specifically, a content delivery system is provided for managing a campaign using a content bundle identifying different content blocks and rules for assembling the content blocks into the items of invitational content. The feature-based model then accrues costs based on content blocks delivered, content blocks accessed, a degree of user interaction with the accessed content blocks, or any combinations thereof. The relative performance of the items can be evaluated by obtaining a ranking based at least on the number of content blocks and a performance of these content blocks. The ranking can then be used to manage future assembly and delivery of items. In some configurations, rules can be provided to specify when particular content items can be included as costs vary.
    Type: Application
    Filed: April 26, 2012
    Publication date: July 11, 2013
    Applicant: Apple Inc.
    Inventors: Mehul K. Sanghavi, Michael Froimowitz Greenzeiger
  • Publication number: 20130173589
    Abstract: Techniques for optimizing outer joins in database operations are provided. In an embodiment, a query having an outer join with a GROUP BY clause is rewritten and expanded to expand a first level partition of that GROUP BY clause to produce a modified query. In another situation, rows associated with processing a query are each row split and then hashed based at least in part on attributes of the outer join predicate. A left outer join is performed and a global aggregation processed to produce a spooled table to process the query.
    Type: Application
    Filed: December 29, 2011
    Publication date: July 4, 2013
    Inventors: Yu Xu, Ahmad Said Ghazal
  • Publication number: 20130173590
    Abstract: A nested database query can be optimized by effectively representing a filtering function or operation (e.g., SQL filtering operation) of its outer sub-query by a qualification or qualify operation (e.g., SQL qualification operation) associated with at least one windowing function of at least one of its inner sub-queries. It will be appreciated that this representation can yield a modified query that would be equivalent (e.g., semantically equivalent) to the original nested query as its execution can produce the same results when optimization rules are applied.
    Type: Application
    Filed: December 29, 2011
    Publication date: July 4, 2013
    Inventor: Ahmad Ghazal
  • Publication number: 20130173591
    Abstract: A system includes reception of a logical schema associated with a data store, generation of an input schema based on the logical schema, reception of an expression having a type of the input schema and representing the topology of a data set, the data set being an instance of the input schema, compilation of the expression to a data specification based on the input schema, and generation of a plan to execute on the data store based on the data specification.
    Type: Application
    Filed: December 29, 2011
    Publication date: July 4, 2013
    Inventors: Jean-Yves Cras, Bogdan Marinoiu, Gilles Vergnory-Mion, Yann Le Biannic
  • Publication number: 20130166531
    Abstract: Methods and apparatus, including computer program products, are provided for group-by access of a database. In one aspect there is provided a method. The method may include receiving from a user interface information defining a database and a database table; converting the received information into at least one instruction for performing the group-by and the sum at the database table included in the database; sending the at least one instruction to the database; receiving, in response to the at least one instruction sent, a result-set from the database, the result-set representative of the group-by and the sum of the database table; and providing the result-set to an interface. Related systems and articles of manufacture are also discloses.
    Type: Application
    Filed: December 22, 2011
    Publication date: June 27, 2013
    Inventor: Marco Valentin
  • Publication number: 20130166535
    Abstract: Methods and apparatus, including computer program products, are provided for receiving an indication of a defined outer join to enable obtaining a first database table at a first database and a second database table at a second database; sending a first request to the first database to obtain the first database table; sending a second request to the second database to obtain the second database table; receiving, in response to the first and second requests, each of the first and second database tables; performing an outer join on the received first and second database tables, the outer join forming an output database table; and providing the output database table.
    Type: Application
    Filed: December 22, 2011
    Publication date: June 27, 2013
    Inventor: Marco Valentin
  • Publication number: 20130166584
    Abstract: The invention relates to a system and method for extracting business process metrics from a Unified Modeling Language (UML) model. This invention involves the use of Object Constraint Language (OCL) and custom stereotypes to extract the design metrics from a UML model. The business process parameters to be measured are defined and custom stereotypes for each design element present in the business process parameters are also defined. A UML diagram is generated to represent the steps required to complete the business process. The UML diagrams are based on UML 2.0 or its higher version. The queries are written in OCL and run on the activity or sequence diagram to extract the desired metrics.
    Type: Application
    Filed: March 21, 2012
    Publication date: June 27, 2013
    Applicant: INFOSYS LIMITED
    Inventor: Santosh Kumar Rao
  • Publication number: 20130166534
    Abstract: A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result.
    Type: Application
    Filed: December 22, 2011
    Publication date: June 27, 2013
    Applicant: SAP AG
    Inventors: Yongsik Yoon, Chanho Jeong, Juchang Lee, Chang Bin Song, Yong Sik Kwon, Sang Kyun Cha
  • Publication number: 20130159285
    Abstract: A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition.
    Type: Application
    Filed: December 20, 2011
    Publication date: June 20, 2013
    Inventors: Jonathan Dees, Peter Sanders, Franz Faerber, Jochen Seidel
  • Publication number: 20130159278
    Abstract: The approaches described herein provide an efficient way to process certain kinds of queries that update XML data stored in an object-relational database. A query may include an XML query expression that conforms to a language for querying XML documents. A technique first determines whether the query contains an XML updating expression, and in response rewrites the query to comprise one or more path-based query operators that specify operations for updating XML data. The query may then be further rewritten to comprise one or more storage format specific query operators based on the particular database storage format associated with the XML data specified in the query. The rewritten query operators are used to generate a query execution plan that provides for several query execution optimizations.
    Type: Application
    Filed: December 19, 2011
    Publication date: June 20, 2013
    Inventors: Zhen Hua Liu, Hui Joe Chang, Balasubramanyam Sthanikam
  • Publication number: 20130159273
    Abstract: Embodiments are directed to optimizing searchable resources and to returning relevant search results. In one scenario, a computer system monitors multiple different social media sites to observe conversations related to the searchable resources. The computer system identifies terminology related to the searchable resources from any one or more of the observed conversations. The identified terminology identified may be based on topic, author, and/or place. The computer system then accesses known terminology used to search for the searchable resources and correlates a relationship between the known terminology and the identified terminology. The computer system also modifies the searchable resources to be responsive to a search request that is expressed using the identified terminology.
    Type: Application
    Filed: December 16, 2011
    Publication date: June 20, 2013
    Applicant: MICROSOFT CORPORATION
    Inventors: Richard Harvey James Orr, Dirk Myers, Kimberly Maughan Saunders, Guillermo Proano, Edward James Lehman, Jennifer Rowe Lussier
  • Publication number: 20130151502
    Abstract: A mixed join between database column and row tables employs an algorithm that recognizes both row and column store, and is executable upon the data in its native form (row or column) without requiring conversion between orientations. The native mixed join algorithm accesses the column dictionary of the column table for efficient join processing. The native mixed join algorithm may also exploit an inverted index (if present) to search a record (e.g. docid) with a given value. In particular, the native mixed join algorithm looks up a column dictionary for a join condition, while iterating the row table and returning matched records in a pipelined manner.
    Type: Application
    Filed: December 12, 2011
    Publication date: June 13, 2013
    Applicant: SAP AG
    Inventors: Yongsik Yoon, Chanho Jeong, Sang Kyun Cha
  • Publication number: 20130151495
    Abstract: Technologies are described herein that pertain to optimizing a ranker component for a risk-oriented objective. Various definitions of risk are described herein, wherein risk is based upon variance in performance scores assigned to the ranker component for respective queries in a data store. Additionally, risk is optionally based upon variance in relative performance of the ranker component versus a baseline ranker component.
    Type: Application
    Filed: December 13, 2011
    Publication date: June 13, 2013
    Applicant: MICROSOFT CORPORATION
    Inventors: Paul N. Bennett, Kevyn B. Collins-Thompson, Lidan Wang
  • Publication number: 20130151505
    Abstract: A computer system affords a user the ability to interactively formulate, visualize, and modify query plans that are to be posed to a database. The computer system provides query visualization in the form of decision trees having nodes selectable/deselectable to search for alternative query plans with lower or minimum execution time. The estimated cost and/or the execution time of a subtree of a query plan may be mapped according to a rectangle area metaphore, with the area of a rectangle enclosed by a larger rectangle representing a parent node in the plan tree. Query plans may be saved by the system in order to facilitate their visualization, optimization, and/or modification at a later date.
    Type: Application
    Filed: December 12, 2011
    Publication date: June 13, 2013
    Applicant: SAP AG
    Inventors: Yongsik Yoon, Chanho Jeong, Sang Kyun Cha
  • Publication number: 20130151503
    Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error.
    Type: Application
    Filed: December 8, 2011
    Publication date: June 13, 2013
    Inventor: Martin Pfeifle
  • Publication number: 20130144866
    Abstract: Various embodiments of systems and methods for a fault tolerance based query execution are described herein. Queries are received from users, the queries including operators. A multi-query optimization is performed on the operators included in the queries to obtain a query plan. A fault tolerance degree is determined for the operators included in the query plan. Based on the fault tolerance degree of the operators, nodes are assigned to the operators included in the query plan. The assigned nodes execute the operators included in the query plan to execute the queries. In one aspect, the nodes simultaneously execute the operators included in the query plan.
    Type: Application
    Filed: December 6, 2011
    Publication date: June 6, 2013
    Inventors: ZBIGNIEW JERZAK, Thomas Heinze
  • Publication number: 20130138629
    Abstract: Systems, methods, and computer program product embodiments are provided for path-based query evaluation. The embodiments include representing a markup language document as a descriptive catalog, and capturing relationships in the descriptive catalog as an index summary. The index summary is utilized for evaluating a path-based query.
    Type: Application
    Filed: November 29, 2011
    Publication date: May 30, 2013
    Applicant: Sybase, Inc.
    Inventor: Mohyuddin REHMATTULLAH
  • Publication number: 20130132371
    Abstract: Computer-implemented methods, systems and computer-readable media for providing a query layer for cloud databases comprise importing data into said cloud by at least one of the computing devices, converting at least one of the queries over row-store database into a query over column-store database by means of cost based query optimizer and retrieving said data from the column-store database based on said query by at least one of the computing devices.
    Type: Application
    Filed: November 23, 2011
    Publication date: May 23, 2013
    Applicant: INFOSYS TECHNOLOGIES LIMITED
    Inventors: S/shri. V. Bharath, Satyanarayana R. Valluri, Kamalakar Karlapalem, Radha Krishna Pisipati
  • Publication number: 20130124502
    Abstract: A method and apparatus for facilitating answering a query on a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving a set of input variable values, a non-empty set of output variables, and information indicative of a node in the database tree; determining a traversal cost based on the node and the set of input variable values; determining a lower bound based on the node and the set of input variable values, wherein the lower bound corresponds to an upper-bound probability estimate based on one or more of the plurality of nodes and the set of input variable values; pruning one or more of the plurality of nodes based on the traversal cost, the lower bound, and a pruning bound; and returning a result including a non-empty set of output variable values based on the set of input variable values, the node, the traversal cost, and the lower bound.
    Type: Application
    Filed: November 16, 2011
    Publication date: May 16, 2013
    Applicant: QUOVA, INC.
    Inventor: Armand Erik Prieditis
  • Publication number: 20130124507
    Abstract: The subject matter disclosed herein relates to generating a search result comprising one or more candidate documents selected based at least in part on one or more criteria associated with an input value of a visual information metric.
    Type: Application
    Filed: July 31, 2008
    Publication date: May 16, 2013
    Applicant: Adobe Systems Incorporated
    Inventor: Richard A. Gartland
  • Publication number: 20130124500
    Abstract: Various aspects of this disclosure are directed to receiving, by a computing device, a first table join query that may include a first group of table identifiers that identify the two or more tables. The computing device may determine whether the first table join query includes an outer join command. When the first table join query includes the outer join command, the computing device may compare the first group of table identifiers and a second group of table identifiers of one or more pre-joined tables to determine whether each of the first table identifiers matches at least one of the second group of table identifiers. The computing device may further determine whether a predicate associated with each table identifier matches a predicate associated with a matching second table identifier. When each of the predicates match, the computing device may rewrite the first table join query.
    Type: Application
    Filed: November 14, 2011
    Publication date: May 16, 2013
    Applicant: International Business Machines Corporation
    Inventors: Thomas A. Beavin, Mengchu Cai, Ruiping Li, James A. Ruddy
  • Publication number: 20130117255
    Abstract: Techniques are disclosed for accessing a dimensional data model when processing a query. In one embodiment, the query is processed by performing a two-stage zigzag join operation including a zigzag main join and a zigzag back join. The zigzag main join is configured to generate a set of row identifiers of fact records satisfying any local predicates in the query. The zigzag back join is configured to generate query results based on the set of row identifiers. The query results are returned responsive to the query.
    Type: Application
    Filed: November 8, 2011
    Publication date: May 9, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Shaorong Liu, David C. Sharpe, Chi Man J. Sizto
  • Publication number: 20130110819
    Abstract: According to a present invention embodiment, a system conducts a scan on a database object index with one or more gaps. The system generates one or more combinations of values for the gaps within an index with respect to an operation. Each combination of values is generated by scanning the index based on a combination of one or more scan values, adjusting a value for a gap based on scan results, and adjusting the scan values for a succeeding scan based on the scan results to reduce a quantity of scans. The index includes at least two database object elements. One or more scans of the index utilizing the combinations of values are conducted to retrieve data from the database and accommodate each gap in the index. Present invention embodiments further include a method and computer program product for conducting the index scan.
    Type: Application
    Filed: October 31, 2011
    Publication date: May 2, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gopi K. Attaluri, Michael J. Winer
  • Publication number: 20130103671
    Abstract: A search query to provide a search result may be received, which identifies source and target nodes and an application for generating the search result. The application accesses a data structure holding landmark nodes, which store a shortest path tree in the form of a set of parent links. Each parent link can identify an adjacent vertex node in a shortest path between each node in the data structure and the landmark node. The location of the source node and the target node in the shortest path trees may be identified to the landmark node. For each landmark node, using the identified locations of the target node and source node, a measure of distance between the source node and the target may be generated. The landmark node with the shortest distance may be determined. A search result related to the shortest path tree of that landmark node may be provided.
    Type: Application
    Filed: December 30, 2011
    Publication date: April 25, 2013
    Inventors: Konstantin Tretjakov, Luciano Garcia-BaƱuelos, Abel Armas-Cervantes, Jaak Vilo, Marlon G. Dumas
  • Publication number: 20130103670
    Abstract: A data management system receives a query. A query optimizer determines an access plan for the query. The access plan has a plurality of stages, where each stage may have a different degree of parallelism for processing threads executing the stage. The query optimizer determines a maximum degree of parallelism for the plurality of stages and reserves processor cores based on the maximum degree of parallelism. The data management system schedules threads on the reserved processor cores for a first stage of the access plan. The data management system changes simultaneous multi-threading (SMT) mode for the processor cores when a second stage of the access plan having a different degree of parallelism is executed.
    Type: Application
    Filed: October 21, 2011
    Publication date: April 25, 2013
    Applicant: International Business Machines Corporation
    Inventor: Sujatha Kashyap
  • Publication number: 20130103672
    Abstract: In various example embodiments, a system and method for personalization of search results are provided. In example embodiments, a user interface that allows a user to establish optimization preferences used to personalize results based on a query is provided. The optimization preferences include values that are a portion of a total allowed value assigned to interrelated optimization factors. The optimization preferences are received via the user interface. The optimization preferences are applied to matches obtained based on the query to generate a personalized result set.
    Type: Application
    Filed: October 21, 2011
    Publication date: April 25, 2013
    Applicant: eBay Inc.
    Inventors: Nishith Parikh, Neelakantan Sundaresan, Zeqian Shen
  • Publication number: 20130097150
    Abstract: An enterprise business intelligence system includes a data access service. In one example, a method comprises receiving, with a data access service, a query and a report specification from an application, wherein the data access service is positioned between the application and a data source; creating a run tree that comprises a sequence of executable decoration nodes; executing the query on the data source, thereby providing a query result set comprising query results drawn from the data source that are responsive to the query; and executing the sequence of decoration nodes on the query result set. The decoration nodes modify the query result set, thereby producing a decorated result set based on the query result set and the decoration nodes. Producing the decorated result set comprises associating members or values in the query results with corresponding positions or calculated members in the report specification.
    Type: Application
    Filed: October 18, 2011
    Publication date: April 18, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES INCORPORATED
    Inventors: David B. Cushing, Robin N. Grosset, Charles Ng, Martin Petitclerc