Query Optimization (epo) Patents (Class 707/E17.017)
  • Publication number: 20120191697
    Abstract: A system and methods for implementing a materialized view for a query are provided. The query system includes a database that includes a base table. The base table can include a set of data. The query system also includes a materialized view associated with a portion of the set of data, and a MVQR component to translate each of a range predicate of the materialized view and a range predicate of a query into a canonical range representation (CRR) format in materialized view metadata and query metadata, respectively, to enable the query to search the materialized view.
    Type: Application
    Filed: January 25, 2011
    Publication date: July 26, 2012
    Inventors: YUVAL SHERMAN, Barry Lynn Fritchman
  • Publication number: 20120191701
    Abstract: Database tables can have different types of database indices defined for the database tables and different numbers of database indices. The efficiency of reading the indexes can vary with the different profiles of the indexes, which impacts the costs of access plans that use the indexes. Weights can be predefined to reflect the relative efficiencies of the different characteristics. Costs can be computed in accordance with a variety of techniques (e.g., based on edge traversals). The weights can be predefined to reduce costs, increase costs, or a combination thereof. A database management application or associated application or program can also refine or revise these weights based on statistical data gathered about the operation of the database and/or heuristics that are developed based on observations/research. The corresponding weights can be adjusted accordingly.
    Type: Application
    Filed: January 26, 2011
    Publication date: July 26, 2012
    Applicant: International Business Machines Corporation
    Inventors: Abhinay R. Nagpal, Sandeep R. Patil, Gopikrishnan Varadarajulu
  • Publication number: 20120191642
    Abstract: Systems and apparatuses are provided for integrating user defined functions into an analytical data processing framework. The system includes a plurality of user defined functions (28), each having metadata defining an associated class type.
    Type: Application
    Filed: September 22, 2011
    Publication date: July 26, 2012
    Inventor: MUTHIAN GEORGE
  • Publication number: 20120191700
    Abstract: A “Book of Business” (or Book) is a set of business domain data of one or more book types. This set of data is identified by a “driving condition” or quality. A driving condition typically arises from a business practice, and may be further qualified by local conditions. Accordingly, data may be organized based on local activities or conditions that may not be explicitly stored in a database. In one embodiment, a method for querying the database includes identifying data in a database. The data is organized into one or more segments. A book of business associated with a segment in the one or more segments is then generated. The book of business includes a set of references to the data organized into the segment. A query plan may be determined based on the book of business. A set of results may then be generated based on the query plan.
    Type: Application
    Filed: April 5, 2012
    Publication date: July 26, 2012
    Applicant: Oracle International Corporation
    Inventors: Nicholas Manson, Colin Toal, Wei Luo, Chitra Mitra, Julie Choi Adams, Adam Edmonds, Kevin James Viggers
  • Publication number: 20120185461
    Abstract: A method and system for rewriting Structured Query Language (SQL) statements. A SQL statement having search criteria including conditions pertaining to fields in database tables is received. A table from the SQL statement listing all combinations of the search criteria is created, every combination reflecting a subset of information used to determine combined results. A set of patterns among the possible combinations of the SQL statement based on the fields referenced in the combinations is identified. The table based on the set of patterns is sorted. Based on the sorting, the table is divided into temporary tables which are joined with the SQL statement. New temporary tables are generated. Each new temporary table includes results of a search conducted using a separate portion of the SQL statement as joined with the set of temporary tables. All results from the new temporary tables are combined into a single result table.
    Type: Application
    Filed: March 21, 2012
    Publication date: July 19, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Howard S. Bloom, Roy Froehlich, Thomas A. Jobson, JR., Edith A. Kanyock, Charles F. Matula, Arnold M. Rosenberg
  • Patent number: 8224704
    Abstract: A system and method for distributing information (collectively the “system”) is disclosed. The system includes category-based, geography-based, and ratings-based attributes to better “focus” the information distributed by the system. In the processing of listing-based attributes (e.g. attributes limited to a particular listing), the system can also be influenced by relationship-based attributes (e.g. attributes between the administrator of the system and the advertisers, and even potentially users).
    Type: Grant
    Filed: February 13, 2009
    Date of Patent: July 17, 2012
    Assignee: SuperMedia LLC
    Inventors: Edwin Y. Harada, Douglas G. Heatherly, Lester K. Chu
  • Publication number: 20120179703
    Abstract: According to an embodiment, a receiving apparatus includes a memory, a first generator, a second generator, a transmitter, a receiver. The memory stores service information including search criteria set in a memory device and a connection method for connecting with the memory device. The first generator generates a common search query that is a search query expressing search conditions used in searching contents and that includes at least a pair of a common search condition attribute and a common search condition attribute value. The second generator generates a search query according to the search criteria specified in the service information with the use of the generated common search query. The transmitter transmits the generated search query to the memory device based on the connection method specified in the service information. The receiver receives, from the memory device, the attribute information obtained as a result of executing the search query.
    Type: Application
    Filed: January 24, 2012
    Publication date: July 12, 2012
    Applicant: KABUSHIKI KAISHA TOSHIBA
    Inventors: Daisuke Ajitomi, Yuji Irie, Hiroyuki Aizu, Naoki Esaka, Kohji Saiki
  • Publication number: 20120179668
    Abstract: A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance.
    Type: Application
    Filed: March 19, 2012
    Publication date: July 12, 2012
    Applicant: Microsoft Corporation
    Inventors: Chadd Creighton Merrigan, Mihai Petriuc, Raif Khassanov, Artsiom Ivanovic Kokhan
  • Publication number: 20120173515
    Abstract: Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.
    Type: Application
    Filed: December 30, 2010
    Publication date: July 5, 2012
    Inventors: Chanho Jeong, Sang Yong Hwang, Sang Kyun Cha, Sung Heun Wi
  • Publication number: 20120173514
    Abstract: Systems and methods for automatically processing a textual document by identifying occurrences of a piece of text having a predetermined format in the textual document; determining a depth-of-treatment value for each piece of formatted text in the textual document, the depth-of-treatment value indicating a depth of treatment in the textual document afforded to the particular piece of formatted text; associating an abstract with each piece of formatted text in the textual document; and generating a data record containing each identified piece of formatted text from the textual document, the depth-of-treatment value and the abstract associated with each piece of formatted text in the textual document.
    Type: Application
    Filed: December 29, 2011
    Publication date: July 5, 2012
    Inventors: Forrest Rhoads, Daniel Gannon, Paul Werner, Steve Hestness, Kimberly Anne Kothe, Jonathan James Medin, Nick Bieter
  • Publication number: 20120173512
    Abstract: An agent based system assists in preparing an individual for an upcoming meeting by helping him/her retrieve relevant information about the meeting from various sources based on preexisting information in the system. The system obtains input text in character form indicative of the target meeting from a calendar program that includes the time of the meeting. As the time of the meeting approaches, the calendar program is queried to obtain the text of the target event and that information us utilized as input to the agent system. Then, the agent system parses the input meeting text to extract its various components such as title, body, participants, location, time etc. The system also performs pattern matching to identify particular meeting fields in a meeting text.
    Type: Application
    Filed: December 23, 2011
    Publication date: July 5, 2012
    Inventors: Chad Burkey, Denise Ho
  • Publication number: 20120173513
    Abstract: The claimed subject matter provides a system and method for automatic allocation of tenants to database services. An exemplary method comprises determining a query plan based on a workload for each tenant. A distance metric is created based on the query plan for each tenant, and tenants are clustered based on the distance metric into a predetermined number of clusters which is equal to the predetermined number of databases.
    Type: Application
    Filed: December 31, 2010
    Publication date: July 5, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Sanjay Agrawal, Guozhang Wang
  • Publication number: 20120173516
    Abstract: A method, article of manufacture, and apparatus for processing information are disclosed. In some embodiments, this includes receiving a query plan, generating a work file based on the query plan, associating the query plan with a work file, storing the association, and storing the work file in a storage device after the query plan has executed. In some embodiments, a hash of the query plan may be generated.
    Type: Application
    Filed: December 31, 2010
    Publication date: July 5, 2012
    Applicant: EMC CORPORATION
    Inventors: Florian Michael Waas, Joy Jie Kent
  • Publication number: 20120166420
    Abstract: Systems and associated methods for providing scalable presence subscriptions in federated presence environments are described. Embodiments provide for intelligent addition of subscriptions to a presence system. Embodiments identify if a virtualized presentity (corresponding to a new query) can be composed from existing virtualized presentities, and if so, corresponding query processing cells (QPCs) (servicing existing queries) are reused to retrieve the presence information (partially or fully) for the new incoming query. Embodiments organize the existing QPCs into a hierarchy such that a QPC/virtual presentity at a higher layer fetches presence information of all or some presentities from QPCs/virtual presentities at lower layer(s) to service the new query.
    Type: Application
    Filed: December 22, 2010
    Publication date: June 28, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Arup Acharya, Nilanjan Banerjee, Dipanjan Chakraborty, Koustuv Dasgupta, Shachi Sharma, Xiping Wang
  • Publication number: 20120166423
    Abstract: Techniques for collecting statistics of column data or R-Tree indexes are provided. A distributed database system includes a plurality of processing nodes controlling portions of spatial data. The nodes are instructed to create minimum bounding rectangles (MBR's) for their spatial data or R-Trees. The individual MBR's are merged and reformatted into a grid of equally sized cells. Each processing node is provided a copy of the grid to update based on statistics of each processing node's spatial data for a target table. The updated grids are then merged into a single grid and used by an optimizer to evaluate queries before the queries are executed.
    Type: Application
    Filed: December 28, 2010
    Publication date: June 28, 2012
    Applicant: Teradata US, Inc.
    Inventor: Gregory Howard Milby
  • Publication number: 20120166421
    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: Application
    Filed: December 27, 2010
    Publication date: June 28, 2012
    Applicant: SOFTWARE AG
    Inventors: Michael CAMMERT, Christoph HEINZ, Jürgen KRÄMER, Tobias RIEMENSCHNEIDER
  • Publication number: 20120166419
    Abstract: A system, a program product and an associated method is provided for data processing management in a computing environment having at least a processor. The method comprises creating in the memory an invalidation index having a plurality of rows, each row further comprising a search key field, an ID list field for IDs of records associated with the database, and a count value field. Every time a new reference query is received the processor searches for a row in said invalidation index with an already created search key and then decreases count value of a counter when a match is found and when a match is not found creating a new search key and a new row in an associated invalidation index for said new key.
    Type: Application
    Filed: September 30, 2011
    Publication date: June 28, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Miki Enoki, Yohsuke Ozawa, Hiroshi Horii
  • Publication number: 20120166417
    Abstract: Described herein are technologies pertaining to migrating state information of operators in a first continuous query plan to a second continuous query plan in an asynchronous manner, such that the first continuous query plan need not cease executing during the migrating of the state information. State information pertaining to stateful operators, such as join operators, is migrated from the first continuous query plan to the second continuous query plan by way of a transformation plan. State matching is utilized to generate the transformation plan.
    Type: Application
    Filed: December 23, 2010
    Publication date: June 28, 2012
    Applicant: Microsoft Corporation
    Inventors: Badrish Chandramouli, Jonathan David Goldstein, Peter Alfred Zabback, David Eugene Maier, Di Wang
  • Publication number: 20120166422
    Abstract: Methods and apparatus, including computer program products, are provided for providing for processing calculation plans. In one aspect, there is provided a computer-implemented method. The method may include generating a calculation plan including a plurality of nodes; determining whether at least one of the nodes includes a function node; and compiling the function node into executable code to enable execution of the plurality of nodes including the function node at the database. Related apparatus, systems, methods, and articles are also described.
    Type: Application
    Filed: December 27, 2010
    Publication date: June 28, 2012
    Inventors: Arne Harren, Tobias Elfner, Gerd Forstmann, Maciej Kabala, Carsten Binnig, Stefan Kain, Franz Faerber, Till Westmann
  • Publication number: 20120166418
    Abstract: A method for optimizing data types includes the step of generating a data structure providing access to at least one data element, the data structure associated with a first representation of the at least one data element. A user is provided with a plurality of data types for accessing the at least one data element. A request for access to the at least one data element is received, the request including at least one of the plurality of data types. The request is responded to with a second representation of the at least one data element, the second representation generated responsive to the at least one of the plurality of data types.
    Type: Application
    Filed: March 1, 2012
    Publication date: June 28, 2012
    Inventors: Michael David MCCOOL, Stefanus Jakobus Du Toit
  • Publication number: 20120158697
    Abstract: Embodiments of the present invention address deficiencies of the art in respect to subscribing and updating nodes within XML documents and provide a novel and non-obvious method, system and computer program product for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs). In one embodiment of the invention, a method for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs) that includes receiving a XPATH expression for a node in an XML document, retrieving the node identified by the XPATH expression, determining if a template exists for the identified node, where the template resides in a database of a document management system, comparing the template expression to the XPATH expression and determining if the expressions match.
    Type: Application
    Filed: February 28, 2012
    Publication date: June 21, 2012
    Applicant: International Business Machines Corporation
    Inventors: Valerie M. BENNETT, Benson K. CHEN, Stephen M. HINTON, Douglas S. WILLIAMS
  • Publication number: 20120158317
    Abstract: A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner.
    Type: Application
    Filed: February 28, 2012
    Publication date: June 21, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Peicheng Du, Frank Suits
  • Publication number: 20120158695
    Abstract: MESA utilizes novel tools and strategies to more efficiently search and retrieve records from an electronic database. An Integrated System Optimizer (ISO) programmable computer system is electronically linked to related database platform systems to dynamically monitor, supervise, control, track and communicate the status of each database query. ISO analyzes IVR speaker dependent and speaker independent confidence levels; determines number of records in initial, subsequent and final subsets of records formed by AlphaOmega combinations and subsets formed by statistical, subjective and objective virtual search parameters; selects optimum search algorithms or search sequence for each query; determines the frequency of occurrence for AlphaOmega combinations; transmits optimum search activity for each query to database subsystems including Intelligent Queries to disambiguate similar records.
    Type: Application
    Filed: January 18, 2012
    Publication date: June 21, 2012
    Applicant: Mr. Scott P. Stuart
    Inventors: Robert O. Stuart, Scott P. Stuart
  • Publication number: 20120150842
    Abstract: Systems and methods are described herein that can implemented by a middle tier of a multi-tier data retrieval system to select data operation(s) that correspond to a query. The query may be received from a front tier. The selection is performed by comparing the query to a query template associated with each data operation. The query template for each data operation includes an algebraic description of queries that each respective data operation can satisfy. The selected data operation(s) are then executed against a data service to obtain data, which is then provided to the front tier. In some embodiments, an execution plan may be created by the middle tier for satisfying the query. The execution plan can include the selected data operation(s) and post-processing step(s). The post-processing step(s) can be applied to the obtained data to satisfy the query. The post-processed data is then provided to the front tier.
    Type: Application
    Filed: December 10, 2010
    Publication date: June 14, 2012
    Applicant: MICROSOFT CORPORATION
    Inventor: Marcelo L. Ruiz
  • Patent number: 8200689
    Abstract: A base/inversion component extractor calculates an occupancy rate of each component of a vector of user preference information obtained from information stored on a user preference database, and extracts a base component from the user preference information in accordance with the calculated occupancy rate of the base component. The base/inversion component extractor extracts a similar base component from item preference information obtained from information stored on an item metadatabase. A recommendation engine calculates a similarity between a base vector of the user preference information and a base vector of the item preference information, and identifies, as candidate items, items of the predetermined number in the order of from high to low similarity. The recommendation engine further calculates a similarity between an inversion vector of the user preference information and an inversion vector of the item preference information, and identifies an item candidate having a low similarity.
    Type: Grant
    Filed: September 4, 2009
    Date of Patent: June 12, 2012
    Assignee: Sony Corporation
    Inventors: Naoki Kamimaeda, Hiroyuki Masuda
  • Publication number: 20120143846
    Abstract: Disclosed are an apparatus, method, and program product which each provide an enhanced database engine. Access to precise values is provided while permitting unfettered access to those who are not interested in precise values. This is accomplished via an enhanced database index and indexing method. The entries of the database index are normalized to exclude precision. Individuals interested in precision can then specify precision as part of their query through use of a PRECISE keyword. Results are then filtered to account for the specified precision.
    Type: Application
    Filed: February 14, 2012
    Publication date: June 7, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gary Ross Ricard, William Jon Schmidt
  • Publication number: 20120136850
    Abstract: Techniques for managing query execution based on memory usage using memory compression. Embodiments may receive a query from a requesting entity and estimate an amount of memory required to execute the query. Upon determining that executing the query would consume an impermissible amount of memory, embodiments may optimize the query by adjusting an amount of memory compression used in executing the query. The optimized query may then be executed to produce a set of query results, which may then be returned to the requesting entity.
    Type: Application
    Filed: November 30, 2010
    Publication date: May 31, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Eric L. Barsness, Paul S. Nelsestuen, John M. Santosuosso
  • Publication number: 20120130988
    Abstract: Systems, methods and articles of manufacture for determining at least one algorithm from a pool of algorithms to optimize a query. An embodiment includes building optimization blocks for the subplan, determining the complexity of the subplan based on the optimization blocks and selecting an algorithm from a pool of search space generation algorithms based on complexity of the subplan and characteristics of the selected algorithm, and optimizing the subplan with the selected algorithm.
    Type: Application
    Filed: November 22, 2010
    Publication date: May 24, 2012
    Applicant: iAnywhere Solutions, Inc.
    Inventors: Anisoara NICA, Ian Lorne Charlesworth
  • Publication number: 20120130948
    Abstract: An item data management server having the capability to create a physical item data record for a physical item in the control of a user based upon a data object of an accessible collection. The item data management server presents a clone command query to the user terminal, and receives, in response, a clone command query response that corresponds to and identifies a data object having a plurality of attributes. The item data management server generates a cloned physical item data record based upon the data object. The cloned physical item data record includes at least a portion of the plurality of attributes of the data object, and a second plurality of attributes associated with the user. The item data management server generates a web page including the cloned physical item data record, and presents the web page to the user terminal.
    Type: Application
    Filed: December 14, 2006
    Publication date: May 24, 2012
    Applicant: ITAGGIT, INC.
    Inventors: DAVID ALTOUNIAN, CHARLES ZELLER, SARA FOX
  • Publication number: 20120130983
    Abstract: A string matching system is described herein that provides for very fast and efficient pattern matching against large sets of certain types of pattern strings. If a set of pattern strings is comprised of strings that can be logically divided into segments, these pattern strings can be stored efficiently in a tree-like data structure, segment by segment, storing pattern-match syntax segments separately from literal string segments. After segmentation, individual match candidate strings are compared, segment by segment, against elements in the tree. The system uses a data structure that is conceptually a combination of a tree and a hash table. Using a hash table to implement the branching elements at each level in the tree contributes to quick matching speed at each level. By consistently separating strings into segments, the system can also share storage locations for like elements in the data structure.
    Type: Application
    Filed: November 24, 2010
    Publication date: May 24, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Matthew V. Ryan, Andrew Hodgkinson, Russell Young
  • Publication number: 20120130985
    Abstract: Technologies are generally described for a peer to peer search routing algorithm and system. In one example, a node in a peer to peer network includes a processor. In some examples, the processor may be configured to receive information regarding a topology of the peer to peer network and generate a first search routing algorithm for the peer to peer network based on the topology. In some examples, the processor may be configured to generate a second search routing algorithm for the peer to peer network based on a search characteristic and the topology. In some examples, the second search routing algorithm is distinct from the first search routing algorithm. In some examples, the processor may be configured to receive a request to search the peer to peer network. In some examples, the processor may be configured to search the peer to peer network using the second search routing algorithm.
    Type: Application
    Filed: August 25, 2010
    Publication date: May 24, 2012
    Applicant: NORTHEASTERN UNIVERSITY TECHNOLOGY TRANSFER CENTER
    Inventor: Zhenhua Tan
  • Publication number: 20120130986
    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 query data collector to access a query repository table to determine if a first query plan for a first configuration executed on a relational database has a lowest resource cost of execution between the first query plan and a second query plan for a second configuration. The query repository table can include a plurality of query records with annotated query plans, each annotated query plan comprising text sufficient to generate a query plan of a certain form.
    Type: Application
    Filed: November 19, 2010
    Publication date: May 24, 2012
    Inventors: Taoufik B. Abdellatif, Suresh Subbiah, Awny K. Al-Omari, Hansjorg Zeller
  • Publication number: 20120130847
    Abstract: A method of searching an electronic commerce website includes searching a plurality of user profiles based upon a user-supplied search query for an item, establishing an interactive online session between the user and the at least one search facilitator, and providing for the at least one search facilitator to present one or more suggested item listings to a user through the electronic commerce website. The searching identifies at least one search facilitator profile among the plurality of user profiles. The search facilitator profile represents a search facilitator who can assist the user in locating the item within the electronic commerce website.
    Type: Application
    Filed: November 22, 2010
    Publication date: May 24, 2012
    Applicant: Etsy, Inc.
    Inventor: Robert Kalin
  • Publication number: 20120130982
    Abstract: Embodiments of the present invention relate to a method, computer program product and system for optimizing database transactions configured for receiving a query. The query specifies a set of predicates supplied to the query and a minimal number of predicates to be satisfied for the query to be true. An operation using the query is performed on a repository that is stored in a computer readable storage medium. A set of results satisfying the minimal number of predicated is rendered.
    Type: Application
    Filed: November 19, 2010
    Publication date: May 24, 2012
    Applicant: International Business Machines Corporation
    Inventors: Vaibhav Murlidhar Kulkarni, Sweta Singh
  • Publication number: 20120130989
    Abstract: In accordance with aspects of the present invention, provided are systems and computer program products for incrementally estimating the cardinality of a derived relation including statistically correlated partially applicable predicates for a range-partitioned table. During the generation of a QEP a cardinality estimate is calculated in which one or more partially applicable predicates is correlated to another partially applicable predicate and/or to one or more fully applicable predicates. The cardinality includes a number of rows expected to be returned by the QEP and is computed in an incremental fashion for each operator of the QEP.
    Type: Application
    Filed: January 30, 2012
    Publication date: May 24, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Vincent Corvinelli, John Frederick Hornibrook, Bingjie Miao
  • Publication number: 20120130987
    Abstract: A method for dynamically aggregating data is provided. A server device receives a subscriber request for a report based on a subset of metadata contained in a data dimensions catalog. The server device analyzes data aggregation requirements from a plurality of data sources for the report based on the subset of metadata defined in the subscriber request. The server device generates a data access plan for movement of data from the plurality of data sources based on the data aggregation requirements for the report. Then, the server device executes the data access plan to fetch the data from the plurality of data sources based on the data aggregation requirements for the report. A computer system and computer program product for dynamically aggregating data are also provided.
    Type: Application
    Filed: November 19, 2010
    Publication date: May 24, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Abhijit Bose, Mithkal M. Smadi, Jimeng Sun, Chandra Kumar Velpuri
  • Publication number: 20120123984
    Abstract: Embodiments of the invention provide for automatically selecting optimal fetch settings for business processes as a function of database query load and relational context by determining whether data loaded for data retrieval points is dependent upon a query result from another query process and automatically selecting an eager fetch setting if dependent upon a query result from another query process, or a lazy fetch setting if not. Usage of the data retrieval points is monitored with respect to defined units of work to define retrieval patterns and automatically update the fetch settings, including by revising selected eager fetch settings to lazy fetch settings if a datasize of a defined retrieval pattern is larger than a permissible memory resource threshold.
    Type: Application
    Filed: November 16, 2010
    Publication date: May 17, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Abhinay R. Nagpal, Sri Ramanathan, Sandeep Ramesh, Gandhi Sivakumar, Matthew B. Trevathan
  • Publication number: 20120124029
    Abstract: A System, method and application for creating comprehensive multiple mixed media knowledge storage and management, discovery and retrieval utilizing novel indexing and querying applied to content from multiple media formats from disparate sources is disclosed. Depending on the media format the system breaks down the source information in any media into constituent units (“tokens”) using a reference corpus of labeled tokens (“training set”). The details of tokens are stored in an inverted index with available reference data such as location in the file, time, source file and additional information related to the token such as quantitative similarity to the best-match token(s) in the training set etc. During retrieval, a query comprising of single element in any media; a multimedia element or a combination of such elements including a sequence of such elements in a time line is similarly broken down into constituent units to generate a novel query structure.
    Type: Application
    Filed: August 2, 2011
    Publication date: May 17, 2012
    Inventor: Shashi Kant
  • Publication number: 20120117056
    Abstract: There is provided a computer-executable method of executing an outer join on a parallel database management system. An exemplary method comprises receiving an outer skewed values list (SVL). The outer SVL may comprise values that are indicated to be skewed. The exemplary method further comprises receiving an inner SVL. The inner SVL may comprise values that are indicated to be skewed. Additionally, the exemplary method comprises partitioning the outer table and the inner table across a plurality of join instances, based on the outer SVL and the inner SVL. A missing skew value is identified. The missing skewed value may be a value of the inner SVL that is not found in the inner table. The outer join is performed using the plurality of join instances, based on the missing skewed value.
    Type: Application
    Filed: March 30, 2010
    Publication date: May 10, 2012
    Inventors: Awny K. Al-Omari, QiFan Chen
  • Publication number: 20120117055
    Abstract: A method for creating a joined data set from a join input data set is disclosed. The method starts by categorizing the join input data set into a high-skew data set and a low-skew data set. The low-skew data set is distributed to the plurality of CPUs using a first distribution method. The high-skew data set is distributed to the plurality of CPUs using a second distribution method. The plurality of CPUs process the high-skew data set and the low-skew data set to create the joined data set.
    Type: Application
    Filed: January 23, 2012
    Publication date: May 10, 2012
    Inventors: Awny K. Al-Omari, QiFan Chen, Gregory S. Battas, Kashif A. Siddiqui, Michael J. Hanlon
  • Patent number: 8176052
    Abstract: Hyperspace index data structure. A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes binary bits or groups of small parameter pattern keyed records. Each binary bit or parameter pattern keyed record corresponds to an identifier corresponding to a parameter pattern. If the bit or record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first data field. Each of the additional fields includes identifiers for a subset of information in the first field.
    Type: Grant
    Filed: March 2, 2007
    Date of Patent: May 8, 2012
    Assignee: Perfect Search Corporation
    Inventors: Dillion Inouye, Jeanne Inouye, legal representative, Ronald P. Millett, John C. Higgins
  • Publication number: 20120109994
    Abstract: A data-retrieval method for use on a portable electronic device. The method comprises receiving a query string at a user interface of the device and displaying one or more index strings on the user interface such that the relative prominence of each index string displayed increases with increasing resemblance of that index string to the query string. The method further comprises displaying an index string with greater prominence when a fixed-length substring of the query string occurs anywhere in the index string, regardless of position. In this manner, the relevance of prominently displayed index strings increases as more characters are appended to the query string, even if the query string contains errors.
    Type: Application
    Filed: October 28, 2010
    Publication date: May 3, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Yun-Cheng Ju, Frank Liu, Yen-Tsang Lee, Jason Farmer, Ted E. Dinklocker
  • Publication number: 20120109935
    Abstract: Access to data is facilitated by mapping between an object model and a key-value data model that supports a notion of worlds. The object model can be expressed in a programming language that supports language-integrated queries. One or more query operators comprising a language-integrated query can be specified and executed with respect to a key-value world.
    Type: Application
    Filed: November 2, 2010
    Publication date: May 3, 2012
    Applicant: MICROSOFT CORPORATION
    Inventor: Henricus Johannes Maria Meijer
  • Publication number: 20120109936
    Abstract: A data layout recommendation system for heterogeneous storages is disclosed. The system has an SSD-aware Time-based query optimizer from the database optimizer. The query optimizer can detect the interaction between the query plans and underlying data layout and dynamically update the cheapest query plan and response time of a query based on the changing data layout. The system also includes a module utilizing the query estimates from the backend to find a cost-effective data layout as well as the capacity and SLAs constrains are guaranteed.
    Type: Application
    Filed: October 1, 2011
    Publication date: May 3, 2012
    Applicant: NEC LABORATORIES AMERICA, INC.
    Inventors: Ning Zhang, Junichi Tatemura, Vahit Hakan Hacigumus
  • Publication number: 20120109934
    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: October 28, 2010
    Publication date: May 3, 2012
    Applicant: SAP AG
    Inventors: Christoph Weyerhaeuser, Daniel Baeumges, Tobias Mindnich, Thomas Legler
  • Publication number: 20120101993
    Abstract: A database system of a mobile device that includes an on-device database service is provided. The on-device database service accepts a connection request from an application, and receives a database command from the application. The on-device database service translates the database command into a structured query language command, and transmits the structured query language command to an embedded database. After a database operation is performed by the embedded database, the on-device database service receives a result of the structured query language command that is transmitted from the embedded database, and the on-device database service transmits the result to the application.
    Type: Application
    Filed: October 21, 2010
    Publication date: April 26, 2012
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventor: Hinkmond Wong
  • Publication number: 20120095988
    Abstract: A method and apparatus for preserving optimization hints in a transformed query is provided. In one embodiment, the methodology is implemented by query optimization logic. Upon receiving a first query to access values in a column of a table protected by an access control policy, the query optimization logic creates a second query that is equivalent to the first query as subject to the access control policy. Furthermore, the second query contains a new predicate that conjunctively joins a clone of a first expression in a predicate of the first query with a second expression that is derived, based on the access control policy, from the first expression. In one embodiment, the query optimization logic submits the second query for execution.
    Type: Application
    Filed: October 20, 2011
    Publication date: April 19, 2012
    Inventor: Chon Hei Lei
  • Publication number: 20120095990
    Abstract: A method and system for approximate string matching are provided for generating approximate matches whilst supporting compounding and correction rules. The method for approximate string matching of an input pattern to a trie data structure, includes traversing a trie data structure to find approximate partial and full character string matches of the input pattern. Traversing a node of the trie data structure to process a character of the string applies any applicable correction rules to the character, wherein each correction rule has an associated cost, adjusted after each character processed. The method includes accumulating costs as a string of characters is gathered, and restricting the traverse through the trie data structure according to the accumulated cost of a gathered string and potential costs of applicable correction rules.
    Type: Application
    Filed: December 22, 2011
    Publication date: April 19, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Branimir Z. Lambov
  • Publication number: 20120095987
    Abstract: In accordance with certain embodiments, a query from a client may be received at a server, and a default query range may be applied to the query. The query may be executed in a first execution using an index comprising a category of information stored in the database and subject to the default query range. If the number of query results from the first execution is outside a predetermined range, then the query range may be adjusted to obtain a number of query results closer to or within the predetermined range. Additionally, the query may be executed in a second execution using the index comprising the category of information stored in the database and subject to the adjusted query range. Thereafter, the query results obtained from the second execution of the query may be sent to the client.
    Type: Application
    Filed: October 12, 2011
    Publication date: April 19, 2012
    Inventor: Tao-Jung Cheng
  • Publication number: 20120095986
    Abstract: A method of optimizing runtime spatiotemporal events processing is provided.
    Type: Application
    Filed: October 19, 2010
    Publication date: April 19, 2012
    Inventors: Opher Etzion, Nir Zolotorevsky