Query Optimization (epo) Patents (Class 707/E17.017)
-
Publication number: 20120130985Abstract: 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: ApplicationFiled: August 25, 2010Publication date: May 24, 2012Applicant: NORTHEASTERN UNIVERSITY TECHNOLOGY TRANSFER CENTERInventor: Zhenhua Tan
-
Publication number: 20120130987Abstract: 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: ApplicationFiled: November 19, 2010Publication date: May 24, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Abhijit Bose, Mithkal M. Smadi, Jimeng Sun, Chandra Kumar Velpuri
-
Publication number: 20120130983Abstract: 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: ApplicationFiled: November 24, 2010Publication date: May 24, 2012Applicant: MICROSOFT CORPORATIONInventors: Matthew V. Ryan, Andrew Hodgkinson, Russell Young
-
Publication number: 20120130982Abstract: 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: ApplicationFiled: November 19, 2010Publication date: May 24, 2012Applicant: International Business Machines CorporationInventors: Vaibhav Murlidhar Kulkarni, Sweta Singh
-
Publication number: 20120130989Abstract: 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: ApplicationFiled: January 30, 2012Publication date: May 24, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Vincent Corvinelli, John Frederick Hornibrook, Bingjie Miao
-
Publication number: 20120130986Abstract: 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: ApplicationFiled: November 19, 2010Publication date: May 24, 2012Inventors: Taoufik B. Abdellatif, Suresh Subbiah, Awny K. Al-Omari, Hansjorg Zeller
-
Publication number: 20120130948Abstract: 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: ApplicationFiled: December 14, 2006Publication date: May 24, 2012Applicant: ITAGGIT, INC.Inventors: DAVID ALTOUNIAN, CHARLES ZELLER, SARA FOX
-
Publication number: 20120130847Abstract: 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: ApplicationFiled: November 22, 2010Publication date: May 24, 2012Applicant: Etsy, Inc.Inventor: Robert Kalin
-
Publication number: 20120124029Abstract: 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: ApplicationFiled: August 2, 2011Publication date: May 17, 2012Inventor: Shashi Kant
-
Publication number: 20120123984Abstract: 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: ApplicationFiled: November 16, 2010Publication date: May 17, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Abhinay R. Nagpal, Sri Ramanathan, Sandeep Ramesh, Gandhi Sivakumar, Matthew B. Trevathan
-
Publication number: 20120117055Abstract: 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: ApplicationFiled: January 23, 2012Publication date: May 10, 2012Inventors: Awny K. Al-Omari, QiFan Chen, Gregory S. Battas, Kashif A. Siddiqui, Michael J. Hanlon
-
Publication number: 20120117056Abstract: 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: ApplicationFiled: March 30, 2010Publication date: May 10, 2012Inventors: Awny K. Al-Omari, QiFan Chen
-
Patent number: 8176052Abstract: 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: GrantFiled: March 2, 2007Date of Patent: May 8, 2012Assignee: Perfect Search CorporationInventors: Dillion Inouye, Jeanne Inouye, legal representative, Ronald P. Millett, John C. Higgins
-
Publication number: 20120109994Abstract: 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: ApplicationFiled: October 28, 2010Publication date: May 3, 2012Applicant: MICROSOFT CORPORATIONInventors: Yun-Cheng Ju, Frank Liu, Yen-Tsang Lee, Jason Farmer, Ted E. Dinklocker
-
Publication number: 20120109934Abstract: 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: ApplicationFiled: October 28, 2010Publication date: May 3, 2012Applicant: SAP AGInventors: Christoph Weyerhaeuser, Daniel Baeumges, Tobias Mindnich, Thomas Legler
-
Publication number: 20120109935Abstract: 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: ApplicationFiled: November 2, 2010Publication date: May 3, 2012Applicant: MICROSOFT CORPORATIONInventor: Henricus Johannes Maria Meijer
-
Publication number: 20120109936Abstract: 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: ApplicationFiled: October 1, 2011Publication date: May 3, 2012Applicant: NEC LABORATORIES AMERICA, INC.Inventors: Ning Zhang, Junichi Tatemura, Vahit Hakan Hacigumus
-
Publication number: 20120101993Abstract: 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: ApplicationFiled: October 21, 2010Publication date: April 26, 2012Applicant: ORACLE INTERNATIONAL CORPORATIONInventor: Hinkmond Wong
-
Publication number: 20120095990Abstract: 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: ApplicationFiled: December 22, 2011Publication date: April 19, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Branimir Z. Lambov
-
Publication number: 20120095988Abstract: 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: ApplicationFiled: October 20, 2011Publication date: April 19, 2012Inventor: Chon Hei Lei
-
Publication number: 20120095986Abstract: A method of optimizing runtime spatiotemporal events processing is provided.Type: ApplicationFiled: October 19, 2010Publication date: April 19, 2012Inventors: Opher Etzion, Nir Zolotorevsky
-
Publication number: 20120095987Abstract: 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: ApplicationFiled: October 12, 2011Publication date: April 19, 2012Inventor: Tao-Jung Cheng
-
Publication number: 20120089596Abstract: A method of optimizing a query is provided herein. The method includes determining a cost estimate for a query. The method further includes determining a budget for optimizing the query based on the cost estimate. Additionally, the method includes determining a complexity of the query based on the budget. The method also includes determining a strategy based on the complexity. The strategy specifies a limit to a search space enumerated during optimization of the query. Further, the method includes optimizing the query based on the strategy.Type: ApplicationFiled: October 11, 2010Publication date: April 12, 2012Inventors: Kashif A. Siddiqui, Awny K. Al-Omari
-
Publication number: 20120089595Abstract: A procedural pattern in a received query execution plan can be matched to a stored pattern for which an equivalent declarative operator has been pre-defined. The query execution plan can describe a query for accessing data. A hybrid execution plan can be generated by replacing the procedural pattern with the equivalent declarative operator. A hybrid execution plan processing cost can be assigned to execution of the hybrid execution plan and a query execution plan processing cost can be assigned to execution of the query execution plan. The assigning can include evaluating a cost model for the hybrid execution plan and the query execution plan. The query can be executed using the hybrid execution plan if the hybrid execution plan processing cost is less than the query execution plan processing cost or the query execution plan if the hybrid execution plan processing cost is greater than the query execution plan processing cost. Related systems, methods, and articles of manufacture are disclosed.Type: ApplicationFiled: December 17, 2010Publication date: April 12, 2012Inventor: Bernhard Jaecksch
-
Publication number: 20120084278Abstract: A plurality of queries of an in-memory column-oriented database are obtained. Each of the queries has at least one column predicate. For each of the queries, it is determined which of a plurality of columns in the in-memory column-oriented database need to be scanned. The plurality of queries are grouped into a plurality of scan groups, based at least in part on the determining step. The column predicates are evaluated for those of the queries in a given one of the scan groups in accordance with a scheduling scheme. The grouping step and the scheduling scheme take into account real time scan information.Type: ApplicationFiled: September 30, 2010Publication date: April 5, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Hubertus Franke, Hong Min
-
Publication number: 20120078878Abstract: Query operators such as those that perform grouping functionality can be implemented to execute lazily rather than eagerly. For instance, one or more groups can be created and/or populated lazily with one or more elements from a source sequence in response to a request for a group or element of a group. Furthermore, lazy execution can be optimized as a function of context surrounding a query, among other things.Type: ApplicationFiled: September 28, 2010Publication date: March 29, 2012Applicant: MICROSOFT CORPORATIONInventors: Bart De Smet, Henricus Johannes Maria Meijer, Jeffrey Van Gogh, John Wesley Dyer
-
Publication number: 20120078936Abstract: Methods and computer-storage media having computer-executable instructions embodied thereon that facilitate refining query results using visual cues are provided. Query results are determined in response to an indication of a user query. One or more groups of query results are generated from the query results based on categories of query results that share similar features. Visual cues are associated with each of the query result groups. Visual cues, in association with query result groups, are presented to a user. Query results associated with a selected visual cue may be presented to a user. A refined user query may be generated based on a selected visual cue.Type: ApplicationFiled: September 24, 2010Publication date: March 29, 2012Applicant: MICROSOFT CORPORATIONInventors: YU-TING KUO, YI LI, FANG WEN, QIFA KE, JIAN SUN
-
Publication number: 20120078880Abstract: Systems, methods and articles of manufacture for accelerating database queries containing bitmap-based conditions are described herein. An embodiment includes determining a bitmap, where the bitmap represents a set of rows that have satisfied one or more conjunctive conditions which preceded a conjunct that is a disjunction in a query expression and restricting evaluation of a disjunct within the disjunction to the set of rows represented by the bitmap. Another embodiment includes determining a satisfaction bitmap, where the bitmap represents the result of one or more preceding disjuncts in a disjunction within a query expression and restricting scope of evaluation of a disjunct to a set of rows that are not within the determined satisfaction bitmap. In this way, embodiments of the present invention enable the acceleration of queries containing disjunctions of conditions on a database table, as well as reduce the temporary resources consumed for such queries.Type: ApplicationFiled: September 28, 2010Publication date: March 29, 2012Applicant: Sybase, Inc.Inventors: Steven A. KIRK, David E. Walrath
-
Publication number: 20120072411Abstract: A query over one or more push-based data sources is transformed into a data representation of the query. The data representation can subsequently be analyzed, optimized, and remoted, among other things. For example, the data representation can be utilized to generate code for an out-of-process execution engine. Additionally, the data representation can be employed with respect to conversions to and from various types and representations of data.Type: ApplicationFiled: September 16, 2010Publication date: March 22, 2012Applicant: MICROSOFT CORPORATIONInventors: Bart De Smet, Henricus Johannes Maria Meijer
-
Publication number: 20120072413Abstract: A method and device may accept a first database query plan including a plurality of rows and a second database query plan including a plurality of rows, compare each row in the first database query plan with a corresponding row in the second database query plan, and based on each comparison, calculate a difference between the compared rows. Each difference may be recorded in an output file.Type: ApplicationFiled: September 22, 2010Publication date: March 22, 2012Inventors: Maria G. CASTELLANOS, Perla Ruiz
-
Publication number: 20120072414Abstract: Querying data stores in a federation of data stores. A first search filter is accessed. The first search filter is constructed with one or more nested logical AND, OR, or NOT operands. The first search filter is normalized to a normalized search filter that is logically equivalent to the first search filter. The normalized search filter includes 3 or 4 levels. All first level operands are logically ORed. All second level operands are logically ANDed. All third level operands are at least one of parameters or logical NOTs. Any fourth level operands are parameters. The normalized search filter is used to search a plurality of data stores in a federation of data stores for information by searching different data stores for at least two or more of the top level operands.Type: ApplicationFiled: September 16, 2010Publication date: March 22, 2012Applicant: Microsoft CorporationInventor: Xin He
-
Publication number: 20120072412Abstract: In an embodiment an execution plan for a query is created. A wakeup threshold is set proportional to an amount of time taken by the creation of the execution plan. In various embodiments, the wakeup threshold is increased by a percentage equal to one minus a percentage of free resources at a computer system, is increased inversely proportional to an amount of execution time of a previous execution of the execution plan, or is decreased proportional to a number of times the execution plan was executed. A portion of the execution plan is executed to produce a portion of rows in a result set until the wakeup threshold expires. After the wakeup threshold expires, changes to the execution plan are evaluated.Type: ApplicationFiled: September 20, 2010Publication date: March 22, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert J. Bestgen, Robert V. Downer, Brian R. Muras
-
Patent number: 8140517Abstract: A method, apparatus, and program product is provided to, in response to receiving a first database query for which usage of shared weight indices is prohibited, determine whether a shared weight index associated with a column of a database table referenced by the first database query can be utilized as a non-shared weight index to optimize the database query. The method, apparatus, and program product determine whether the column includes at least one changed weight value and determines whether the database query references at least one changed weight value in the column. The shared weight index is utilized to optimize the first database query in response to determining that the shared weight index can be utilized as a non-shared weight index to optimize the first database query.Type: GrantFiled: April 6, 2009Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Paul R. Day, Randy L. Egan, Roger A. Mittelstadt, Dale M. Stahl
-
Publication number: 20120066204Abstract: Distributed and local processes analyze usage data and transform it into objects including timestamps and dimensions. Objects include a position vector to represent dimension analysis and additional attributes associated with measurements of different types. The objects are stored in a multidimensional database indexed on the vector and timestamp attributes.Type: ApplicationFiled: September 14, 2010Publication date: March 15, 2012Applicant: Microsoft CorporationInventors: Christopher Ball, Chinna Polinati, Chenlei Guo, Praviit Tiwana
-
Publication number: 20120059817Abstract: A computer-implemented method, apparatus and article of manufacture for optimizing execution of database queries in a computer system. In one embodiment, the steps and functions include: generating first and second query execution plans for first and second requests, wherein the first and second query execution plans are each comprised of one or more steps that scan a specified table in a database stored on the computer system in order to retrieve data from the table; and executing the first and second query execution plans, wherein intelligent query dispatching is performed on the steps of the first and second query execution plans to ensure that the steps share the data retrieved from the table and cached in memory.Type: ApplicationFiled: September 7, 2010Publication date: March 8, 2012Applicant: TERADATA US, INC.Inventors: Louis M. Burger, Thomas P. Julien, Douglas P. Brown
-
Publication number: 20120054175Abstract: 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: ApplicationFiled: August 30, 2010Publication date: March 1, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Eric L. Barsness, John M. Santosuosso
-
Publication number: 20120054172Abstract: A method of transmitting a query in a wireless network includes receiving a plurality of queries from a plurality of user equipments, aggregating the plurality of queries at a node of the network, the network including at least one of an access point of the network and an intermediate node of the network, and transmitting the aggregated plurality of queries to a query server.Type: ApplicationFiled: August 31, 2010Publication date: March 1, 2012Applicant: International Business Machines CorporationInventors: Dakshi Agrawal, Murtaza Zafer
-
Publication number: 20120054173Abstract: A method of transforming relational queries of a database into on a data processing system includes receiving a series of relational queries, transforming first parts of the queries into a continuous query embodied as a streaming application, sending parameters in second parts of the queries in the series to the streaming application as a data stream, and executing the continuous query based on the received data stream to generate query results for the series of relational queries. Each query in the series includes a first part and a second part. The first parts are a pattern common to all the queries in the series and the second parts each have one or more parameters that are not common to all of the queries in the series.Type: ApplicationFiled: August 25, 2010Publication date: March 1, 2012Applicant: International Business Machines CorporationInventors: Henrique Andrade, Bugra Gedik, Martin J. Hirzel, Robert Soule, Hua Yong Wang, Kun-Lung Wu, Qiong Zou
-
Publication number: 20120047158Abstract: An improved method, system, and computer program product is disclosed that provides a hybrid approach to optimization which allows different subsets of data accessed by a query to be optimized with different access paths and execution approaches. Transformations may be performed to re-write the query, which restructures the query in a way that facilitates the hybrid optimization process. Multiple transformations may be interleaved to produce an efficient re-written query.Type: ApplicationFiled: August 20, 2010Publication date: February 23, 2012Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Allison LEE, Mohamed ZAIT, Yali ZHU
-
Publication number: 20120047117Abstract: Methods and systems for using algorithms in relational database management systems (RDBMSs) for incremental maintenance of materialized views with outerjoins are disclosed. The algorithms achieve the following goals with respect to a class of materialized outerjoin views and the performance of update operations: relax the requirement for the existence of the primary key attributes in a select list of the view to only some of the relations (i.e., the relations referenced as a preserved side in an outerjoin); relax null-intolerant property requirements for some predicates used in the view definition (i.e., predicates referencing relations which can be null-supplied by more than one outerjoin); and implement maintenance of outerjoin views by using one update statement (e.g., MERGE, UPDATE, INSERT, or DELETE) per view for each relation referenced in the view. The algorithms allow design and implementation of the incremental maintenance of materialized views with outerjoins to be integrated into an RDBMS.Type: ApplicationFiled: December 20, 2010Publication date: February 23, 2012Applicant: iAnywhere Solutions, Inc.Inventor: Anisoara NICA
-
Publication number: 20120047124Abstract: A method of processing a query is provided. The method includes performing on a processor: receiving a database query that includes a plurality of predicates that associate a subject with an object, where one or more of the predicates is a variable predicate; generating at least one new query by selectively replacing the at least one variable predicate in the database query with a non-variable predicate; and performing the at least one new database query on a database to obtain a query result.Type: ApplicationFiled: August 17, 2010Publication date: February 23, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Songyun Duan, Anastasios Kementsietsidis, Wangchao Le, Min Wang
-
Publication number: 20120047126Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system.Type: ApplicationFiled: June 29, 2011Publication date: February 23, 2012Applicant: TERADATA US, INC.Inventors: Jeremy L. Branscome, Michael Paul Corwin, Joseph Irawan Chamdani, Rajasekhar Cherabuddi
-
Publication number: 20120047125Abstract: In an embodiment, a FIRSTIO execution plan is selected that has a lowest estimated execution time for finding a number of records that satisfy the query and are simultaneously viewable. An ALLIO execution plan is selected that has a lowest estimated execution time for finding all records that satisfy the query. The FIRSTIO execution plan is executed for a first time period to create a FIRSTIO result set. The ALLIO execution plan is executed for a second time period to create an ALLIO result set. The FIRSTIO result set is displayed if the FIRSTIO result set comprises more records than the ALLIO result set. The ALLIO result set is displayed if the ALLIO result set comprises more records than the FIRSTIO result set. In an embodiment, the first and second time periods expire in response to the expiration of a maximum time specified by the query.Type: ApplicationFiled: August 17, 2010Publication date: February 23, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Paul R. Day, Randy L. Egan, Roger A. Mittelstadt, Brian R. Muras
-
Publication number: 20120041942Abstract: A method, a service optimization system, and a set of instructions are disclosed. A user interface 150 may receive a data request 230 from a user 210. A service plan generation module 410 may generate in real time a preliminary data response plan 300 based upon the data request 230. A service optimization module 412 may create in real time an optimized data response plan 350 by reorganizing the preliminary data response plan 300 into a new order of execution to optimize a response time for the data response 414.Type: ApplicationFiled: August 10, 2010Publication date: February 16, 2012Applicant: LOCKHEED MARTIN CORPORATIONInventor: Robert D. RIEPSHOFF
-
Publication number: 20120041960Abstract: Methods of providing a document relevance score to a document on a network are disclosed. Computer readable medium having stored thereon computer-executable instructions for performing a method of providing a document relevance score to a document on a network are also disclosed. Further, computing systems containing at least one application module, wherein the at least one application module comprises application code for performing methods of providing a document relevance score to a document on a network are disclosed.Type: ApplicationFiled: January 26, 2009Publication date: February 16, 2012Inventors: Dmitriy Meyerzon, Hugo Zaragoza, Kyle Peltonen, Andrew DeBruyne
-
Publication number: 20120041943Abstract: Systems and methods for storing and accessing data. A query language statement may reference a plurality of data sets and a plurality of algebraic relations between the data sets may be composed from the query language statement. The algebraic relations may be used to define new data sets and to optimize access to data sets. A store of algebraic relations may be accumulated over time. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved from slower storage.Type: ApplicationFiled: August 19, 2011Publication date: February 16, 2012Inventor: Christopher M. Piedmonte
-
Publication number: 20120036111Abstract: Techniques are described herein for performing column functions on virtual columns in database tables. A virtual column is defined by the database to contain results of a defining expression. Statistics are collected and maintained for virtual columns. Indexing is performed on virtual columns. Referential integrity is maintained between two tables using virtual columns as keys. Join predicate push-down operations are also performed using virtual columns.Type: ApplicationFiled: October 20, 2011Publication date: February 9, 2012Inventors: Subhransu Basu, Harmeek Singh Bedi
-
Publication number: 20120036120Abstract: Searching stored content is disclosed. A first mapping is created from an object to one or more stored relational database tables. A second mapping is created from the object to an indexer schema. One or both of the following is done: 1) using the first mapping to translate a search request expressed in an abstract query language to a first query language associated with the relational database; and 2) using the second mapping to translate the search request to a second query language associated with the indexer schema.Type: ApplicationFiled: August 23, 2011Publication date: February 9, 2012Applicant: EMC CORPORATIONInventors: Marc Brette, Frédéric Ciminera, Bruno Marquié
-
Publication number: 20120030192Abstract: A method, system and computer program for processing materialized tables in a multi-tenant application system, wherein in the multi-tenant application system, a plurality of tenants share one or more basic-tables. According to the data access history information of the plurality of tenants, an update pattern analyzer analyzes the similarity of the update patterns for one or more basic-tables by the plurality of tenants. Furthermore, according to the similarity analyzed by the update pattern analyzer, a tenant grouping means groups the plurality of tenants into a plurality of tenant groups. Additionally, according to the tenant groups grouped by the tenant grouping means, a materialized table constructor constructs the tenant group materialized tables from the one or more basic-tables.Type: ApplicationFiled: June 22, 2011Publication date: February 2, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Wen Hao An, Ning Duan, Bo Gao, Chang Jie Guo, Zhi Hu Wang
-
Publication number: 20120030189Abstract: According to some embodiments, an anchor transactional view may be defined for at least one business object data structure. The anchor transactional may have a plurality of anchor fields, each anchor field representing a data source and being associated with a field of an anchor search view. An indication of at least one extension field to the anchor search view may be received. The anchor search view and at least one extension field may represent, for example, a virtual fast search infrastructure view. Responsive to the received indication of the at least one extension field, an additional view may be dynamically joined at runtime to the anchor transactional view. The additional view may have at least one additional field, and each additional field may be associated with one of the extension fields.Type: ApplicationFiled: July 30, 2010Publication date: February 2, 2012Inventors: Oliver Vossen, Martin Müller, Maic Wintel