Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Access augmentation or optimizing

Subclass of:

707 - Data processing: database and file management or data structures

707001000 - DATABASE OR FILE ACCESSING

Patent class list (only not empty are listed)

Deeper subclasses:

Entries
DocumentTitleDate
20090006316Methods and Apparatus for Rewriting Regular XPath Queries on XML Views - Methods and apparatus are provided for rewriting view queries into equivalent queries on the source document. According to one aspect of the invention, methods are provided for processing a view query on a database view. The method comprises the steps of translating the view query to a mixed finite state automata representation of a document query on one or more documents underlying the database view; and evaluating the document query on the one or more documents to obtain a result to the view query. The view query may be, for example, a regular XPath query.01-01-2009
20100017362SIMPLIFYING ACCESS TO DOCUMENTS ACCESSED RECENTLY IN A REMOTE SYSTEM - Simplifying access to documents accessed recently on a remote system. In one embodiment, the list of documents accessed by a user using a first instance of an application in a first/remote system is maintained. The list of documents is provided/displayed to the same user when using a second instance of the same application on a second/local system, thereby facilitating the user to access the documents accessed recently on the remote system.01-21-2010
20090063396TECHNIQUES FOR PARTITIONING INDEXES - Techniques for partitioning indexes are provided. A predefined data type associated with a column of a database table is acquired. Column value statistics for the column are acquired. The values are analyzed to produce multiple partitions for the values. Each partition includes each of the values and each partition includes multiple groupings of the values. Also, each grouping of a particular partition includes a subset or range of the values. Furthermore, each grouping of a partition includes a same distribution for the values as other groupings of that partition. Each partition represents a potential partitioning index for the column and its values.03-05-2009
20090006315STRUCTURED METHOD FOR SCHEMA MATCHING USING MULTIPLE LEVELS OF ONTOLOGIES - A structured method of matching schemas that uses multiple levels of ontologies is disclosed. The method maps functions of a target system to a process ontology and maps functions of a source system to the process ontology to produce a first mapping of target functions and source functions using the process ontology. The method identifies target function parameters upon which the target functions operate and identifies source function parameters upon which the source functions operate. Then, the method maps the target function parameters to a concept ontology and maps the source function parameters to the concept ontology to produce a second mapping of the target function parameters and the source function parameters using the concept ontology. This second mapping is enhanced by mapping the target function parameters to a data-type ontology and mapping the source function parameters to the data-type ontology. This produces an enhanced second mapping of the target function parameters and the source function parameters using the data-type ontology. This enhanced second mapping can be the resultant output to be used in subsequent processing.01-01-2009
20090171885EFFICIENT BULK LOAD - The subject matter disclosed herein relates to bulk loading of data into a database comprising a plurality of database partitions. In one particular example, the database partitioning may be revised before addition of the new data to the partitions.07-02-2009
20100042581JOIN PATHS ACROSS MULTIPLE DATABASES - Methods, systems and computer instructions on computer readable media are disclosed for optimizing a query, including a first join path, a second join path, and an optimizer, to efficiently provide high quality information from large, multiple databases. The methods and systems include evaluating a schema graph identifying the join paths between a field X and a field Y, and a value X=x, to identify the top-few values of Y=y that are reachable from a specified X=x value when using the join paths. Each data path that instantiates the schema join paths can be scored and evaluated as to the quality of the data with respect to specified integrity constraints to alleviate data quality problems. Agglomerative scoring methodologies can be implemented to compute high quality information in the form of a top-few answers to a specified problem as requested by the query.02-18-2010
20090157601METHOD AND SYSTEM FOR INDEXING AND SEARCHING HIGH-DIMENSIONAL DATA USING SIGNATURE FILE - Provided are a content-based searching method and system for multimedia objects using a high-dimensional feature vector data based on a 2-level signature. The method for searching the high-dimensional data using a signature file includes calculating a first-level query signature and a second-level query signature by using the query feature vector, performing a first filtering operation to obtain a primary candidate cell group by searching a second-level signature file, and performing a secondary filtering operation to obtain a secondary candidate cell group having a high similarity in a primary candidate cell group. Accordingly, the high-dimensional data searching method and system can process a query quickly and accurately and can increase the searching accuracy by using an enhanced signature of the query feature vector.06-18-2009
20090157603METHOD FOR IMPROVING SECURITY IN DISTRIBUTION OF ELECTRONIC DOCUMENTS - In the distribution of electronic documents within an organization or across the perimeter of the organization, security is an important issue as the documents may be sensitive to a larger and a smaller degree. The distribution specifically takes place between individual persons and groups of persons either within or outside the organization, and on data communication networks including both intra nets and extra nets. In order to improve the security communication paths are determined for each distributed document on the basis of the set of all mappings of communication relations between senders or documents providers and all potential and actual recipients of the documents, including temporal parameters. Determined communication paths are used to compute a degree of sensitivity for the document, and this degree of sensitivity is used to monitor and limit the distribution of the document in compliance with an established security scheme for the organization.06-18-2009
20090157602INFORMATION PROCESSING APPARATUS AND CONTROL METHOD THEREFOR - This invention provides an information processing apparatus which shortens the memory access time and reduces the cost while ensuring data reliability. To accomplish this, the information processing apparatus shifts each write start timing so that data to be written in at least one memory is not influenced by noise during write when writing the same information in a plurality of memories. When reading data from a plurality of memories, the information processing apparatus compares the data with each other to estimate normal data.06-18-2009
20090157600FEDERATED PAGINATION MANAGEMENT - A method of processing a plurality of instances in a federated deployment of SOA applications can include the steps of receiving a transaction request to retrieve data, the request specifying retrieving the data stored according to range of indices of the federated deployment, processing each of the instances in a predetermined order to retrieve the data; and calculating a total number of records in the federated deployment.06-18-2009
20090157599SEGMENTATION OF SEARCH TOPICS IN QUERY LOGS - A system and method are disclosed for identifying the tasks that a user is attempting to perform when submitting a series of search queries. A task may be categorized hierarchically into a mission and a goal in order to classify a series of queries and determine the user's intent. The user's mission may be an extended task and the user's goal may be a specific task. A pair of queries may be analyzed to determine whether those queries have the same mission and/or the same goal. For a series of queries, boundaries may be identified between the queries to identify where a user has changed her goal or changed her mission. The identification of goals, missions and boundaries may be automated based on an analysis of features of the queries that are compared.06-18-2009
20090157598SYSTEMS AND PROCESSES FOR EVALUATING DATABASE COMPLEXITIES - A database may be evaluated to determine the complexity of the database. Metadata associated with a database may be retrieved and database information may be identified from the retrieved metadata. Database information may include, for example, a number of tables, a number of attributes of a table, a number of relationships in a table, or a number of records in a table of a database. A database complexity score may be determined based on identified database information.06-18-2009
20090157597REDUCTION OF ANNOTATIONS TO EXTRACT STRUCTURED WEB DATA - Document, such as web pages of a domain, are annotated to facilitate extracting structured information from the documents. The documents are clustered. Each cluster is such that the documents within that cluster are similar to each other at least with respect to a first threshold, such as according to a shingling metric, where the first threshold is an 8/8 shingling match. There is at least one overlap cluster, each overlap cluster including at least one of the plurality of clusters such that documents of the at least one cluster included in that overlap cluster are similar to each other at least with respect to a second threshold that is lower than the first threshold. A particular overlap cluster is designated, as is a particular cluster of the particular overlap cluster. For the particular designated cluster, an obtained annotation is transferred to other clusters included in the designated particular overlap cluster.06-18-2009
20090150339METHOD AND SYSTEM FOR PATTERN MATCHING HAVING HOLISTIC TWIG JOINS - A method of query pattern matching uses a chain of linked stacks to compactly represent partial results to root-to-leaf query paths, which are then composed to obtain matches for the twig pattern.06-11-2009
20090150336PARTITIONING IN VIRTUAL COLUMNS - Techniques are described herein for partitioning a database table using a virtual column as the partitioning key. A virtual column is defined by the database to contain results of a defining expression. Partitioning can be performed using a variety of partitioning schemes, such as range partitioning and hash partitioning. The partitions are automatically updated to reflect changes to the values in the base columns upon which the virtual column depends. Partition pruning and parallel-wise partition joins can be performed on database tables which have been partitioned on virtual columns.06-11-2009
20090150335ACHIEVING COHERENCE BETWEEN DYNAMICALLY OPTIMIZED CODE AND ORIGINAL CODE - An apparatus comprising a first search logic to search for a first entry for a first page containing a first code region in a first data structure to determine whether a first indicator in the first entry is set to a first value; an adder logic to add the first entry to the first data structure, in response to failing to find the first entry in the first data structure; a second search logic to search for a second entry for the first code region in a second data structure, in response to determining that the first indicator is set to the first value, wherein one or more optimized code regions corresponding to the first page from a code cache are to be removed in response to determining that the first page may have been modified, and wherein the first indicator is to be set to a second value.06-11-2009
20090150337INDEXING AND SEARCHING AUDIO USING TEXT INDEXERS - A full-text lattice indexing and searching system and method for indexing word lattices using a text indexer to enable enhance searching of audio content. The system and method utilize a Time-Anchored Lattice Expansion (TALE) method that represents word lattices such that they can be indexed with existing text indexers with little or no modification. Embodiments of system and method include an indexing module for generating and indexing word lattices based on audio content and a searching module for allowing searching of a full-text index containing indexed word lattices. The indexing module includes a custom IFilter and a custom Wordbreaker. Embodiments of the searching module include an ExpandQuery function for decorating an input query and a custom Stemmer. Embodiments of the searching module also include a GenerateSnippets module that extracts information from the indexed word lattices to enable the creation of clickable snippets.06-11-2009
20090138434METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR MANAGING DATA ASSOCIATED WITH A DOCUMENT STORED IN AN ELECTRONIC FORM - A method, system, and computer program product for managing data associated with a document stored in an electronic form. The document can be a part of a file. Computer processed algorithms, user-operated computer graphics tools, or both can be used to derive data from or assign data to the document or the file. First data is derived from the document, second data is assigned to the document, or both. The first data, the second data, or both are organized as attributes of an object of a first computer database. At least one attribute is organized as a child object of the object. The at least one attribute is associated with a feature of the document. Optionally, an attribute is moved from the object of the first computer database to an object of a second computer database and an address of a location in a memory at which the object of the second computer database is stored is added as a new attribute of the object of the first computer database.05-28-2009
20090138431SYSTEM AND COMPUTER PROGRAM PRODUCT FOR ASSEMBLY OF PERSONALIZED ENTERPRISE INFORMATION INTEGRATORS OVER CONJUNCTIVE QUERIES - A plurality of sources are registered. A plurality of schemas are constructed, based on the plurality of sources. A desired output is obtained as a conjunctive query. A list of potential connections between at least selected ones of the sources is provided. A plurality of join plans are developed, based on the connections.05-28-2009
20090125479DATA VIEW PRESERVATION - The invention provides a method, system, and program product for preserving data views in an information space. A first aspect of the invention provides a method of preserving data views encountered as a user browses an information space, the method comprising: creating an empty path to be taken by a user through an information space assigning a uniform resource locator (URL) to the path; presenting a data view of the information space; assigning a URL to the data view; and adding the data view to the path. A path may contain one or more data views or, when created, no data views.05-14-2009
20090125478Database heap management system with variable page size and fixed instruction set address resolution - A heap management system for a database uses “sets” of pages to store database information. As memory for each successive set of pages is allocated, more memory is allocated for storing rows in each page of the set. Similarly, the maximum number of rows of information storable in each page of each set is greater for each successive set of pages. The number of computer instructions needed to resolve (or calculate) the memory address for a particular row is fixed. Given a target row number, (and the number of rows in the first page, and the width of the column or column group), only a fixed number of computer instructions need to be executed to resolve the starting memory address for the target row. In addition, information of the same type (i.e., one or more columns of a table) may be stored in different pages, and these pages may be located in discontiguous memory segments. This allows space for new rows to be allocated, without requiring all pre-existing rows to be moved to a different memory segment.05-14-2009
20090299957METHODS, APPARATUSES, AND COMPUTER PROGRAM PRODUCTS FOR PROVIDING AN AUDIBLE INTERFACE TO PUBLISH/SUBSCRIBE SERVICES - An apparatus may include a processor configured to receive content. The received content may at least partially comprise audio content. The processor may be further configured to generate an audible content posting from the received content. The processor may be additionally configured to store the generated audible content posting in a database comprising a publish/subscribe service. In some embodiments, the processor may be further configured to provide the audible content posting to remote device users via an audible interface to the publish/subscribe service.12-03-2009
20090043731INFORMATION PROCESSING APPARATUS, AND FUNCTION LIMITATION METHOD OF INFORMATION PROCESSING APPARATUS - The present invention aims to limit, in case of causing plural devices to perform a process together, a use of a function of another device by reflecting function limitation information for individual user. In case of retrieving the function of the another device, a function retrieval request is issued to the another device with the set function limitation information for individual user added (S02-12-2009
20090043729Processing Overlapping Continuous Queries - An edge-covering based greedy method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a unit price of each filter, evaluating, sequentially, each filter in order of a lowest to a highest unit price, to determine a value for each filter, and changing an ordering of the filters according to the values.02-12-2009
20090043728Query Optimization in a Parallel Computer System to Reduce Network Traffic - An apparatus and method for a database query optimizer to optimize a query that uses multiple networks. The query optimizer optimizes a query to reduce network traffic on a network or node that is overloaded or above an established parameter in a node/network attribute table. The query optimization to reduce network traffic may result in a sub-optimal query in other respects such as execution time. The result is a query optimizer that rewrites or optimizes a query to execute on multiple nodes or networks to reduce traffic on a network or node according to the loading characteristics and assigned attributes of a node or network.02-12-2009
20100005057STATISTICAL MEASURE AND CALIBRATION OF INTERNALLY INCONSISTENT SEARCH CRITERIA WHERE ONE OR BOTH OF THE SEARCH CRITERIA AND DATABASE IS INCOMPLETE - Disclosed is a system for, and method of, searching for and identifying an entity representation. Some embodiments permit search criteria that are internally inconsistent. Such internally inconsistent criteria may include, for example, a maiden last name and a married last name. Certain embodiments account for such criteria in an intelligent manner and identify matching entity representations with a known confidence level of accuracy.01-07-2010
20090307186Method and Apparatus for Database Management and Program - A database management apparatus including an auxiliary storage unit for storing structured data and a database management part for managing the structured data, which extracts all paths showing a storage position of the structured data to be processed from an SQL statement for processing the structured data; when a plurality of the paths are extracted, the database management apparatus compares the extracted paths with each other, and extracts as a common path a common part of both the paths; and processes using the SQL statement the structured data of nodes of the storage position or lower shown by the extracted common path.12-10-2009
20090307187Tree automata based methods for obtaining answers to queries of semi-structured data stored in a database environment - Methods for efficiently obtaining answers to queries in a database (DB) environment include forming tree automata (TA), processing semi-structured data using the TA to provide indexed data, pruning the indexed data to obtain pruned data and performing a join operation to join either the pruned data or the semi-structured data to provide the answers. The queries relate to data stored as semi-structured data. In some embodiments, the TA is unordered.12-10-2009
20090094195Method for Distributed RDSMS - A method and potential embodiment for processing streaming data records is described which provides facilities for defining and naming multiple input and output data streams using relational processing definitions and abstractions similar to those found in relational database management systems (RDBMS) and embodied as a set of communicating stream processing nodes. The result is a Distributed Data Stream Management System (DDSMS) which is also a kind of Relational Data Stream Management System (RDSMS). The former comprises a set of Relational Data Stream Management System (RDSMS) nodes, whereas the latter might contain only a single RDSMS node.04-09-2009
20090094192Adaptive Query Processing Infrastructure - Methods, systems, and computer program products are provided for improving the processing of database queries. Some embodiments include detecting an overly long running query execution plan, stopping execution of the plan, and utilizing the query optimizer to select an alternate plan for execution. Embodiments may utilize system timers which are set with a time limit for the first selected plan, with instructions to re-optimize and initiate selection of an alternate plan when the timer times out. Risky constructs may be located in the first plan and removed from future consideration for executing the query. In some embodiments, the additional overhead for non-problem queries consists of little more than creating and sending a message or setting a timer when starting query execution, and canceling a timer upon successful query processing completion. A secondary thread may be created responsive to detecting a long running query, to supervise selecting an alternate execution plan.04-09-2009
20090094191EXPLOITING EXECUTION FEEDBACK FOR OPTIMIZING CHOICE OF ACCESS METHODS - A proactive monitoring mechanism for correcting the choice of access methods (available query plans) for a given query, based on execution feedback from the same query. The mechanism exploits bypassing predicate short-circuiting inside the database server's predicate evaluation module to obtain expression cardinalities. The mechanism can also modify a plan to obtain expression cardinalities. These techniques are used judiciously by the query optimizer and/or a database administrator (DBA) so that the execution overheads are within acceptable limits.04-09-2009
20090094190METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR DISPLAYING TAG WORDS FOR SELECTION BY USERS ENGAGED IN SOCIAL TAGGING OF CONTENT - Methods, systems and computer program products for displaying tag words for selection by users engaged in social tagging of content accessible via a communications network, are provided. A tag cloud, tag word inventory curve and slider control are displayed within a graphical user interface. The tag cloud is a visual representation of an inventory of tag words. The tag word inventory curve is a graphical representation of the words in the inventory by frequency of usage by others. The slider control is responsive to user movement, and is movable within a range that spans the length of the tag word inventory curve. Movement of the slider control changes the number of tag words from the inventory displayed in the tag cloud according to frequency of usage by others.04-09-2009
20090271364OPTIMIZED STORAGE AND ACCESS METHOD FOR A HISTORIAN SERVER OF AN AUTOMATED SYSTEM - Exemplary embodiments of the disclosure relate to a method and a system for the storage and processing of process values of a technical process or a technical installation in a historian server which can be integrated into a process control system of a technical installation or of a technical process. In such a method and system a dedicated signal cache can be associated with every process value for its raw values provided by the process. The raw values provided by the process are stored in the respective signal caches and additional internal signal-individual aggregate accumulators for the desired aggregates are associated with every raw value. The aggregate accumulators are incrementally modified for the defined interval when a new raw value is received.10-29-2009
20090271363ADAPTIVE CLUSTERING OF RECORDS AND ENTITY REPRESENTATIONS - Disclosed is a system for, and method of, determining whether records and entity representations should be linked. The system and method include assigning to each pair of entity references a match value reflecting the likelihood that the entity references are related. Based on the match values, each entity reference may then associated with a preferred entity reference. Pairs of entity references that are mutually preferred may then be identified and linked. The process may be iterated to generate further links.10-29-2009
20090271362METHOD FOR CONTROLLING A RELATIONAL DATABASE SYSTEM - A method for controlling a relational database system, wherein a query statement to be processed, which consists of keywords, is first analyzed by applying a recursive transition network (RTN) and then converted into control commands by the following steps: defining the RTN in a presetting step by forming independent RTN building blocks each having an inner, directed decision graph and optionally at least one recursive call function; forming an RTN building block-independent reference group, the elements of which refer to a residual decision graph with the first decision position removed; carrying out a reference processing step and running the residual decision graphs, which may prescribe the recursive call function; and generating an optimized access plan for the relational database system.10-29-2009
20090271361Non-repeating random values in user specified formats and character sets - Systems, methodologies, media, and other embodiments associated with producing non-repeating random values for use in data masking are described. One example method includes accessing data describing a mask for a value in a database table column to be masked. The example method may also include identifying a number of distinct values in the database table column to be masked and determining a field width for a mask to provide unique random numbers to mask the distinct values. The method may include identifying locations in a mask value to store the unique random value and locations in a mask value to store filler values. The mask value may include different character sets and may comply with user specified formats. The method may include generating a set of statements that when executed produce a mapping table that includes masks for distinct values in the database table column to be masked.10-29-2009
20090271360Assigning Plan Volatility Scores to Control Reoptimization Frequency and Number of Stored Reoptimization Plans - Methods, systems, and computer program products are provided for improving the processing of database queries. Some embodiments include generating volatility scores for various plans for executing similar database queries. Different embodiments may utilize: database statistics, the variable values being selected for, and/or historical run time data, to generate the plan volatility scores. In some embodiments, the volatility scores are used to determine whether to generate a new plan for a query, whether to prune an existing plan, and/or how many different plans to store for a query.10-29-2009
20090077009SYSTEM AND METHOD FOR STORAGE, MANAGEMENT AND AUTOMATIC INDEXING OF STRUCTURED DOCUMENTS - A structured document storage and management technique utilizes a generic document model tree that contains structured document nodes. A symbol conversion module contains untagged data associated with one or more of the structured document nodes and with a corresponding number of value codes. An encoded vector set includes a set of encoded vectors corresponding to the one or more structured document nodes having associated untagged data. Each of the encoded vectors contains one of the value codes at an index position that corresponds to a particular structured document.03-19-2009
20090030875STATISTICS MANAGEMENT - Disclosed is a technique for maintaining statistics. A query is received. Column group generation is performed to form one or more column groups. Column group refinement is performed based on statistics data generated for a previously received query. A statistics check is automatically performed. A statistics collection command is generated to obtain statistics.01-29-2009
20090030874Techniques for Optimizing SQL Statements Using User-Defined Indexes with Auxiliary Properties - In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs. From the plurality of execution plans, the query optimizer selects an optimal execution plan that is associated with an optimal total cost of the plurality of total costs.01-29-2009
20090030873AUTOMATED STORAGE AND RETRIEVAL OF DATA - The present invention is directed to the automated storage and retrieval of data. A method in accordance with an embodiment of the present invention includes: requesting a data record; broadcasting a query for the requested data record to a plurality of data records in a data center, the query comprising a unique listener key identifying the requested data record and information regarding a requesting program; providing each of the plurality of data records with a listener, wherein each listener actively monitors the broadcasted query to determine if the unique listener key in the broadcasted query matches a unique listener key of the data record associated with the listener; and in the case of a match, automatically transferring the data record with the matching unique listener key from the data center to the requesting program.01-29-2009
20090248618Database Query Processing with Dynamically Activated Buffers - A method, apparatus and program product dynamically activate and/or deactivate buffers during execution of a database query. The dynamic deactivation and activation is based on the monitoring of information associated with the consumption of data by a plurality of threads during execution of an access plan for the database query. By doing so, the selection of a less optimal buffer position during optimization may be replaced with a more optimal buffer position during runtime, often resulting in improved query performance and parallelism.10-01-2009
20090248615Method and System for Folder Recommendation in a File Operation - A method and system for folder recommendation in a file operation are provided. The method includes: receiving (10-01-2009
20090234802Coupled node tree splitting/conjoining method and program - The minimum value or the maximum value of the index keys of a coupled node tree of a processing source is determined, and the index keys are successively deleted until the index key that is to be the splitting point is reached, the deleted index keys being inserted into the coupled node tree of the processing target, thereby splitting the coupled node tree. Deletion processing is done of one coupled node tree, taking as the processing source in the above-noted splitting method, and insertion processing is done of the other, taken as the processing target, thereby conjoining the coupled node trees.09-17-2009
20090234801APPROXIMATING QUERY RESULTS BY RELATIONS OVER TYPES FOR ERROR DETECTION AND OPTIMIZATION - A method and system is provided for computing an approximation of the results of a query. The approximation represents a superset of all possible results, by computing a set of records of types (as opposed to a set of records of values, which is the normal result of a query). This is different from conventional systems, which typically infer types for each field individually. For each record of types, one may also keep track of equalities of fields to improve the precision of the approximation. The approximation can be used to detect erroneous parts of queries that always return an empty result, regardless of the contents of the data source. Furthermore, the same approximation is also useful in performing optimizations: first, by eliminating parts of procedure calls that are guaranteed to be irrelevant to the calling context, and second, by eliminating unnecessary type tests in the query.09-17-2009
20090234800COMPUTER PROGRAM PRODUCT FOR DATABASE QUERY OPTIMIZATION - A computer program product for database query optimization including a computer usable medium having a computer readable program, wherein the computer readable program, when executed on a computer, causes the computer to receive a database query, search the database query for a literal term, replace the literal term in the database query with a placeholder term to put the database query in a template form, search a directory for a replacement query that corresponds to the database query in the template form, replace the database query with the replacement query and include the placeholder term in the replacement query, and replace the placeholder term in the replacement query with the corresponding literal term to put the replacement query in an executable format, wherein the replacement query is an optimized substitute for the database query.09-17-2009
20090234799EFFICIENT PROCESSING OF QUERIES IN FEDERATED DATABASE SYSTEMS - Methods and apparatus, including computer program products, implementing and using techniques for processing a federated query in a federated database system. A federated query is received at a federated database server. A federated query execution plan is generated based on the received federated query. The federated query execution plan defines one or more source servers of the federated database and a unique subquery to be executed on each of the source servers. The subqueries are distributed to the source servers in accordance with the federated query execution plan. The respective subqueries are executed asynchronously at the source servers. The subquery results are passed to a first designated source server defined in the federated query execution plan. The subquery results are joined and aggregated at the first designated source server into a final query result. The final query result is returned to the federated database server.09-17-2009
20080301087Index clustering for full text search engines - Techniques of index clustering for full text search engines are described herein. In one embodiment, a full text search is performed by a search node using a local copy of an index within the searching node during a search session. In response to an update of a list of data entries the relational database through a Common API (common in the sense the update triggered to the relational DB will also trigger an index change), an index update event is scheduled to update a master copy of the index directory. Periodically the local copy of the index directory is updated by copying index data from the master copy of the index directory (totally or incrementally). Other methods and apparatuses are also described.12-04-2008
20080294598Electronic Device - An application makes a processor issue a first file access command to a middleware in order to access a file. In response to the first file access command, the middleware makes the processor periodically determine whether file access operation having a higher priority level than file access operation involved with the first file access command is being performed and, in the case where an affirmative determination is made, issue a second file access command corresponding to the first file access command within redundant bandwidth obtained by subtracting guaranteed bandwidth of the high-priority file access from the maximum bandwidth available for accessing the file storage.11-27-2008
20080294597COMPUTER-IMPLEMENTED METHOD, COMPUTER PROGRAM PRODUCT AND SYSTEM FOR CREATING AN INDEX OF A SUBSET OF DATA - The invention is directed to a method, computer program product and computer system for creating an index of a subset of data, comprising: 11-27-2008
20080294596SYSTEM AND METHOD FOR PROCESSING QUERIES FOR COMBINED HIERARCHICAL DIMENSIONS - An abstract query is received for querying data sources for a combined hierarchical dimension having at least one hierarchy. The abstract query is mapped into data source specific queries by generating context expressions according to the at least one hierarchy. The data source specific queries are executed in an order according to the at least one hierarchy to produce value results for the combined hierarchical dimension.11-27-2008
20080294595VISUAL INTERFACE TO INDICATE CUSTOM BINNING OF ITEMS - Records representing items in a dimensionally-modeled fact collection are assigned to bins. A count-based portion of a user interface receives user bin assignment specification of the records based on user-specified counts of records. Actual counts for bin assignment are determined by constraining records having a same data value at a specified particular dimension to be within the same bin. A user-observable indication of the determined actual counts is provided. The user interface may include a value-based portion. The value-based portion of the user interface may be operated to receive user indication of bin assignment specification of records based on user-specified at least one value at the particular dimension. Determining actual counts includes reconciling the user indication of bin assignment specification in the count-based portion with the user indication of bin assignment specification in the value-based portion.11-27-2008
20080275840SELECTIVE DATABASE STATISTICS RECOLLECTION - The subject mater herein relates to database management and, more particularly, to selective database statistics recollection. Various embodiments provide one or more of system, methods, and software that identify database column and index states when statistics become stale to a point where query execution plans against respective columns and indexes fail to be efficient. These and other embodiments provide a way to update column and index statistics only when the statistics are determined to be stale. As a result, adverse database performance as a result of needless updating of database statistics is mitigated.11-06-2008
20090100004System And Methodology For Automatic Tuning Of Database Query Optimizer - System and methodology for automatic tuning of database query optimizer is described. In one embodiment, in a database system having an optimizer for selecting a query plan for executing a database query, a method of the present invention is described for automatically tuning query performance to prevent query performance regression that may occur during upgrade of the database system from a prior version to a new version, the method comprises steps of: in response to receiving a given database query for execution, specifying a query plan generated by the prior version's optimizer as a baseline best plan for executing the given database query; generating at least one new query plan using the new version's optimizer; learning performance for each new query plan generated by recording corresponding query execution metrics; if a given new query plan is observed to have better performance than the best plan previously specified, specifying that given new query plan to be the best plan for executing the given database query; if a given new query plan is observed to have worse performance than the best plan previously specified, specifying that given new query plan to be a bad plan to be avoided in the future; and automatically tuning future execution of the given database query by using the query plan that the system learned was the best plan.04-16-2009
20090307184Hyperspace Index - 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. The absence of an identifier corresponding to a parameter pattern at any level in all of the hierarchical threads indicates that the parameter pattern is not present.12-10-2009
20090248620INTERACTING METHODS OF DATA EXTRACTION - Extraction methods can interact on a common data source using identifiers that correspond to events or other actions. These identifiers can be updated, whenever appropriate, once the corresponding data has been summarized, in order to provide for multiple extraction methods to operate only on the data of interest, and obtain a lock only on the data within the scope of extraction. High water marks, such as identifiers in the sequent, can be used to further designate which data has previously been extracted. Similarly, summarization methods can interact by utilizing corresponding persistent tables in the flows for the methods, but utilizing separate intermediate tables to allow for data transformations and application of various business rules and tuning techniques. The ability to switch between different methods can accommodate business, performance, or other such needs, and can provide for the dynamic extraction and summarization of different volumes of data.10-01-2009
20090037365PRODUCT JOIN DYNAMIC PARTITION ELIMINATION FOR MULTILEVEL PARTITIONING - A method of searching a multilevel partitioned database includes receiving a query data from the multilevel partitioned database. At least for one level partitions are dynamically included. For some levels, partitions may also be statically included for execution of the query. The query is the executed over the partitions that are both dynamically and statically included. In one example, the cost of joining two tables in a multilevel partitioned database includes determining level partitions that can be statically included, estimating level partitions that will be dynamically considered for the join, and determining a cost as a function of the estimated statically included level partitions and estimated dynamically included level partitions.02-05-2009
20090037366ONLINE INDEX BUILDS AND REBUILDS WITHOUT BLOCKING LOCKS - Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.02-05-2009
20080306903CARDINALITY ESTIMATION IN DATABASE SYSTEMS USING SAMPLE VIEWS - A system and method that facilitates and effectuates estimating the result of performing a data analysis operation on a set of data. Employing an approximation of the data analysis operation on a statistically valid random sample view of the data allows for a statistically accurate estimate of the result to be obtained. Sequential sampling in the view enables the approximated operation to evaluate accuracy conditions at intervals during the scan of the sample view and obtain the estimated result without having to scan the entire sample view. Feedback regarding the accuracy of the estimated result can be captured when the data analysis operation is performed against the set of data. Process control techniques can be employed with the feedback to maintain the statistical validity of the sample view.12-11-2008
20100010962Deferred Compilation of Stored Procedures - A system, method, and computer program product are provided for compiling a stored procedure in a database. The compiling includes the steps of invoking the stored procedure, the stored procedure comprising one or more statements, substituting run-time values for one or more variables in the statements, and creating an access plan for the statements having the substituted run-time values.01-14-2010
20090248617OPTIMIZATION TECHNIQUE FOR DEALING WITH DATA SKEW ON FOREIGN KEY JOINS - A method for determining when a database system query optimizer should employ join skew avoidance steps. The method includes dynamically calculating the worst-case anticipated frequency distribution for a particular relation along a particular set of join column(s) at query execution time. The calculated frequency distribution value is compared to a skew threshold, the skew threshold representing the number of rows on the same distinct value that would lead to avoidable processing inefficiencies. It is then determined that the database system query optimizer should employ join skew avoidance steps if the calculated frequency distribution value exceeds the skew threshold.10-01-2009
20090100002UPDATABLE RESULT SET FOR MULTIPLE JOINED TABLES - A technique for providing an updatable result set from multiple joined tables derived from a plurality of databases includes testing for at least one unique index from each of the multiple joined tables. A technique for providing an updatable result set from multiple joined tables that may include null values for outer-joined tables includes testing for a connection to the unique indexes and the null values.04-16-2009
20100005054Querying joined data within a search engine index - Techniques and systems for indexing and retrieving data and documents stored in a record-based database management system (RDBMS) utilize a search engine interface. Search-engine indices are created from tables in the RDBMS and data from the tables is used to create “documents” for each record. Queries that require data from multiple tables may be parsed into a primary query and a set of one or more secondary queries. Join mappings and documents are created for the necessary tables. Documents matching the query string are retrieved using the search-engine indices and join mappings.01-07-2010
20090070289Methods, Systems, and Computer Program Products for Estimating Accuracy of Linking of Customer Relationships - The disclosed methods, systems, and computer-program products allow a business to estimate linking errors in customer relationships in a database and to identify metrics that improve the linking accuracy. In an embodiment, a plurality of sample customer relationships are selected from a database to form a sample data set that is statistically representative of the database. Potential linking errors are then identified within the sample data set. The identified potential linking errors are then validated to identify actual linking errors in the sample data set. Once validated, the actual linking errors within the sample data set are used to estimate linking errors within the database. Further, the estimated linking errors in the database may be analyzed to identify one or more factors that contribute to the linking errors.03-12-2009
20100036802Repetitive fusion search method for search system - Provided in the present invention is a repetitive fusion search method for a search system, in which: a search interface 02-11-2010
20100036801STRUCTURED QUERY LANGUAGE FUNCTION IN-LINING - Methods and apparatus, including computer program products, related to query language function in-lining. In general, data characterizing a query in accordance with structured query language format is received. A determination is made as to whether the query includes qualified function calls. If the query includes the qualified function calls, operations are performed that include: mapping available values from the qualified function calls to available parameters of the qualified functions referred to by the qualified function calls; replacing the qualified function calls with data derived from a body of code to be executed when a corresponding function is called, where the replacing is to generate a modified query and the data derived from the body of code is based on the mapping; and providing the modified query to be executed as a substitute for an original version of the query.02-11-2010
20100036800AGGREGATE JOIN INDEX UTILIZATION IN QUERY PROCESSING - A system and method include obtaining a query and identifying an aggregate join index (AJI) at a high level of aggregation. The dimension table may be rolled-up with the grouping key being the union of the grouping key in the AJI and the grouping key of the query. The identified AJI is joined with the rolled-up dimension table to obtain columns in the query that are not in the identified AJI. The joined AJI and rolled-up dimension table are then rolled up to answer the query.02-11-2010
20100036799QUERY PROCESSING USING HORIZONTAL PARTIAL COVERING JOIN INDEX - A computer implemented system and method includes obtaining a query referring to rows in a relational database. A sparse index of the database that has a set of rows that is a subset of the rows referred to in the query is obtained. Rows referred to in the query that are not in the sparse index are then obtained and a union of such rows and the rows of the sparse index is performed to obtain a complete row set for processing the query.02-11-2010
20090276393Implementing Aggregation Combination Using Aggregate Depth Lists and Cube Aggregation Conversion to Rollup Aggregation for Optimizing Query Processing - A process combines multiple grouping sets into single rollup sets with depth lists defining the levels of grouping that must be performed. Grouping sets are identified that are contained within other sets and combined into single rollups with depth lists. Cube aggregation conversion to rollup aggregation is provided for optimizing database query processing. Natural sets of rollup hierarchies within a cube are recognized and the cube is converted into those rollup hierarchies. Once converted, the rollup aggregation is performed to significantly reduce required processing.11-05-2009
20100030727Technique For Using Occurrence Constraints To Optimize XML Index Access - Approaches are provided for improving the performance of certain database queries that operate on binary-encoded XML. In particular, the approach uses occurrence and type constraint information about XML data stored in the database for optimizing the relational rewrite of a query. Constraint information can be obtained in several different ways including through a formal language specification such as an XML Schema or DTD, through discovery of a user-provided secondary index on a an XML path table, or through a structural summary that is derived from statistical analysis on a set of XML documents stored in the database.02-04-2010
20090150338POLICY DRIVEN MEMORY MANAGEMENT OF POOL OF CURSORS IN DATABASE MANAGEMENT SYSTEM - An apparatus, program product and method utilize policy-driven management of a pool of cursors in a database management system. Cursor usage statistics are determined for a plurality of cursors, and a plurality of cursor criteria defined in a policy are used to identify one or more cursors to close based upon the determined statistics. Among the statistics that are collected is a query time statistic that specifies, for each cursor, how long the query with which that cursor is associated, took to execute. As a result, a cursor that is associated with query that took a relatively longer time to execute will generally be less likely to be closed than a cursor that is associated with a query that took a relatively shorter time to execute. Consequently, should a cursor be needed for a particular query after the cursor has been closed, the performance penalty associated with recreating that cursor and its associated objects will be reduced.06-11-2009
20090012932Method and System For Data Storage And Management - According to some embodiments of the present invention there is provided a method and a system for managing data storage in a plurality of data partitions, such as replica databases. The method is based on analyzing, for each physical data partition, the received memory access queries. Each memory access query has a different result table which is based on different fields. This analysis is performed to determine the frequency of receiving each one of the memory access queries. The analysis allows, for one or more of the analyzed memory access queries, associating between at least one key of a respective result table and at least one of the physical data partitions. In such an embodiment, data elements are stored according to a match with respective said at least one key.01-08-2009
20090006311AUTOMATED SYSTEM TO IMPROVE SEARCH ENGINE OPTIMIZATION ON WEB PAGES - A system and method for automated search engine optimization (SEO) are disclosed. The automated SEO may analyze search query logs, or a search log database to determine popular concepts/units which may be automatically utilized to optimize a site or page for search engine results. The site or page is edited based on the automated SEO. In particular, the search log database may provide a unit frequency list reflecting the popularity of various units. The more popular units that are related to the content of the page may be used in the automated SEO of the page. The unit frequency list may be compared with the existing units of a page, so that the more popular concepts within the page may be emphasized.01-01-2009
20080243773SYSTEMS AND METHODS FOR A DISTRIBUTED FILE SYSTEM WITH DATA RECOVERY - The intelligent distributed file system enables the storing of file data among a plurality of smart storage units which are accessed as a single file system. The intelligent distributed file system utilizes a metadata data structure to track and manage detailed information about each file, including, for example, the device and block locations of the file's data blocks, to permit different levels of replication and/or redundancy within a single file system, to facilitate the change of redundancy parameters, to provide high-level protection for metadata, to replicate and move data in real-time, and to permit the creation of virtual hot spares among the smart storage units without the need to idle any single smart storage unit in the intelligent distributed file system.10-02-2008
20090083215SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR AUTOMATED SELECTION OF SAMPLING USAGE IN A DATABASE SYSTEM - A system, method, and computer readable medium that automate the selection of sampling for statistics collection in a database system are provided. Various resource usage and savings evaluations may be made to determine if a column or index is a candidate for sampling during statistics recollections. If the column is successfully evaluated as a quality candidate for sampling using resource usage and savings evaluations, one or more statistics accuracy evaluations may be made to determine if inaccuracies introduced in the statistics by sampling are tolerable. If the column is successfully evaluated as a quality candidate for sampling using the statistics accuracy evaluations, the column may be designated for sampling during statistics recollections on the column. A column or index is thereby identified or eliminated for sampling and designated as such in an automated manner without manual designation or specification by a database management administrator.03-26-2009
20090094189METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR MANAGING TAGS ADDED BY USERS ENGAGED IN SOCIAL TAGGING OF CONTENT - Methods, systems and computer program products for managing tags added by users engaged in social tagging of content accessible via a communications network include identifying critical words associated with content accessed by a user, and recommending one or more content-descriptive tags to the user based on critical words identified in the content. Identifying critical words in content includes assigning a weighted value to content words, for example, based on occurrence and location of content words within the content. Identifying critical words in content also includes assigning a weighted value to content words, for example, based on the position on a content word inventory curve, such as a “long tail” curve. The position on a long tail curve defines popularity of content words in other social tags currently in use.04-09-2009
20090094188FACILITATING IDENTIFICATION OF AN OBJECT RECORDED IN DIGITAL CONTENT RECORDS - Embodiments of the present invention facilitate identification of one or more objects in digital content records at least by knowing or estimating what region of space-time was captured by the digital content records and where the objects were located at various points in time. An object's location versus time is referred to herein as a space-time line. Any digital content record whose captured space-time region intersects with a particular object's space-time line is identified as having a possibility of having recorded the particular object.04-09-2009
20090055350AGGREGATE QUERY OPTIMIZATION - A method, computer program product, and system for optimizing aggregate queries are provided. The method, computer program product, and system provide for receiving an aggregate query comprising a GROUP BY operation and an aggregate function, creating an access plan for executing the aggregate query, the access plan including a join between an outer relation and an inner relation, and designating the join included in the access plan as an early out join.02-26-2009
20090063400APPARATUS, SYSTEM, AND METHOD FOR IMPROVING UPDATE PERFORMANCE FOR INDEXING USING DELTA KEY UPDATES - An apparatus, system, and method are disclosed for updating database indexes on complex data types. Instead of deleting all the index keys for an old indexable entity, only the old index keys which are not in the set of new index keys associated with a replacement indexable entity will be deleted. In addition, only new index keys which are not in the set of old index keys are inserted into the index. In this manner, performance is greatly improved by elimination unnecessary deletions and insertions to an index.03-05-2009
20090299959QUERY RESULT GENERATION BASED ON QUERY CATEGORY AND DATA SOURCE CATEGORY - A method includes receiving a query that identifies an input data source. A query category for a query operator in the received query is identified. A data source category for the input data source is also identified. A results object is generated based on the identified query category and the identified data source category. The results object supports at least one of random access and sequential access to results produced by the query operator.12-03-2009
20090299958REORDERING OF DATA ELEMENTS IN A DATA PARALLEL SYSTEM - A query that identifies an input data source is received. The input data source is partitioned into a plurality of partitions. Each of the partitions includes a set of data elements with an associated set of indices for indicating an ordering of the data elements. A query type for a query operator in the received query is identified. It is determined whether a reordering of data elements will be performed based on the identified query type. The data elements in at least one of the partitions are reordered when it is determined based on the identified query type that reordering will be performed.12-03-2009
20090100008Methodology for File Identification and Retrieval in Directories for Categorized Files - A computer implemented method, system, and computer usable program code are provided for marking objects. Responsive to an object being received, the object is stored in a directory in a file system. An indicia is associated with the object and the directory. The object is displayed using the indicia as a marked object and the directory is displayed using the indicia as a marked directory.04-16-2009
20090276397METHOD FOR ANALYZING, DECONSTRUCTING, RECONSTRUCTING, AND REPURPOSING RHETORICAL CONTENT - A system and method are disclosed for analyzing, deconstructing, reconstructing, and repurposing rhetorical content. A system that incorporates teachings of the present disclosure may include, for example, a content management system (11-05-2009
20090281985TECHNIQUES FOR TRANSFORMING AND LOADING DATA INTO A FACT TABLE IN A DATA WAREHOUSE - Techniques for transforming records prior to loading the records into a data warehouse in an efficient manner. In one embodiment, instead of using lookup transformations, a database operation such as an outer join operation is used to transform records stored in a fact staging table to add foreign keys to the records corresponding to the dimension tables that are associated with a fact table in a data warehouse to which the records are to be loaded. Since the outer join operation is memory intensive, a determination is made as to which dimension tables from the multiple dimension tables associated with the fact table are suitable, from a performance perspective, for the outer join operation. Only those suitable dimension tables are outer joined to the fact staging table to add the foreign keys for the outer joined dimension tables to the fact staging table records. Lookup transformations may be used to add foreign keys to the fact staging table records for the non-suitable dimension tables. The transformed fact records with the foreign keys may then be loaded into the fact table in the data warehouse.11-12-2009
20090089243Method and apparatus for handling of information - The invention relates to a method and an arrangement for handling information in a customer device. The method comprises forming an information recording in the customer device from an external information source in respect of the customer device, forming a delimited information recording from the information recording on the basis of manual or automatic delimitation, and showing one or more resulting information contents associated with the delimited information recording.04-02-2009
20090287637Determining a Density of a Key Value Referenced in a Database Query Over a Range of Rows - A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query.11-19-2009
20100010960Operations of Multi-Level Nested Data Structure - Multiple sets of data are obtained from different sources. Each data set is represented using a different format having a different syntax and organized in a multi-level nested data structure. Each data set is reformatted into a standardized table format using a depth-first recursive algorithm without relying on the syntax schema of the original format of the data set. Various operations are performed on the tables corresponding to the data sets, including but not limited to joining multiple tables, grouping selected rows of a table, ranking rows of a table, adding or deleting fields from selected rows of a table, etc. Optionally, inferred namespace and text normalization are utilized for selected table operations. One or more templates are provided for converting the data set of a table to a format that may be presented to a user.01-14-2010
20080208797AUTOMATED RECORD ATTRIBUTE VALUE MERGING FROM MULTIPLE DIRECTORY SERVERS - Merging records from a first directory server and a second directory server to augment data from the first server with data from the second server. The records of the second server could contain only data augmenting the data from the record of the first server, or could contain duplicative data in addition to augmenting data, in which case only the augmenting data is merged with the data of the first server.08-28-2008
20080208796Method and system for providing sponsored information on electronic devices - A system implementing a method for providing sponsored information on an electronic device determines information of interest to the user as relevant information, accesses sponsored information, and provides sponsored information based on said relevant information.08-28-2008
20090112794ALIASED KEYS FOR FEDERATED DATABASE QUERIES - Embodiments of the invention provide techniques for performing federated queries of data records stored in multiple data sources. In one embodiment, an aliased key table may be configured to store relationships between key fields of multiple data sources. The aliased key table may specify a mapping function to translate a value of one key field to an equivalent value of a second key field. The mapping function may be used with a mapping table storing sets of key values of different data sources, with each set corresponding to a given entity. In another embodiment, the mapping function may call a web service configured to translate key values. In yet another embodiment, federated queries may be specified in terms of attributes, which may be matched to key values.04-30-2009
20090281986Generating Database Query Plans - Embodiments of the invention provide techniques for optimizing database queries for energy efficiency. In general, a query optimizer is configured to compare energy requirements of query plans, and to select a query plan requiring minimal energy to execute. In one embodiment, the query optimizer may also compare time performance of the query plans, and may select a query plan by matching to a user preference for a relative priority between energy requirements and time performance.11-12-2009
20090281987INTEGRATED DISTRIBUTED QUERY PROCESSOR FOR DATA GRIDS - A method for processing a distributed query in a network of computational resources is provided. The method includes receiving a user-defined freshness criterion and a distributed query from a user. The user-defined data freshness criterion is based on the version of the distributed query results desired by the user. An integrated cost model is formulated to optimize the execution of the distributed query. The integrated cost model is based on one or more integrated cost model factors. Thereafter, an objective function is constructed, based on the processing cost for each of the one or more copies of the one or more relations, and a data transmission cost for the transfer of the one or more copies of the one or more relations from a first to a second computational resource. Subsequently, an optimal solution of the objective function is calculated by using one or more heuristic approaches.11-12-2009
20090287640PROVIDING NOTIFICATION OF A REAL-WORLD EVENT TO A VIRTUAL UNIVERSE USER - An approach that provides transmission and notification of a real-world event to a virtual universe user is described. In one embodiment, there is a method for notifying a resident that is on-line in a virtual universe of an occurrence of a real-world event. The method includes receiving an indication of the occurrence of the real-world event, mapping the indication of the real-world event into one of a plurality of communication representations, and notifying the resident in the virtual universe in accordance with the mapped communication representation.11-19-2009
20090287638AUTONOMIC SYSTEM-WIDE SQL QUERY PERFORMANCE ADVISOR - A method, computer program product and computer system for providing SQL query performance advices to optimize SQL queries of a database, which includes providing a query cache to store records of optimized queries of the database, creating an event-driven web service, sending the records from the query cache to the web service, and analyzing the records using the web service to form SQL query performance advices. The method, computer program product and computer system can further includes outputting the SQL query performance advices to a viewer for display, or outputting the advices to a post-processing application for additional actions.11-19-2009
20090254517System And Method For Generating Messages - A method and system for generating messages are described. The method and system include retrieving information regarding a plurality of tasks from a database and based on the information retrieved, determining whether notifications for the tasks need to be generated. The method and system further include determining a recipient for each notification, grouping the tasks based on the recipient of each notification and generating a message for each group of tasks.10-08-2009
20090037367System and Methodology Providing Workload Management in Database Cluster - A system and methodology providing workload management in a database cluster. In one embodiment, for example, a method for allocating workload amongst a plurality of database servers sharing access to data comprises steps of: periodically collecting information about workload at each database server; distributing the workload information to each of the plurality of database servers; in response to a client connected to a first database server requesting that work be performed, examining the workload information to determine whether the requested work should be performed at a second database server having a lower workload than the first database server; if it is determined that the work should be performed at the second database server, automatically transferring the client connection to the second database server and performing the requested work at the second database server; and otherwise, performing the requested work at the first database server.02-05-2009
20090037368FAST PATH LOADING OF XML DATA - Techniques for implementing fast loading of binary XML into a binary XML database repository are provided. A client application reduces the processing burden on the repository by doing pre-processing of the binary XML data prior to loading.02-05-2009
20080243761METHOD AND SYSTEM FOR QUANTIFYING A DATA PAGE REPETITION PATTERN FOR A DATABASE INDEX IN A DATABASE MANAGEMENT SYSTEM - A method and system are presented for quantifying a data page repetition pattern for a database index in a database management system. In one embodiment, the method includes identifying a database index to provide a basis for collecting a data page repetition statistic, the database index having a database index key. The method may also include collecting the data page repetition statistic based on the database index key, wherein the data page repetition statistic quantifies a data page repetition pattern associated with database queries that reference sequential entries of the database index. The method may further include optimizing a data page access process based on the data page repetition statistic. In a further embodiment, the method may utilize both cluster ratio and data page repetition statistics to evaluate data page I/O and CPU cost.10-02-2008
20080228711USAGE-BASED OPTIMIZATION OF NETWORK TRAFFIC AND DATA WAREHOUSE SIZE - The present invention generally provides systems, methods, and articles of manufacture for maintaining a data warehouse having a plurality of fields updated with data from one or more data sources. Rather than automatically update every field of data available in the warehouse, a limited subset of fields identified through their involvement in queries issued against the warehouse are updated. By limiting the fields that are updated, the network bandwidth required to transmit the updates to the data warehouse may be reduced. Further, by removing fields from the data warehouse that are not in use, the size of the data warehouse may be reduced.09-18-2008
20080228706Determining Bioattribute Associations Using Expanded Bioattribute Profiles - A bioinformatics method, software, database and system are presented in which an expanded attribute profile is used to determine the strength of association between an individual and a query attribute (i.e., an attribute of interest). Primary attributes in an attribute profile of the individual are used as the basis for deriving lower resolution secondary attributes which are added to the attribute profile to create an expanded attribute profile. The strength of association between the individual and the query attribute is determined based on the identification of one or more attribute combinations in the expanded attribute profile that also occur in a dataset containing attribute combinations that are statistically associated with the query attribute.09-18-2008
20080228705Predisposition Modification Using Co-associating Bioattributes - A bioinformatics method, software, database and system are presented in which attributes that modify an individual's predisposition for association with a query attribute (i.e., an attribute of interest) are identified. A predetermined set of attribute combinations that are statistically associated with the query attribute is used as the basis for identifying those attributes that can be added to or eliminated from the attribute profile of the individual in order to modify the individual's statistical predisposition for association with the query attribute.09-18-2008
20080228704Expanding Bioattribute Profiles - A bioinformatics method, software, database and system for expanding attribute profiles are presented in which primary attributes from an attribute profile of an individual are used to derive secondary attributes that can be added to the individual's attribute profile to generate an expanded attribute profile having a higher strength of association with a query attribute (i.e., an attribute of interest).09-18-2008
20080228702Predisposition Modification Using Attribute Combinations - A method and system for computer based predisposition modification are presented in which the attribute profile of an individual is compared against attribute combinations that are statistically associated with a query attribute. Those attribute combinations which contain attributes that are also present in the individual's attribute profile are tabulated along with their strengths of association for the query attribute, to indicate attribute changes to the attribute profile that can modify the individual's statistical predisposition for association with the query attribute.09-18-2008
20080228700Attribute Combination Discovery - A method and system are presented in which stored attribute combinations and statistical results that indicate the strength of association of each attribute combination with the query attribute are accessed, and attribute combinations and their strength of association with the query attribute are tabulated based on the statistical results.09-18-2008
20080228710BUILDING DATABASE STATISTICS ACROSS A JOIN NETWORK USING SKEW VALUES - An apparatus, program product and method that build column statistics utilizing at least one skew value. The column statistics built using skew values, instead of column statistics built only through random sampling, may be used to more accurately reflect skew values across join networks, and thus enable a query optimizer to better select an access plan that is optimal under current runtime conditions.09-18-2008
20080228699Creation of Attribute Combination Databases - A method and system are presented in which the attributes associated with individuals having a query attribute of interest (query-attribute-positive individuals) are compared against attributes associated with individuals not having the query attribute of interest (query-attribute-negative individuals) to create to create a compilation of attribute combinations that co-occur with the query attribute.09-18-2008
20080228695TECHNIQUES FOR ANALYZING AND PRESENTING INFORMATION IN AN EVENT-BASED DATA AGGREGATION SYSTEM - Methods and apparatus are described for presenting information relating to event-based data aggregated in an event-based data aggregation system. A dashboard interface is presented which includes report summary data for each of a plurality of reports to which a user has access. Each report corresponds to a subset of the event-based data derived with reference to an associated report rule set. At least one of the report rules sets is editable by the user. The report summary data are updated in response to detection of new event-based data being added to the event-based data aggregation system which match a first one of the report rule sets.09-18-2008
20080228696OPTIMIZATION OF ANALYTICAL EFFECTIVENESS IN AN ANALYST NETWORK - Optimization of analytical effectiveness of a plurality of analysts is achieved, in part, this through the routing of information elements (i.e., discrete quantities of content suitable for analysis by one or more analysts) to selected analysts in order to maximize achievement of analysis goals defined as part of an analysis plan. Within an analyst network, information elements are obtained by a routing controller from an information network. Based on the analysis goals provided to the routing controller, the routing controller selects specific analysts to receive the information elements. Various characteristics of individual or groups of analysts may be used to identify the selected analysts. In this manner, the present invention provides the ability to tailor the available analyst resources to best address the universe of available topics in the most efficient and productive manner.09-18-2008
20090265308Software and method for teaching, learning, and creating and relaying an account - A method of relaying to a user an account regarding characters, where the account includes one embodiment of a branching story, includes: generating a plurality of electronic communicative entities, each expressing a communication of at least one character, and displaying the electronic communicative entities to the user. The method includes prompting the user to choose a branch among a plurality of branches of the branching story, receiving a branch choice of the user, and relaying the account to the user based at least in part on the branch choice. A majority of the electronic communicative entities includes at least one of an email, an instant message, a chat room message, and a web page. The account is substantially completely relayed to the user by the plurality of electronic communicative entities.10-22-2009
20090265307SYSTEM AND METHOD FOR AUTOMATICALLY PRODUCING FLUENT TEXTUAL SUMMARIES FROM MULTIPLE OPINIONS - A system and method for automatically generating fluent textual summary from multiple opinions. The opinion summarization system comprises a feature extractor, a text generator and a feature analysis storage. The feature extractor retrieves textual opinions from an opinion database relevant to a predetermined topic and analyzes retrieved textual opinions relevant to the predetermined topic by extracting a plurality of predetermined features from the retrieved textual opinions. The feature analysis storage stores the plurality of predetermined features extracted from the retrieved textual opinions. The text generator generates an opinion summary that summarizes all of the retrieved textual opinions relevant to the predetermined topic by converting the plurality of predetermined features extracted from the retrieved textual opinions into the opinion summary comprising a fluent block of text.10-22-2009
20090265306Index Maintenance in a Multi-Node Database - Embodiments of the invention enable a database spread over multiple nodes to allow each node to have different indexes over the data in tables, depending on how each node would benefit (or not benefit) from having the index(es). When a database table is spread across the nodes of a multi-node or distributed system, each node may maintain only the portion of the index relevant to that node, if doing so would improve the performance of query processing operations on that node. Further, the database may periodically redistributed across the compute nodes based on index performance. Doing so allows the database system to intelligently trade off between consuming space for the index on a node and the usefulness of having an index on that node.10-22-2009
20090265305Partial Indexes for Multi-Node Database - Embodiments of the invention enable a database spread over multiple nodes to allow each node to have different indexes over the data in tables, depending on how each node would benefit (or not benefit) from having the index(es). When a database table is spread across the nodes of a multi-node or distributed system, each node may maintain only the portion of the index relevant to that node, if doing so would improve the performance of query processing operations on that node. Further, the database may periodically redistributed across the compute nodes based on index performance. Doing so allows the database system to intelligently trade off between consuming space for the index on a node and the usefulness of having an index on that node.10-22-2009
20090265304METHOD AND SYSTEM FOR RETRIEVING STATEMENTS OF INFORMATION SOURCES AND ASSOCIATING A FACTUALITY ASSESSMENT TO THE STATEMENTS - A system and method for providing a factuality assessment of a retrieved information source's statement are disclosed. The method includes receiving a user's query which identifies an information source whose statements are to be retrieved, retrieving documents which refer to the information source, mapping statements in the retrieved documents to their authors, identifying as information source statements, the mapped statements that are mapped to an author which is compatible with the information source, and for at least one of the information source's statements, assessing a factuality of the information source's statement according to the information source.10-22-2009
20090265303IDENTIFYING SUPERPHRASES OF TEXT STRINGS - Methods and apparatus are described by which “superphrases” of “seed phrases” representing basic concepts may be identified without having to compare all possible pairs of seed and candidate phrases. According to one class of embodiments, a data structure similar to an inverted index is used for indexing phrases. The elimination of seed and candidate phrase pairs is enabled by building and traversing the index in a particular manner.10-22-2009
20080288449METHOD AND SYSTEM FOR AN AGGREGATE WEB SITE SEARCH DATABASE - Signature schema documents may be pre-defined using a query language to provide instructions for application by an engine to extract data from web pages of respective web sites. For a particular web page, signature schema instructions identify a web page family for the web page and extract desired data from the web page in accordance with its web page family. The instructions use signatures previously identified within web pages of the same family to distinguish the web page family from others of the web site and to distinguish the desired data from other data for the web page family. A server may make one or more requests to obtain web pages from various web sites and apply respective signature schemas maintained in a repository coupled to the engine. Extracted data can be stored to an aggregate database.11-20-2008
20080288447METHODS AND APPARATUS FOR IMPROVING PEER EFFICIENCY - Methods and apparatus for transferring data according to various aspects of the present invention operate in conjunction with a peer-to-peer (p2p) network. For example, a system may receive a request for sources for acquiring a file segment. The system may identify a set of candidate sources for retrieving the file segment and assess a connectivity for at least one candidate source. The system may transmit an identifier to the requestor for the at least one candidate source according to the connectivity assessment.11-20-2008
20080288445Interactive aggregation of data on a scatter plot - A computer-implemented method, which comprises the following: aggregating a plurality of records in accordance with an aggregation specification, wherein the records are part of a dimensionally-modeled fact collection; graphically representing the records in un-aggregated form; graphically representing the records in aggregated form; and causing the graphical representation of the records to be switched between aggregated form and un-aggregated form based on a user indication.11-20-2008
20080288443Customizable Joint Type Assignment Method And Apparatus - Application software in a tester for generating and running test programs for testing a printed circuit board is presented. The application software may include customizable joint type assignments from a CAD file making use of regular expressions.11-20-2008
20080288448METHOD, APPARATUS, AND SYSTEM FOR PROVIDING BUSINESS INTELLIGENCE - The novel business intelligence system disclosed herein provides companies with an out of the box enterprise worthy business intelligence solution or environment. The business intelligence system encompasses all of the processes that are involved in the implementation of a business intelligence solution with maximum flexibility but minimizes the need for building a customized system11-20-2008
20080288444Evaluating Multi-Table Join Selectivity in a Computer Database - An improved method and apparatus is described for a query optimizer to evaluate multi-table join selectivities in a computer database. The query optimizer includes a statistics manager that finds the most appropriate set of assumptions and statistics to use when calculating the cost of an arbitrary join expression. As described herein, the statistics manager implements a unique bucket representation for the join expression. The bucket representation for the join expression can be evaluated and compared to the traditional domino expression so that the best possible estimate can be used. This new representation of the join expression allows the query optimizer to more accurately estimate the join selectivity for many queries compared to traditional representations.11-20-2008
20080288441Processing method of data stream using Border Monitoring Query - The present invention relates to a processing method of data stream using Border Monitoring Query, and more particularly a monitoring method and a system for data streams which are a large volume of data and continuously generated such as financial ticker, GPS data or a ubiquitous sensor network (USN).11-20-2008
20100005058COMPUTER PRODUCT, INFORMATION RETRIEVING APPARATUS, AND INFORMATION RETRIEVING METHOD - A computer-readable recording medium stores therein an information retrieving program that causes a computer to execute acquiring a document to be searched and having a hierarchical structure; generating a path schema related to the acquired document; receiving input of a retrieval keyword, a retrieval condition for the retrieval keyword, and a retrieval equation specifying a retrieval range for the retrieval keyword; generating a single automaton that includes a hierarchy retrieval automaton that retrieves a hierarchy of the generated path schema and a hit keyword retrieval automaton that retrieves a hit keyword satisfying the retrieval condition, the single automaton making state transition between a hit hierarchical node where the hit keyword in the hierarchy retrieval automaton is present and a set of nodes representing the hit keyword; retrieving, from the document and using the single automaton, the hit keyword within the retrieval range; and outputting a retrieval result.01-07-2010
20100005056BATCH ENTITY REPRESENTATION IDENTIFICATION USING FIELD MATCH TEMPLATES - Techniques may be used to match records of a batch file to an entity representation in a universal database. Inputs may include, but are not limited to, a batch file and a universal (or other) database. The technique may compare the records of the batch file to the records of the universal database, and may attempt to create matches between the records in the batch file and the entity representations or records in the universal database. One possible output may include one or more tables that include foreign record IDs of the batch file records, each in association with an entity representation of the universal database. The techniques may include a batch style processing of records.01-07-2010
20100005055MULTI-TENANCY DATA STORAGE AND ACCESS METHOD AND APPARATUS - A method, apparatus, and a computer program product for storing and accessing multi-tenancy data. The method includes the steps of: creating a plurality of table sets in one or more databases, wherein each table set is used to store data of a group of tenants selected from a plurality of tenants; accessing data of a tenant in a table set in response to receiving a data access request from the tenant; and recording relationships between the tenants and the table sets in a multi-tenancy metadata repository, wherein the step of accessing the data of the tenant comprises the steps of finding the table set by querying the metadata repository and accessing the data of the tenant in the table set based on the result received from the query of the metadata repository.01-07-2010
20080313133REFERRING TO PARTITIONS WITH FOR (VALUES) CLAUSE - A method and apparatus for referencing a partition of a data storage space in a request to perform an operation with relation to the partition are disclosed. The techniques disclosed do not rely on knowing the partition's name, thus simplifying the process of requesting a database to perform an operation on a partition when that partition's name is unknown. Data such as a DDL statement is received. The data indicates a value in a FOR clause in lieu of the partition name. The data also indicates an operation to be performed with respect to a particular partition of the partitioned space. The particular partition is not named in the received data. Based on the value, it is determined that the particular partition is a first partition. The operation is performed with respect to the first partition.12-18-2008
20080313128Disk-Based Probabilistic Set-Similarity Indexes - Input set indexing for set-similarity lookups. The architecture provides input to an indexing process that enables more efficient lookups for large data sets (e.g., disk-based) without requiring a full scan of the input. A new index structure is provided, the output of which is exact, rather than approximate. The similarity of two sets is specified using a similarity function that maps two sets to a numeric value that represents similarity of the two sets. Threshold-based lookups are addressed where two sets are considered similar if the numeric similarity score is above a threshold. The structure efficiently identifies all input sets within a distance k (e.g., a hamming distance) of the query set. Additional information in the form of frequency of elements (the number of input sets in which an element occurs) is used to improve index performance.12-18-2008
20080313139METHOD AND APPARATUS FOR REPRESENTING AN INTEREST PRIORITY OF AN OBJECT TO A USER BASED ON PERSONAL HISTORIES OR SOCIAL CONTEXT - A method and apparatus assigns a quantative variable to each object (or set of objects) in a collection available to a user. The quantative variable is referred to as the Interest Priority Value (IPV). The IPV defines a range of states of the object, between ‘accessed’ and ‘unaccessed’, and is calculated based on one or more attributes of the object. A object with the highest IPV is the most ‘unaccessed,’ and the object with the lowest IPV is the least ‘unaccessed.’ The IPV may be used in a visual representation of the collection of objects, thereby permitting a user to readily identify and obtain those objects of greatest interest to the particular user.12-18-2008
20080313138APPARATUS FOR REPRESENTING AN INTEREST PRIORITY OF AN OBJECT TO A USER BASED ON PERSONAL HISTORIES OR SOCIAL CONTEXT - A method and apparatus assigns a quantative variable to each object (or set of objects) in a collection available to a user. The quantative variable is referred to as the Interest Priority Value (IPV). The IPV defines a range of states of the object, between ‘accessed’ and ‘unaccessed’, and is calculated based on one or more attributes of the object. A object with the highest IPV is the most ‘unaccessed,’ and the object with the lowest IPV is the least ‘unaccessed.’ The IPV may be used in a visual representation of the collection of objects, thereby permitting a user to readily identify and obtain those objects of greatest interest to the particular user.12-18-2008
20080313136METHOD AND APPARATUS FOR PRODUCING UP-TO-DATE QUERY RESULTS FROM TABLES INCLUDING DATA FROM A DATA WAREHOUSE - Methods, systems, and computer program products for answering a query to be executed on a database comprising a first table and a second table, and in which the second table includes data from the first table. In one implementation, the method includes refreshing the data in the second table with corresponding data in the first table at a first time, receiving a first query on the first table at a second time that is subsequent to the first time, rewriting the first query into a second query on the first table and a third query on the second table, and executing the second query and the third query respectively on the first table and the second table to generate results for the first query.12-18-2008
20080313131PARAMETER-SENSITIVE PLANS FOR STRUCTURAL SCENARIOS - Systems and methods that generate specialized plans for compiling SQL queries. A plan generator component scans the query representation for parameter sensitive predicates and evaluates each predicate individually based on the parameter values. Accordingly, queries can be identified not only based on their structures, but also based on their parameter conditions. The specialized plans are more efficient for particular values, wherein queries that employ such values are optimally executed.12-18-2008
20080313129METHOD AND APPARATUS FOR ENHANCING A GEOGRAPHIC INFORMATION SYSTEM DATABASE WITH OPERATIONAL DATA - A computer implemented method, apparatus, and computer usable program code for providing data about an airport from an airport mapping database. A first set of elements are stored in the airport mapping database, wherein the first set of elements are visible objects and are identified using a set of geometric features. A second set of elements are stored in the airport mapping database, wherein the second set of elements are non-visible objects and are identified using the set of geometric features. A first element from the first set of elements is associated with a second element in the second set of elements based on an operational relationship between the first element and the second element. A responsive set of elements containing one element from the first set of elements and another element from the second set of elements based on associations between elements in the first set of elements and the second set of elements are returned in response to a query.12-18-2008
20080313130Method and System for Retrieving, Selecting, and Presenting Compelling Stories form Online Sources - The invention provides a method and system for automatically retrieving, selecting, and presenting compelling stories from online sources. The system mines the online sources and collects texts that are likely to contain compelling stories. The system then extracts candidate stories from them and transforms these candidate stories to make them appropriate for presentation. The candidate stories are then passed through a set of filters to focus the system on stories with a heightened emotional state. Techniques are used to ensure retrieval of appropriate and meaningful content for the performance of the stories. The modified and filtered stories are then prepared for presentation, including marked up with speech and animation cues, gender classification, and dramatic Adaptive Retrieval Charts (or ARCs). These ARCs allow for various performance types from an ongoing performance of multiple actors in a physical installation to single actor performance of a single story for an online system.12-18-2008
20080313140Method and Apparatus for Multi-Dimensional Content Search and Video Identification - A multi-dimensional database and indexes and operations on the multi-dimensional database are described which include video search applications or other similar sequence or structure searches. Traversal indexes utilize highly discriminative information about images and video sequences or about object shapes. Global and local signatures around keypoints are used for compact and robust retrieval and discriminative information content of images or video sequences of interest. For other objects or structures relevant signature of pattern or structure are used for traversal indexes. Traversal indexes are stored in leaf nodes along with distance measures and occurrence of similar images in the database. During a sequence query, correlation scores are calculated for single frame, for frame sequence, and video clips, or for other objects or structures.12-18-2008
20080243771MANAGING COPIES OF DATA - A method in a computer system for retrieving data from one of multiple copies of the data is provided, referred to as the data management system. The data management system receives a request identifying at least one data object to be accessed. Then, the data management system queries a metabase to locate data copies that contain the identified at least one data object, wherein the data copies are created from similar source data, and wherein for each data copy the metabase contains an indication of the availability of the copy relative to other copies. Next, the data management system determines one of the located data copies to use to access the identified at least one data object, wherein the determination is made based on the indicated availability contained in the metabase for each of the located data copies. Then, the data management system accesses the identified at least one data object using the determined one of the located data copies.10-02-2008
20090192980Method for Estimating the Number of Distinct Values in a Partitioned Dataset - The task of estimating the number of distinct values (DVs) in a large dataset arises in a wide variety of settings in computer science and elsewhere. The present invention provides synopses for DV estimation in the setting of a partitioned dataset, as well as corresponding DV estimators that exploit these synopses. Whenever an output compound data partition is created via a multiset operation on a pair of (possibly compound) input partitions, the synopsis for the output partition can be obtained by combining the synopses of the input partitions. If the input partitions are compound partitions, it is not necessary to access the synopses for all the base partitions that were used to construct the input partitions. Superior (in certain cases near-optimal) accuracy in DV estimates is maintained, especially when the synopsis size is small. The synopses can be created in parallel, and can also handle deletions of individual partition elements.07-30-2009
20080228703Expanding Attribute Profiles - A method and system for expanding attribute profiles are presented in which primary attributes from one or more attribute profiles are used to derive secondary attributes which are added to the respective attribute profiles to generate expanded attribute profiles. The expanded attribute profiles are generated to increase the strength of association of a query attribute with one or more attribute profiles associated with query-attribute-positive individuals.09-18-2008
20090313209MAIL MERGE INTEGRATION TECHNIQUES - Various technologies and techniques are disclosed for integrating a customer relationship management application with a mail merge operation on a client-side word processor. Mail merge settings are received from a user, including a record set to use in a mail merge operation. A new mail merge document is created. The record set is added to the mail merge document. A link is added to a template that will control the mail merge operation on a client-side word processor. The linked template gets attached to the new mail merge document when opened on the client-side word processor. Techniques for beginning a mail merge operation on a client-side word processor are described. A downloaded mail merge document is validated. The record set contained in the downloaded mail merge document is separated into one or more separate files. A mail merge wizard is started and advanced to a proper stage.12-17-2009
20080313137Behavioral WEB Graph - A map representing relationships between network nodes is provided, comprising a matrix of points in the map, each point representing a pair of different nodes or collections of nodes coupled to the network, and a value associated with each point, the value indicating a probability that a user connected at one of the nodes or collection of nodes associated with the point will next connect to the other node or collection of nodes associated with the point.12-18-2008
20080270344RICH MEDIA CONTENT SEARCH ENGINE - A method of generating a set of search results. An audio content search results set including an individual audio content search result corresponding to a rich media time segment is generated. A visual content search results set including an individual visual content search result corresponding to the rich media time segment is also generated. A relevance of the rich media time segment is determined based at least in part on an individual search result count. The individual search result count is a sum of a number of individual audio content search results corresponding to the rich media time segment and a number of individual visual content search results corresponding to the rich media time segment. The rich media time segment is included in an ordered set of search results, wherein an order of the rich media time segment is based at least in part on the determined relevance.10-30-2008
20080222089Set function calculation in a database - A database system uses indexes to improve performance. The system can use one or more of the following: differentiated subfields for index clustering; set function calculations to reduce the amount of I/O; and/or using an inferred index in a circular table.09-11-2008
20080281779Query Directives And Access Plan Hints - A query plan modification system and method relate to a database system that includes a cost-based optimizer for generating access plans. The database system also permits a user to view an access plan that has been generated by a particular SQL query and modify the access plan if desired. The user specifies customizations that are associated with the access plan so that when that plan is executed, the customizations are executed as well. Exemplary customizations include specifying an initialization file specific to a query, specifying different implementation methods than those in the original access plan, prohibiting rebuilding of an access plan, and over-riding or ignoring a clause within the query that is used to generate the access plan.11-13-2008
20080281777Complex datastore with bitmap checking - A datastore, such as a registry or file system having a defined data structure with a logical layer, may be analyzed using a bitmap corresponding to equally sized blocks of data in the datastore. The bitmap is created by traversing the datastore and setting a bit at the beginning of each cell of data, where one cell may have multiple blocks. The datastore is traversed again at a logical layer to verify that each cell is used only one time. The second traverse may unset the beginning bit of each cell as the cell is used. An inconsistency is detected in the datastore when a bit is already unset during the second traverse and when set bits exist after the second traverse.11-13-2008
20080288446Queries with soft time constraints - Systems, methodologies, media, and other embodiments associated with supporting queries with soft time constraints are described. One exemplary system embodiment includes logic for accepting a query having a soft time constraint. The example system may also include logic for rewriting the query having the soft time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the soft time constraint.11-20-2008
20080235182Isolating Database Queries for Performance Processing - Methods, systems, and computer program products are provided for isolating database queries for performance processing. Embodiments typically include presenting to a user a prioritized list of potentially poorly performing queries; receiving from the user a selection of one or more potentially poorly performing queries; and executing performance processing of the selected queries.09-25-2008
20080270353Systems And Methods For Rule Inheritance - Systems and methods for automating and increasing the efficiency of access to data using inheritance of access rules within an organization based upon the relationship of positions within the organization and the roles associated with the positions. In one embodiment, a role structure is used in conjunction with a hierarchical organization structure to allow access rules to be inherited by some of the positions from other positions based upon the relationship of positions within the organization and the roles associated with the positions. Access rules can be applied across equivalent or similar positions, yet differentiated between distinct portions of the organization and the distinct roles associated with the positions. Consequently, particular access rules are not necessarily inherited by all of the positions subordinate to a particular position with which the rule originates, and are not necessarily inherited by all of the positions that are associated with a particular role.10-30-2008
20080270349Mapping an active entry within a hashed page table - A method for mapping an active entry within a virtually hashed page table is disclosed. An active entry within a virtually hashed page table is populated. A link table for locating a link at an offset from an active entry is maintained. This link table continues to be maintained as a valid link table until an occupied head bucket threshold is exceeded or a collision has occurred.10-30-2008
20080270354METHOD AND SYSTEM FOR ALLOWING ACCESS TO DEVELOPED APPLICATIONS VIA A MULTI-TENANT ON-DEMAND DATABASE SERVICE - In accordance with embodiments, there are provided mechanisms and methods for allowing access to developed applications via a multi-tenant on-demand database service, in a controlled environment. These mechanisms and methods for providing such access can enable embodiments to provide additional control over the development process as well as the access of such developed applications. The ability of embodiments to provide such additional control may lead to an improved application development framework, etc.10-30-2008
20080270345System and method for using indexes to parse static XML documents - A method, executed on a computing device, and a corresponding system, allow software applications to easily access data contained in a static XML document by parsing the static XML document. For each node in the XML document, a Node Offset value is determined. The Node Offset value is then stored and serves as an index offset value, where the index offset value is used by the software applications to retrieve the data contained in the static XML document.10-30-2008
20080270348Automatic event registration during query execution - In one aspect, a computer-implemented method may provide evaluation of a query based on query-specific event handlers. The method may include receiving a query. Moreover, one or more objects and aspects of the objects may be determined based on the received query. The objects and aspects may be registered with event handlers to monitor the objects and aspects. The received query may be evaluated, when at least one of the event handlers indicates a change to at least one of the objects and the aspects. Other event handlers may be registered, when at least one of the event handlers indicates the change. Related systems, apparatus, methods, and/or articles are also described.10-30-2008
20080270347Method and apparatus for facilitating improved navigation through a list - One embodiment of the present invention provides a system that facilitates improved navigation through a list. During operation, the system obtains a list, wherein the list includes a set of list-entries. The system then analyzes the list to determine a set of list-properties for the list. Next, the system associates a set of identifiers with the list based on the set of list-properties. Then, the system inserts the list into a list-box. The system also inserts the set of identifiers into a scrollbar associated with the list-box, thereby enabling a user to navigate to a subset of the list by selecting an identifier which corresponds to the subset from the scrollbar.10-30-2008
20080270352MODIFYING ENTRY NAMES IN DIRECTORY SERVER - The present invention provides a system and a computer-implemented method for modifying an entry name in a directory database. The method comprises the steps of: modifying, in response to a request for modifying operation of entry names, entry mapping information in accordance with the modification that is requested for modifying operation of entry names, wherein each piece of entry mapping information is used for indicating the correspondence relation between pre-modification entry name information and post-modification entry name information; asynchronously performing modifying operation of a corresponding entry name in accordance with respective pieces of entry mapping information when a predetermined condition for updating the directory database is met.10-30-2008
20080270351System and Method of Generating and External Catalog for Use in Searching for Information Objects in Heterogeneous Data Stores - Described are a system and method for generating an index for use in searching for information objects maintained in heterogeneous data stores. Information objects, maintained in multiple heterogeneous data stores, are accessed. Catalog items are generated for the information objects. Each generated catalog item is uniquely associated with one of the accessed information objects. The catalog items are stored in a searchable data store independent of and external to the multiple heterogeneous data stores.10-30-2008
20080243772METHOD AND SYTSEM FOR GENERATING NESTED MAPPING SPECIFICATIONS IN A SCHEMA MAPPING FORMALISM AND FOR GENERATING TRANSFORMATION QUERIES BASED THEREON - A method and system for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification. A transformation query is generated from the nested mapping specification by generating a first query for transforming source data into flat views of the target and a second query for nesting flat view data according to the target format. Generating the first query includes applying default Skolemization to the specification.10-02-2008
20090119249TRACKING PREMATURE TERMINATION OF A DATABASE QUERY - An apparatus and program product that utilize at least one prematurely terminated processing of a database query to improve the processing of the database query. Due to the difficulty of conventional techniques to improve the execution and/or performance of long processing queries, (e.g., advanced user knowledge, assistance from an expert, etc.), users typically terminate long processing queries. As a result, long processing queries may not be improved, and because of the limited options, users may continue to prematurely terminate long processing queries. However, information related to the premature terminations of a database query may be utilized by a DBMS to generate and/or implement suggestions to improve the processing of the database query, resulting in improved query processing, improved performance, fewer premature terminations, and more satisfied users.05-07-2009
20090119247EFFICIENT HASH BASED FULL-OUTER JOIN - In a database system, a full outer join is computed using a hash-based join.05-07-2009
20090119246AUTOMATED CAPTURE OF INFORMATION GENERATED AT MEETINGS - Meeting information is collected in an automatic or automated manner utilizing user devices among other devices likely to be present at meetings. Devices can detect the occurrence of a meeting and initiate data capture. Subsequently, aggregated data can be processed to facilitate access and/or dissemination of the data. For instance, data can be contextualized and/or indexed. Further, data can be generated in or converted to forms more suitable for information distribution (e.g., summary, points of interest . . . ).05-07-2009
20090094194METHOD AND SYSTEM FOR OPTIMIZING DATABASE PERFORMANCE - A method and system is provided that optimizes performance in non-relational databases. According to one aspect, view index size is kept at a level that optimizes performance by categorizing and sorting only a subset of the columns contained within the corresponding view. The remaining columns are marked as having been categorized and sorted, but are not actually categorized and sorted until these columns are queried.04-09-2009
20090125480Combining Streaming And Navigation For Evaluating XML Queries - A query is rewritten to combine streaming evaluation and XML index evaluation. The query is rewritten to include a streaming operator (e.g. function) that, when executed, uses streaming evaluation. Further, the query is rewritten so that XML index evaluation of a path expression also produces location information that identifies the location of a node within an XML document. The streaming operator is able to exploit the location information to begin and end scanning rather than scanning the entire XML document.05-14-2009
20090138430METHOD FOR ASSEMBLY OF PERSONALIZED ENTERPRISE INFORMATION INTEGRATORS OVER CONJUNCTIVE QUERIES - A plurality of sources are registered. A plurality of schemas are constructed, based on the plurality of sources. A desired output is obtained as a conjunctive query. A list of potential connections between at least selected ones of the sources is provided. A plurality of join plans are developed, based on the connections.05-28-2009
20090182709DYNAMIC PRECONDITIONING OF A B+ TREE - Various approaches for processing a B+ tree data structure are described. In one approach, in a first transaction a first insert operation to a first data page of a first index page in the B+ tree data structure is detected, and then it is determined whether performing the first insert operation would block a second insert operation in a second transaction concurrent with the first transaction. At least one empty second data page is created in response to determining that the second insert operation would be blocked by the first insert operation. The B+ tree data structure is updated to include the at least one second data page in the B+ tree data structure, and the updated index pages and second data page are committed to retentive storage. Thereafter, the first insert can be completed.07-16-2009
20090182707DATABASE CHANGESET MANAGEMENT SYSTEM AND METHOD - A method of database changeset management for automated information enhancement and control over changesets using a computational device. The steps include: analyzing and processing a query; journaling the query into a changeset-journaling module; recording a blocking journal entry based on a blocking characteristic of the query into a journal blocker module; sending a database mutation statement to a database. Undo requests are checked against the blocking journal before execution. Further steps include: triggering an interest protocol on a match of a query with an interest set; returning a response to a query based solely on information from a changeset-journaling module; comparing an actual return from the database to an expected return and generating a difference statement therebetween; providing a collaboration module; and providing a second changeset-journal module configured to journal an alternate database state; and returning a query result based on the alternate database state.07-16-2009
20090182708DEALING WITH COMPOSITE DATA THROUGH DATA MODEL ENTITIES - The present invention is generally directed to a system, method and article of manufacture for accessing data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs conversion of an abstract query (i.e., a request for results or a request to modify data) into a form that can be used against a particular physical data representation. Abstract and/or physical queries are transformed according to model entities which define a relationship between logical fields of the data repository abstraction layer.07-16-2009
20090182705Methods and Apparatus for Converting Union Commands to Union All Commands - In one aspect, a method is provided. The method includes: (1) identifying in a query of a database a union command involving data in the database that is mutually exclusive; and (2) changing the union command to a union all command.07-16-2009
20090164415METHOD AND SYSTEM FOR MANAGING DATABASE - A method and system for managing database is disclosed, which is capable of simultaneously performing a data selection procedure and a data click-count update procedure when specific data is selected, the method comprising receiving and analyzing a query in which both a fetch request for a record included in a specific database table and an update request for at least one of columns included in the record are defined together; generating an execution plan to execute the analyzed query; and executing the execution plan by fetching the record and updating at least one of the columns according to the execution plan.06-25-2009
20090177623Query optimizer with join cardinality estimation which mitigates the effects of skew - One embodiment relates to a computer-implemented method to estimate a cardinality of a database query. Single table cardinalities are determined after application of selection predicates. In addition, pair-wise join selectivities are estimated without assuming independence between selection and join predicates. Said pair-wise join selectivities are multiplied with said single table cardinalities after application of the selection predicates. Another embodiment relates to a computer apparatus including a cardinality estimator. The cardinality estimator includes computer-readable instructions configured to (a) determine single table cardinalities after application of selection predicates from the database query, (b) estimate pair-wise join selectivities without assuming independence between the selection predicates and join predicates of the database query, and (c) multiply said pair-wise join selectivities with said single table cardinalities after application of the selection predicates. Other embodiments, aspects and features are also disclosed.07-09-2009
20090164414QUERY RESPONSE SERVICE FOR BUSINESS OBJECTS - Methods and apparatus, including computer program products, for a query response service for business objects. In general, data characterizing a request to perform a query on multiple instances of a business object may be received, where the query includes selection criteria for multiple attributes across multiple nodes for each of the instances of the business object. The query may be initiated on the instances of the business object. Results including values from the attributes across the nodes of the business objects may be returned. The query may be assigned to a node of the business object, which may be a query response transformation node. The node may include a combination of attributes associated with the attributes across the nodes of the business object. Results may be sorted on a server, sent as pages to a client, or both.06-25-2009
20090164416ADAPTIVE DATA CLASSIFICATION FOR DATA MINING - A method and system for adaptive classification during information retrieval from unstructured data are provided. The method includes receiving input from a user defining a classification. A sample set of unstructured data based on the user defined classification defined is determined. The sample set of unstructured data is analyzed to determine a classification mapping that maps attributes of the sample set of unstructured data to class labels for the classification. The attributes of a set of data objects in a second set of unstructured data are indexed and one or more data objects in the set of data objects are mapped to the class label based on the classification mapping. Feedback based on the user's response to an interaction with results is determined using the class label. Finally, adaptive classification mapping is performed based on analysis of feedback by adjusting the sample set of data objects.06-25-2009
20090164413GENERIC TABLE STRUCTURE TO XML STRUCTURE MAPPING - A method of mapping data to a tag based mark up language such as XML includes receiving a table of data from a source service in a format specific to the source service. A table header is read from the received table of data that includes a data schema specific to a destination service in the received table. A converter maps data in the table to one or more tag based mark up language tables compatible with the table header data schema of the destination service. The data schema may be varied to identify different data schemas for different destination services without modifying the converter.06-25-2009
20090164410System and method for improving information retrieval from a database - The present invention relates to a method and system for improving information retrieval from a database. In one aspect, the invention provides a method for implementing a database. The method includes the steps of providing at least one set of linked entities which contain a plurality of entities, and each said entity is arranged to store at least one data value, further providing an additional entity for at least one set of linked entities, and storing in the additional entity the aggregation of a plurality of data values contained in the at least one set of linked entities.06-25-2009
20090144230ADDRESS LIST GENERATION SYSTEM AND METHOD EMPLOYING A GEOGRAPHICAL BUFFER ZONE - A method for generating an address list from a database of addresses comprises the steps of receiving at least one geographical criterion from a user, identifying a first geographical region from a user, forming a second geographical region by modifying the first geographical region pursuant to the at least one geographical criterion, wherein the second geographical region is not of the same geographical size as the first geographical region, and generating a list of addresses from the database of addresses which fall within the second geographical region.06-04-2009
20090138433Data Aggregation Systems And Methods - Data aggregation systems and methods capable of processing data related to a plurality of subscribers. In an exemplary embodiment, thee data aggregation system includes a receipt system, a sever assembly, a user interface, and a data analysis system. The receipt system can enable the data aggregation system to receive data, such as sales data, from the subscribers. Such data can be aggregated and stored on the server assembly. The user interface can be an element of a website serviced by the server assembly. Through the user interface, a subscriber can pose a request. In response to the request, the data analysis system can process a portion of the aggregated data and can, thereby produce a result set. The result set can be presented to the subscriber via the user interface.05-28-2009
20090187534TRANSACTION PREDICTION MODELING METHOD - Methods of generating a transactions prediction model using a computer for optimizing a number of transactions associated with a database system are presented, the methods including: capturing a database workload, where the database workload includes a number of statements corresponding with the transactions over a specified period of time, where each of the number of statements includes a variable parameter; generating a number of first generalized statements from the number of statements by replacing the variable parameter with a constant value; generating a number of second generalized statements, where if two or more of the number of first generalized statements are the same grouping the two or more of the number of first generalized statements to correspond with the number of second generalized statements; creating a number of transactions classes, where each of the number of transaction classes includes at least one of the number of first generalized statements.07-23-2009
20090138428Dimensionality reduction - A solution is provided wherein the apparent dimensionality of a data set is reduced by ranking combinations of dimensions and parts of dimensions in terms of their suitability for mapping to the axes of a grid display. A user may then be presented with dense lower dimensional views of the data that are much easier to understand than sparse high dimensional views. The user may then make further refinements, groupings, and analyses as needed.05-28-2009
20090138429Sructure Based Storage, Query, Update and Transfer of Tree-Based Documents - A method for storing data, comprises representing the data as a tree structure, calculating a structure ID for the tree structure, the structure ID being a representation of the tree structure and independent of node names and node values of the tree structure, and storing a mapping of the structure ID to the tree structure.05-28-2009
20090006317PROCESSING OF MULTIPLE DATA FILES WITH TIME-CORRELATED DATA - A distributed search architecture utilizing multiple processing cores to search multiple files containing time-correlated and logically/semantically interdependent sequential data. A supervisory processing core may provide coordination of the search where multiple slave processing cores each search one or more data files containing time-correlated and logically/semantically interdependent sequential data. Results of the searches performed by the slave processing cores may be provided to the supervisory processing core for consolidation, further analysis and/or presentation.01-01-2009
20090006313FORECASTING SEARCH QUERIES BASED ON TIME DEPENDENCIES - Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted.01-01-2009
20090006312DETERMINATION OF TIME DEPENDENCY OF SEARCH QUERIES - Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted.01-01-2009
20090177621Database Query Optimization - A method, system, and computer program product for optimizing database queries in a data processing system. A query optimization (QO) utility maximizes the query coverage of Materialized Query Tables (MQTs) in order to efficiently process various types of incoming queries to a database engine. In particular, the QO utility enables MQT technology for nullable foreign key columns in a number of table joins involving fact tables and dimension tables, in which the fact tables and dimension tables have column data which are not null. The QO utility also enables MQT query matching for a relational database engine for non-additive measures, and improves the performance of existing query-matching capabilities for a relational database engine for additive measures. The QO utility specifies a number of functionally dependent relationships between the columns of a table in order to enhance the query matching abilities of the database engine.07-09-2009
20090187535Method and Apparatus for Improved Information Transactions - Methods and systems for analyzing an image, such as a newspaper or magazine pager or the like including text by mapping the image to determine regions of text and analyzing portions of the image in accordance with characteristics of selected regions of the text to develop a desired ordering of at least the selected regions in accordance with a textual relationship between the selected regions. The desired order may be related to the order in which the selected regions, and or words therein, are to be presented in a different format appropriate for a specific use, such by a human reader, for transferring the text over a network, for use in a database or by a search function, word processor or printer. Normalizing, columnizing, regionalizing, frameset building and article tracing functions may be used to develop the desired order in related regions in an article within the image.07-23-2009
20090063403SYSTEMS AND COMPUTER PROGRAM PRODUCTS TO IDENTIFY RELATED DATA IN A MULTIDIMENSIONAL DATABASE - Systems and computer program products that identify data that is related to and associated with data that has been selected from a multidimensional database. The overwhelming amount of data in a multidimensional database that may be viewed by a user, such as a data analyst, is reduced to the selected and associated data by use of index data and related index data, according to the present invention. The views of selected data and related data may be highlighted and formatted for presentation to the user. Further, irrelevant data is filtered out and not presented to the user. Existing systems have not been able to efficiently and adequately identify data that is related to and associated with selected data in a multidimensional database.03-05-2009
20090063395MAPPING LOG SETS BETWEEN DIFFERENT LOG ANALYSIS TOOLS IN A PROBLEM DETERMINATION ENVIRONMENT - A method is provided for mapping analysis data between a first data analysis tool configured to interpret analysis data expressed in a first format to a second data analysis tool configured to interpret analysis data expressed in a second format. The method comprises receiving a set of analysis data expressed in the first format from the first data analysis tool; receiving an indication of the second format; identifying a set of common analysis data from the set of analysis data using a set of common analysis data properties and a first context, the first context providing a set of rules for expressing the set of common analysis data properties in the first format; and generating a representation of the set of common analysis data in the second format using a second context. The first context provides a set of rules for expressing the set of common analysis data properties in the first format. The second context provides a set of rules for expressing the set of common analysis data properties in the second format.03-05-2009
20090063394APPARATUS AND METHOD FOR STREAMLINING INDEX UPDATES IN A SHARED-NOTHING ARCHITECTURE - An apparatus and method to streamline updates to an index in a shared-nothing architecture. The apparatus may include an association module, a consolidation module, and a processing module. The association module may associate index update requests with an index. The index update requests may be configured to update the index in response to a redistribution of data in a data table. The consolidation module may compile the index update requests prior to processing and consolidate the index update requests into a smaller number of simplified index update requests to achieve substantially the same result. The processing module may then independently process the simplified index update requests and update the index accordingly.03-05-2009
20090144229STATIC QUERY OPTIMIZATION FOR LINQ - Systems and methods that optimize query translations at compile time in LINQ languages. An optimization component optimizes algebraic trees and rewrites an expression composed from sequence operators into a more efficient expression(s). A compiler associated with the optimization component can receive syntax (e.g., query comprehensions, query expressions) to turn into standard sequence operators that can operate on arbitrary collections. The compiler can then perform transformations on the algebraic trees, such as push filter conditions upwards or downwards and/or to combine filter conditions.06-04-2009
20090327217 METHOD AND SYSTEM FOR CREATION AND DYNAMIC UPDATING OF BEST DATA ARRANGEMENT IN DIGITAL DATA STORE SYSTEM - The current invention is a method and a system for analyzing templates of queries, with different levels of precision. When the system of the current invention takes a decision to arrange data, these templates are used, and a single data arrangement object (HRBlob) is designed which may serve a single template or several templates and not just a single query. This approach has an important impact on data arrangement performance and on queries performance, since this approach may help many more queries to be handled using less data arrangement objects.12-31-2009
20090327216Dynamic run-time optimization using automated system regulation for a parallel query optimizer - A computer-implemented apparatus, method, and article of manufacture for optimizing a database query. System conditions and operating environment events that occur during operation of the computer system are monitored. An n-dimensional optimizer matrix is used to identify at least one rule resulting from the monitored system conditions and operating environment events. An optimal query execution plan is selected from among a plurality of query execution plans generated for the query in response to the identified rule.12-31-2009
20090327214Query Execution Plans by Compilation-Time Execution - Described is a query optimizer comprising a query tuner that performs actual execution of query fragments to obtain actual results during compilation time, and uses those actual results to select a query plan. The actual results may be combined with estimates for fragments that were not executed. The tree may be traversed in a top-down traversal, processing every node. Alternatively, the tree may be traversed in a bottom-up traversal, re-deriving data for higher nodes as each lower level is completed. A limit, such as a time limit or level limit, may be used to control how much time is taken to determine the execution plan.12-31-2009
20090327213DOCUMENT INDEX FOR HANDHELD APPLICATION NAVIGATION - A mobile device includes an application programmed to include an input/output module programmed to load a document and render the document on the display. The application also includes a parsing module programmed to parse the document and to identify certain tags within the document that are associated with data structures. The application further includes an index generation module programmed to create a document index based on the certain tags identified by the parsing module, the document index being formed in a hierarchy.12-31-2009
20090327212Efficient SQL access to point data and relational data - Some embodiments include reception of a structured query language query, determination of at least one point data query and at least one relational data query based on the structured query language query, transmission of the at least one point data query to at least one point data server, transmission of the at least one relational data query to at least one relational data server, reception of point data and relational data in response to the point data query and the relational data query, and joining of the received point data and the received relational data into a result rowset.12-31-2009
20090144231System and Method for Adding Search Keywords to Web Content - It is an object of the present invention to improve findability (hit ratio) of a web page in a search using a search system by automatically adding useful keywords as search keys to the web page. A system includes a web content acquisition unit which acquires a web content, a keyword acquisition unit which acquires keywords arbitrarily associated with the web content from a social bookmark server, a keyword adding unit which adds the keywords acquired by the keyword acquisition unit to the web content acquired by the web content acquisition unit, and a transmitter unit which transmits the web content with the keywords added thereto upon request for acquiring the web content from a search server which provides a search service of the web content.06-04-2009
20090144228DATA PARALLEL PRODUCTION AND CONSUMPTION - A parallel execution of a query is performed with a plurality of producers using a partitioned data source, thereby producing output data. The output data is consumed with at least one consumer. The at least one consumer is monitored. A determination is made whether to stop producing output data by at least one of the producers prior to completion of the execution of the query based on the monitoring.06-04-2009
20090012931DATA INDEXING AND COMPRESSION - A method of indexing multidimensional data obtains (01-08-2009
20090024571Supporting aggregate expressions in query rewrite - In one embodiment, a plurality of materialized views is stored, where each view includes a set of aggregate expressions. Storing each materialized view comprises identifying one or more disjuncts in the set of aggregate expressions, generating a set of disjunct trees that represent the set of aggregate expressions, and storing the set of disjunct trees. When a query that requests aggregated data is received, one or more disjuncts are identified in an aggregate expression specified in the query. A disjunct tree for the disjuncts in the query is generated. Based on the disjunct tree for the query and on the set of disjunct trees for each materialized view, a particular materialized view is determined from the plurality of materialized views. The query is rewritten into an equivalent query that references the particular materialized view, where the equivalent query would retrieve the requested aggregated data from the particular materialized view.01-22-2009
20090024572Estimating the loaded execution runtime of a database query - In a method for estimating a loaded execution runtime of database query, a database query for a database is received for a loaded database. Load information for the database is received. A prediction of query runtime tree is accessed. The prediction of query runtime tree is built from historical query information regarding historical database queries previously executed on the database. The prediction of query runtime tree includes a classifier function adjusted for an historical impact of loading of the database. The database query is processed through the prediction of query runtime tree, such that a loaded execution runtime of the database query is estimated based upon information pertaining to historical database queries similar to the database query.01-22-2009
20090024568DATA SKEW INSENSITIVE PARALLEL JOIN SCHEME - 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.01-22-2009
20090024566METHOD AND APPARATUS FOR FACILITATING DISTRIBUTED PROCESSING OF DATABASE OPERATIONS - One embodiment of the present invention provides a system that facilitates distributed processing of database operations. During operation, the system receives a database operation at a distributed command processor, wherein the database operation includes a query language command. Next, the system performs a set of non-data processing operations associated with the database operation to obtain a set of non-data processing results. The system then sends the query language command to a database, which enables the database to execute the query language command to obtain a result.01-22-2009
20090024563METHOD AND SYSTEM FOR ESTIMATING PER QUERY RESOURCE CONSUMPTION - There is disclosed a method for estimating query resource consumption for a system storing a representative query resource consumption table. When a query is received, information of a representative query including representative resource consumption information is retrieved from the representative query resource consumption table, where a type of representative query is determined according to the received query. A resource consumption ratio of the received query and the representative query is calculated (computed), and a query resource consumption of the received query is estimated using the representative resource consumption and the calculated resource consumption ratio.01-22-2009
20090024570USER DEFINED QUERY REWRITE MECHANISM - A database statement contains a table function. The database statement is compiled by a database statement compiler. The database statement is rewritten by replacing the table function with a replacement database statement.01-22-2009
20090024569METHOD AND SYSTEM FOR MANAGING COMPLEX DATABASE INFORMATION - Methods and systems are described for storage and retrieval of complex data. An example method may store a first data item in a first data table included in a database. An aggregated data object may be generated based on preprocessing the first data table based on satisfying a predefined retrieval query. The aggregated data object may be stored based on a preprocessed format in a cluster table included in the database. The first data table may be updated, and the aggregated data object may be updated in the cluster table based on the update of the first data table.01-22-2009
20090024567PROFILE BASED SET OF PLANS FOR A DATABASE - A method for selecting a plan for a query is disclosed. The steps of the method include using a current plan when a query is invoked, where the current plan has a corresponding current profile. Determining when the current profile is changed into a new profile. When the current profile has changed, comparing the new profile to a set of stored profiles. When the new profile matches one of a set of stored profiles, then set the new profile as the current profile. And set one of a set of stored plans that corresponds to the first stored profile, as the current plan. When the new profile does not match one of the set of stored profiles, then invoke an optimizer to determine a new plan for the new profile. Set the new profile as the current profile, set the new plan as the current plan, save the new plan into the set of stored plans, and save the new profile into the set of stored profiles.01-22-2009
20090024564METHOD AND SYSTEM FOR ACCESSING A FILE SYSTEM - A method for accessing a file system that includes creating a document index for an active document, identifying a similarity score for each of a plurality of stored documents to generate a list of similar documents, wherein the similarity score is computed by comparing the document index for the active document with a search index for the plurality of stored documents, and displaying the list of similar documents in a file system interface.01-22-2009
20090063399INDEX SELECTION FOR XML DATABASE SYSTEMS - A method, system, and computer program product for selecting indexes to be created over XML data are provided. The method, system, and computer program product provide for receiving a workload for the XML data, the workload including one or more database statements, and utilizing an optimizer to recommend a set of one or more path expressions based on the workload received, wherein the set of one or more path expressions is to be used to create one or more indexes over the XML data.03-05-2009
20090198644LEARNING QUERY REWRITE POLICIES - A blended query rewrite provider takes as an input a search query and produces a list of query rewrite suggestions. The blended query rewrite provider generates suggestions by applying a number of individual query rewrite providers in series to a query. The sequence in which query rewrite providers are applied to a query is encoded in a query rewrite policy. Policies differ between query types. A policy application engine component selects which policy to apply to a given query based on the cluster to which a query belongs. The policy application engine uses a machine learning algorithm to assign a query to a cluster based on query features. The policy generation engine generates policies and trains the clustering algorithm used by the policy application engine offline based on training data sets and query logs.08-06-2009
20090198643APPARATUS AND METHOD FOR UTILIZING DENSITY METADATA TO PROCESS MULTI-DIMENSIONAL DATA - A computer readable storage medium includes a data analyzer to build population sets for dimensions of a multi-dimensional data source and to identify intersections of population sets so as to form density metadata. A query processor accesses the density metadata while processing a query.08-06-2009
20090049008SYSTEM FOR EVOLVING EFFICIENT COMMUNICATION - An improved system, method, service method, and data structure that facilitates collaboration with, communication of, and access to information, particularly in an education environment is disclosed. The invention includes a database having one or more records. Each record defines a logical connection between one or more querents and one or more respondents. Each logical connection has a strength value indicating the value of the logical connection. Some embodiments of the invention include a selecting process that selects one or more of the respondents to respond to one or more queries from a querent. Alternative embodiments of the invention include processes that mine the database and/or provide services to users.02-19-2009
20090049007METHOD, APPARATUS AND COMPUTER PROGRAM FOR MODEL-DRIVEN MESSAGE PARSING - There is disclosed a method, apparatus and computer program for parsing a message using a message model. A message is received comprising one or more message fields. This message is stored as a reference bitstream. The message model is used to compare a message field in one or more subsequently received messages with the equivalent field in the reference bitstream. Finally, responsive to determining that a message field in said one or more subsequently received messages matches a field in the reference bitstream a predetermined number of times, storing parser outputs for the matching field for future reuse.02-19-2009
20090313211PUSHING JOINS ACROSS A UNION - Selecting a join plan for a query containing a join and a union block includes determining whether to propose a join plan with the join pushed across the union block. A selection is made between a join plan in which the join is not pushed across the union block and any proposed join plan in which the join is pushed across the union block.12-17-2009
20090070290Method and Apparatus for Providing Geographically Authenticated Electronic Documents - A method and apparatus for providing geographically authenticated electronic documents is disclosed. Authentication for attributes for an electronic document stored on a computer network are defined, the attributes comprise at least one attribute describing a geographic location associated with the electronic document. Authenticated attributes (e.g., geographic location) of electronic documents (e.g., Web pages) allow for more accurate geographic searching and filtering. An authenticated digital certificate is created and associated with an electronic document. The authenticated digital certificate can be stored within the electronic document, such as can be done with HTML tags on a Web page. The digital certificate can also be stored as a separate file associated with the electronic document, as a separate signed digital certificate and as a database record.03-12-2009
20090248622METHOD AND DEVICE FOR INDEXING RESOURCE CONTENT IN COMPUTER NETWORKS - A method and device index resource content in a computer network. The computer network includes at least a first computer as a search engine and at least a second computer as a resource content site where a resource content of a user is stored. A determination is made as to whether the resource content is linked to a user-defined indexing code. The user-defined indexing code is used to process the resource content to obtain a set of information describing the resource content. The user-defined indexing code is executed in response to determining that the resource content is linked to the user-defined indexing code. The set of information describing the resource content is obtained as an indexing result in response to the executing.10-01-2009
20090248623ACCESSING DIGITAL IDENTITY RELATED REPUTATION DATA - Systems and processes of the present invention allow for tracking and publishing digital identity related reputation. In an example embodiment, a Digital Identity Provider maintains a database with reputation data that can be accessed by Requesters. The Digital Identity Provider may update reputation data based on a variety of events related to a digital identity. The reputation data may be tracked regarding the digital identity itself, digital identity purchaser or registrant, or an email address, domain name, URL, or website associated with the digital identity. The reputation data may include various categories, such as email practices, website content, privacy policies and practices, fraudulent activities, domain name related complaints, overall reputation, etc. The reputation data may be published in a publicly-available database, a private database, or via other methods. The Registrant may opt for a reputation service while registering a digital identity. The Requester may decide whether to interact with a digital identity based on the digital identity related reputation.10-01-2009
20090248621METHOD AND MECHANISM FOR OUT-OF-THE-BOX REAL-TIME SQL MONITORING - Methods, systems, and computer program products for monitoring database queries and executions is disclosed. The query syntax may conform to the structured query language (SQL). The approach supports various performance statistics to be monitored at each step of the query statement's execution plan and for each row processed in order to meet requirements of a near real-time query monitoring solution. Such statistics include timing information plus some miscellaneous statistics like the number of rows processed, the amount of memory used, the amount of data spilled to disk, etc.10-01-2009
20090248619SUPPORTING UNIFIED QUERYING OVER AUTONOMOUS UNSTRUCTURED AND STRUCTURED DATABASES - Methods, systems and computer products perform cost estimate to determine an efficient approach to answer a query according to one of several unified query plans. One unified query plan involves querying an unstructured database, referencing a unified index, and probing a structured database based on matches discovered in the unified index. The results of the unstructured database query are used to lookup entries in a unified index associated with the structured database. Then the structured database is probed by querying only the subset of the structured database gleaned from the unstructured database query.10-01-2009
20090138432CLINICIAN-DRIVEN EXAMPLE-BASED COMPUTER-AIDED DIAGNOSIS - Optimizing example-based computer-aided diagnosis (CADx) is accomplished by clustering volumes-of-interest (VOIs) (05-28-2009
20090063398STATISTICS COLLECTION FOR DATABASE TABLES - A method and system for collecting statistics on database tables. In one embodiment, the method includes identifying a plurality of tables for statistics collection, wherein each table of the plurality of tables are remote tables; examining at least one attribute for each table identified for statistics collection; prioritizing the tables for statistics collection based on the at least one attribute; and collecting statistics on the identified tables in a priority sequence.03-05-2009
20090063401Method and Database System for Pre-Processing an XQuery - A method of pre-processing an XQuery on a XML data base and may comprise parsing the XQuery to obtain an abstract syntax tree and typing the abstract syntax tree to provide at least one pointer into a schema for XML documents of the XML data base. The typing step may involve the use of schema and accumulated instance data of the XML data base. Use of the accumulated instance data in addition to schema data allows for reduction of the set of pointers to a smaller set, which in turn reduces the number of documents to be examined when the query is executed.03-05-2009
20090063402Method and System for Providing Medication Level Determination - Method and devices for receiving one or more of a carbohydrate amount or a blood glucose information, performing a query function to retrieve from a pre-stored lookup table an insulin dosage amount associated with the received one or more of the carbohydrate amount or blood glucose information, and outputting the retrieved insulin dosage amount are provided.03-05-2009
20090055352METHODS OF COST ESTIMATION USING PARTIALLY APPLIED PREDICATES - In accordance with aspects of the present invention, provided are methods 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.02-26-2009
20090055351DIRECT MASS STORAGE DEVICE FILE INDEXING - An arrangement for enumerating data, such as media content including music, that is stored on external hard drive-based mass storage devices is provided by a media content processing system that implements a direct mass storage device file indexing process. This file indexing process is configured for finding all files and directories on the mass storage device, and reading through those parts of the files which contain metadata (such as album name, artist name, genre, track title, track number etc.) about the file. Use of the media content processing system reduces file enumeration time by minimizing the amount of physical movement of the read/write head in the hard disk drive that is used by the mass storage device. This motion minimization is accomplished by reading the clusters of directory and file data in a sequential manner on the hard disk, rather than randomly performing such read operations.02-26-2009
20090055349TABLE ELIMINATION TECHNIQUE FOR GROUP-BY QUERY OPTIMIZATION - Techniques for optimizing queries are provided. In one technique, a query optimizer determines that two tables involved in equi-joins with one other table return unique rows. The query optimizer further determines that the rows returned by one of the tables is a subset of the rows returned by the other table. The query optimizer then determines that one of the two tables involved in the equi-joins can be eliminated. In another technique, a query optimizer determines that group-by placement may be used on a query that specifies a table. The query optimizer further determines that a view that (1) replaces the table and (2) results from the group-by placement is a subset of an existing view. The query optimizer further determines that each view is unique. The query optimizer selects an execution plan that does not join any tables or views with the resulting view or with the specified table.02-26-2009
20090083216TEMPORALLY-AWARE EVALUATIVE SCORE - A method includes processing a performance query to a dimensional data model by processing dimension coordinates that exist within the dimensional data model, wherein the dimension coordinates have a first particular grain (“finer grain”) that is finer than a second particular grain (“coarser grain”), the method to determine an evaluative score for a particular finer grain value based on performance facts for dimension coordinates associated with the particular finer grain value. Performance parameters are determined relative to a particular coarser grain value, against which to measure the performance facts associated with the finer grain value, including processing the temporal relationships of finer grain values to coarser grain values for the dimension coordinates. The evaluative score is determined for the particular finer grain value based on performance facts of dimension coordinates having the particular finer grain value, in view of the determined performance parameters.03-26-2009
20090083214KEYWORD SEARCH OVER HEAVY-TAILED DATA AND MULTI-KEYWORD QUERIES - Index structures and query processing framework that enforces a given threshold on the overhead of computing conjunctive keyword queries. This includes a keyword processing algorithm, logic to determine which indexes to materialize, and a probabilistic approach to reducing the overhead for determining which indexes to build. The index structures leverage the fact that the frequency distribution of natural-language text follows a power law. Given a document collection, a set of indexes is proposed for materialization so that the time for intersecting keywords does not exceed a given threshold Δ. When considering the associated space requirement, the additional indexes are limited. Materialization of such a set of indexes for reasonable values of Δ (e.g., the time required to scan 20% of the largest inverted index), at least for a collection of short documents is distributed by the power law.03-26-2009
20090083218Retrieving Collected Data Mapped to a Base Dictionary - A method includes defining a plurality of terms for use in conjunction with a study where the terms are stored according to a series of relations and the relations corresponding to the terms indicate an association from a term to at least one other of the plurality of terms, defining at least one group of terms taken from the plurality of terms and storing at least one group of terms, including the relations corresponding to each term, defining a further level of relations to be applied to the group of terms, the further level of relations defining inclusion and exclusion criteria, and providing a match term defined by the group of terms and querying a memory of data from the study to find occurrences of the match term as defined by the further level of relations.03-26-2009
20090083213Method and System for Fast Navigation in a Hierarchical Tree Control - A method, system, and computer program product for fast navigation in a hierarchical tree control. A user is able to navigate more efficiently to a target file, folder or other artifact by eliminating the need to individually expand on any intervening folders that are above in hierarchy to the target file or folder. Under a fast navigation mode, a fast navigation utility displays a hierarchical tree control based on one or more fast navigation display formats. The fast navigation display formats control (i) the type of content that is displayed in the hierarchical tree control and (ii) how the hierarchical tree control is visually displayed to a user.03-26-2009
20090083219SQL code generation for heterogeneous environment - This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. In one preferred embodiment, the method begins by receiving a subject query, and then forming an execution plan corresponding to the subject query. The execution plan will typically have a sequence of component snippets or pieces and corresponding processes for implementing the pieces. For at least one piece in the plan, the process then (a) generates source code using different code generation techniques as a function of expected runtime processing machine types; and then (b) compiles the generated source code to form machine executable code for implementing the subject query. As a result, the query executed directly as machine executable code thereby avoiding runtime interpretation of the pieces in the execution plan.03-26-2009
20090083217WEB ACCELERATOR APPARATUS, SYSTEM, AND METHOD - A system, apparatus, and method for accelerating display of frequently accessed slowly changing static content by causing a client having cache to actively request new content from a server and influencing caching policy at the client.03-26-2009
20090063397METHOD AND SYSTEM FOR DISJUNCTIVE SINGLE INDEX ACCESS - A method for performing disjunctive single-index access on a database is disclosed. The method includes a query engine determining whether a first OR predicate and a second OR predicate map to a shared index. Responsive to the query engine determining that the first OR predicate and the second OR predicate map to the shared index, the first OR predicate and the second OR predicate are ordered in an ascending sequence. A first range of the first OR predicate is queued. A first row of the shared index is probed for the first range of the first OR predicate. Whether the first row is disqualified by the first OR predicate is determined. Responsive to determining that the first row is not disqualified by the first OR predicate, the row is reported in a result reporting structure. Responsive to determining that the row is disqualified by the first OR predicate, whether the first range of the first OR predicate overlaps a second range of the second OR predicate is determined, and, responsive to determining that the first range of the first OR predicate overlaps the second range of the second OR predicate, the row is checked against second range of the second or predicate.03-05-2009
20090094193SECURE NORMAL FORMS - Techniques for implementing secure normal forms are provided. In one embodiment, in response to a request for data from a client, a database server is operable to enforce a column-level security policy that is defined for a particular column of some, but not necessarily all, rows of a table stored in a database. After retrieving a set of rows from the table and before returning a result set of rows to the client, the database server modifies the retrieved set of rows into the result set of rows by applying the security policy to each row of the retrieved set of rows, where applying the security policy to a row comprises: determining whether the security policy is satisfied for the particular column of that row; replacing, in the result set of rows, a data value in the particular column of that row with a security-NULL value when the security policy is not satisfied; and including the data value in the particular column of that row into the result set of rows when the security policy is satisfied. After generating the result set of rows, the database server returns the result set of rows to the client.04-09-2009
20080263001SYSTEM AND METHOD FOR AUTOMATING DATA PARTITIONING IN A PARALLEL DATABASE - A system for automating data partitioning in a parallel database includes plural nodes connected in parallel. Each node includes a database server and two databases connected thereto. Each database server includes a query optimizer. Moreover, a partitioning advisor communicates with the database server and the query optimizer. The query optimizer and the partitioning advisor include a program for recommending and evaluating data table partitions that are useful for processing a workload of query statements. The data table partitions are recommended and evaluated without requiring the data tables to be physically repartitioned.10-23-2008
20080263000UTILIZING AGGREGATED DATA - The present invention describes a method for receiving data within an aggregation facility, precalculating, and fixing a dimension of the data table. The data may be aggregated, wherein at least one data dimension remains flexible. An analytic query may be received that is associated with at least one data dimension. An analytic query may be processed by accessing the aggregated data.10-23-2008
20080262999Handling of queries of transient and persistent data - A query of a meta-object facility repository that includes transient data being modified or processed in memory and persisted data can be received. Thereafter, portions of the received query can be executed on partitions associated with the persisted data and other portions of the received query can be executed on partitions of the repository associated with the transient data to generate a combined correct query result set. Related apparatus, systems, methods, and articles are also described.10-23-2008
20080262997Information Processing Method and Information Processing System - There is provided an information processing method for managing a large amount of data by dividing the data between a plurality of processors. Each processing module holds a local information block containing a pointer arrangement containing information specifying the item value number in the order of records of the table-formatted data and a value list containing item values in the order of the item value numbers corresponding to the item values of the table-formatted data. Each processing module assigns a global order number uniquely determined between a plurality of processing modules to the record of the table-formatted data in the local processing module, compares the value list of the local processing module to the value list of the other processing module, and assigns a global item value number uniquely determined between the processing modules to the item value of the value list of the local processing module.10-23-2008
20090006320Runtime Semantic Query Optimization for Event Stream Processing - Systems and method are disclosed for applying a query to an event stream by storing one or more event constraints; performing constraint aware complex event processing on the query and the event constraints; and optimizing the query at run time.01-01-2009
20090006318Multi-source data visualization system - In one general aspect, the application discloses a data visualization method in which at least two retrieved data tables are associated based on a selection of at least one common field. A visualization is displayed for data from a first of the tables and input for query devices is received to filter data for a second of the tables. The displayed visualization for the first table can then be updated in response to the received query device input for the second table based on the created association.01-01-2009
20090204569METHOD AND SYSTEM FOR IDENTIFYING COMPANIES WITH SPECIFIC BUSINESS OBJECTIVES - A method for identifying companies with specific business objectives that includes using existing sources of company firmographic data to identify a broad set of companies and associated websites, crawling the websites associated with the identified companies and indexing web site content for each of the identified companies with the specific business objective to realize indexed web content. The method further includes joining the company firmographic data with the indexed web content using a business objective common identifier to generate a store of joined structured firmographic data and indexed web content and presenting a display image representation of the store of joined structured firmographic data and indexed web content for user review. The display image further receives user input to score each of said companies identified therein, and using a search interface, querying the store of scored, joined structured firmographic data and indexed web content. The method further includes augmenting the search interface, or search results from a query, with predictive, machine-leaning processes that allow rapid identification of companies possibly missed in the query.08-13-2009
20090006321SYSTEM AND METHODS FOR THE AUTOMATIC TRANSMISSION OF NEW, HIGH AFFINITY MEDIA - A system and methods for the automatic transmission of new, high affinity media to a user are provided. In connection with a system that convergently merges perceptual and digital signal processing analysis of media entities for purposes of classifying the media entities, various means are provided to a user for automatically extracting media entities that represent a high (or low) affinity state/space for the user in connection with the generation of a high affinity playlist, channel or station. Techniques for providing a dynamic recommendation engine and techniques for rating media entities are also included are also included. Once a high affinity state/space is identified, the high affinity state/space may be persisted for the user from experience to experience.01-01-2009
20090222406Method for indexing, searching and retrieving patient information from a picture archive and communications system - The present invention is a centrally deployed, computer-based system for uniquely indexing and searching a picture archiving and communications system (PACS) or other like device. This system and method uses a LAN, WAN or global communication system, e.g., the Internet, to acquire, analyze, index, search and retrieve medically relevant facts about all patients requested by the user interacting with a PACS system. The central deployed, computer-based system of the present invention has various components that will i) increase the efficiency of a users ability to find health care related data while also improving the quality of care to individual patients; and ii) solves the problem associated with relative inaccessibility caused by storing large amounts of data on patients with various diseases within a PACS, a clear weakness of the current picture archiving and communications systems.09-03-2009
20090106190Support For User Defined Functions In A Data Stream Management System - A data stream management system (DSMS) is designed to support a new user-defined function, by creating and using at least two structures as follows. A first structure (“metadata entry”) is created in response to a command for creation of the new function, and maps a single instance of a class to the function's name. A second structure is created with creation of an operator on receipt of each new continuous query that uses the new function. The second structure (“operator specific data structure”) contains a path to the newly-created instance, which path is obtained by looking up the first structure. Additional second structures are created on receipt of additional continuous queries which use the new function, but all second structures contain the same path. All continuous queries use the same instance. Repeated use of a single instance to compile and execute multiple queries eliminates repeated instantiation of the same function.04-23-2009
20090106191SEARCH CENTER DYNAMIC CONFIGURATION USING FIELD MAPPINGS - A mechanism for dynamically configuring searchable fields of interest within a search provided. A field mappings file is used to define relationships between searchable interest in searchable objects and fields within a search index accessible to an se-wide search center. The field mappings file can provide the defined relationships searchable object fields and search index fields at runtime of a user session, thus a rigid configuration at the time of search center initialization.04-23-2009
20090106189Dynamically Sharing A Subtree Of Operators In A Data Stream Management System Operating On Existing Queries - A new continuous query to a data stream management system (DSMS) may use several operators that are equivalent to operators currently being used by continuous queries that have been previously registered in the DSMS. To determine equivalence of operators, the DSMS checks at least the function and the data input to the operators. On finding equivalence, the DSMS modifies a global plan being executed, to use at least an existing subtree of operators during execution of the new continuous query, to generate a modified plan. The DSMS is also programmed to cause each relation source operator (which outputs a relation) to propagate a current state of the relation to each operator newly coupled to the relational operator. After propagation of current state to newly-coupled operators, each operator in the modified plan processes any new data and supplies the result to all operators coupled thereto, including newly-coupled operators and existing operators.04-23-2009
20090204570METHOD AND APPARATUS FOR PERFORMING MULTI-STAGE TABLE UPDATES - One embodiment of the present invention provides a system that facilitates performing multi-stage table updates. During operation, the system receives a query at a query processor, wherein executing the query causes an update to an entire table in a database. Next, the system estimates an amount of transaction log space required to execute the query. If the amount of transaction log space is greater than a pre-determined threshold, the system splits the query into a set of sub-queries, wherein an amount of transaction log space required by each sub-query in the set of sub-queries is less than the pre-determined threshold. For each sub-query in the set of sub-queries, the system executes the sub-query, and performs a mini-commit operation for the sub-query, wherein updates which comprise the mini-commit operation are not exposed to a user. Finally, when mini-commit operations have been performed for all of the sub-queries, the system performs a commit operation for the query.08-13-2009
20090216710OPTIMIZING QUERY REWRITES FOR KEYWORD-BASED ADVERTISING - A system and method are disclosed for rewriting queries. The queries may be rewritten and evaluated based on an end benefit, such as an optimum advertising benefit. Queries may be associated with advertisements and the benefit of those advertisements may be used in selecting query rewrites for an original user query. Multiple query rewrites from various techniques may be analyzed to generate a subset of query rewrites that are optimized for a particular benefit.08-27-2009
20090222407INFORMATION SEARCH SYSTEM, METHOD AND PROGRAM - A system, method and computer program product for searching at high speed for documents matching a dependency pattern from document data containing a large volume of text documents. The system includes a storage device for storing, index storage means for storing in the storage device occurrence information, receiving means for receiving information, reading means for reading from the index storage means, and searching means for comparing occurrence information. The method and computer program product include the steps of storing in the storage device, receiving information, reading from the storage device, comparing occurrence information, and searching. The computer program product includes instructions to execute the steps of storing each of the plurality of document data in the storage device, storing in the storage device occurrence information.09-03-2009
20090222405DYNAMIC PROFILE SYSTEM FOR RESOURCE ACCESS CONTROL - A dynamic profiling system (DPS) provides dynamic access session configuration for telecommunications subscribers, and provides subscriber session information to application platforms. The DPS configuration adapts to meet the needs of any combination of user connection requests, access channel devices, and access channels used to communicate connection requests. The DPS provides an aggregated view of user session information to efficiently and effectively provide services to subscribers. As the many different access channels (e.g., WiFi, ATM, Ethernet and DSL access) continue to grow through which a subscriber connects to services, the dynamic profiling system also eliminates the inefficient proliferation of custom interfaces between the many support systems and applications that need access to subscriber profile and session configuration information. The DPS provides a universal and personalized access to telecommunications services. Provisioned services may be accessed by many different access channels based upon static and dynamically maintained information in the subscriber profile and the access channel used, respectively.09-03-2009
20090222404QUERYING NONSQL DATA STORES WITH A SQL-STYLE LANGUAGE - A nonSQL index containing data associated with a social networking network is queried with a nonSQL query generated from a SQL query. A query translation component parses the SQL query for query parameters specifying requested data and identifies a type of the nonSQL index based on the nonSQL index. The query translation component generates a nonSQL query based on the query parameters and the type of nonSQL index and queries the nonSQL index with the generated nonSQL query to search for the requested data. The query translation component receives a nonSQL result set from the nonSQL index based on the nonSQL query and then transforms the nonSQL result set into a SQL result set based on the type of nonSQL index and the received SQL query.09-03-2009
20090254518Methods and systems for joining database tables using indexing data structures - A method for identifying joined rows in a database comprising a plurality of tables. The method comprises selecting a group of tables directly or indirectly joined with each other, selecting an order of the group based on relationships among the tables, generating an intermediate data structure which identifies the group of tables, a number of virtual tables equal to one less than the number of tables in the group, and an indication of an adjacent table, and a common table and key for at least some of the group of tables and the virtual tables, generating indexing data structures for the group of tables and virtual tables, and, inserting information from rows of the group of tables into the indexing data structures using the intermediate data structure. The indexing data structure for one virtual table indicates which of the rows of the tables have common data elements.10-08-2009
20090254516ACCESSING DATA IN A COLUMN STORE DATABASE BASED ON HARDWARE COMPATIBLE INDEXING AND REPLICATED REORDERED COLUMNS - Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.10-08-2009
20090254513METHOD, APPARATUS AND COMPUTER PROGRAM PRODUCT FOR PERFORMING A QUERY USING A DECISION DIAGRAM - A method, apparatus and computer program product are provided for performing a query using a decision diagram. In this regard, in response to receiving a query instruction a compression value for a query result decision diagram can be determined. A compression value for a compressed query result set may also be determined. A compression ratio can be determined between the compression value for the query result decision diagram and the compression value for a compressed query result set. A query result decision diagram may be generated based on the query instruction and a relationship between the compression ratio and a threshold ratio. The query result decision diagram may also be transmitted based upon a relationship between the compression ratio and a threshold ratio.10-08-2009
20090254512AD MATCHING BY AUGMENTING A SEARCH QUERY WITH KNOWLEDGE OBTAINED THROUGH SEARCH ENGINE RESULTS - A method is provided to match an advertisement to a search query comprising: receiving search results produced by a search engine in response to a search query; producing an ad query that includes, unigram features, classification features with respect to an external classification system, and phrase features; producing a plurality of representations of corresponding advertisements in terms of the same types of features; and selecting one or more advertisements based upon a measure of similarity of ad query features to advertisements represented in terms of the same features.10-08-2009
20090254515SYSTEM AND METHOD FOR PRESENTING GALLERY RENDITIONS THAT ARE IDENTIFIED FROM A NETWORK - A presentation system provided for use on a network. The presentation system includes an index and one or more modules. The index that stores gallery information, the gallery including (i) information that identifies a plurality of galleries, and (ii) data corresponding to renditions of individual media objects that comprise at least a portion of each of the plurality of galleries. The one or more modules may be configured to (i) receive a selection criteria, (ii) use the selection criteria to identify, from the index, one or more galleries from the index, and (iii) generate a presentation that includes renditions of at least some of the plurality of media objects that comprise the identified one or more galleries.10-08-2009
20090240655Bit String Seacrching Apparatus, Searching Method, and Program - A bit string searching apparatus has a coupled node tree, having a root node and a node pair, the node pair being a branch node and leaf node, or a pair of branch nodes, or a pair of leaf nodes in adjacent storage areas, the branch node including a search key discrimination bit position and information indicating a position of one node of a node pair of a link target, and the leaf node including an index key that is a bit string that is the target of a search, wherein a search for an index key from the root node to a branch node using a search key is executed by repeatedly and successively linking to one node of a node pair of a link target, according to a bit value of a search key at the discrimination bit position in the branch node, until reaching the leaf node.09-24-2009
20090132471Dynamic query and step routing between systems tuned for different objectives - A computer-implemented apparatus, method, and article of manufacture manage a plurality of database systems. A domain includes a plurality of database systems. Each of the database systems is tuned for a particular type of workload. A virtual regulator (or multiple virtual regulators running in parallel) manages the domain and routes a set of one or more queries to a particular database system within the domain based on a cost function for each database system.05-21-2009
20090259618SLICING OF RELATIONAL DATABASES - A method and a processing device may be provided for creating a shadow database, having a size being approximately a desired percentage of a size of a relational database. Referential integrity of tables of the relational database may be preserved in the created shadow database. A representation of a connected graph may be created, based on a schema description of the relational database, and may be used to find driving tables and related tables of the relational database. Portions of driving tables of the relational database may be copied to corresponding tables of the shadow database and rows of tables of the relational database, related to the copied portions of the driving tables, may be copied to corresponding tables of the shadow database in a number of iterations until the size of the shadow database is approximately the desired percentage of the size of the relational database.10-15-2009
20090276394OBTAINING A PLAN FOR EXECUTING A QUERY IN A RELATIONAL DATABASE - A plan for executing a query in a relational database is obtained. A query for accessing data in the relational database is received. The query specifies N tables in the relational database from which data is to be retrieved. A determination is made whether a syntax of the query matches a syntax of a plan in a plan cache for executing the query. Matches are identified between generic table formats of the N tables specified in the query to generic table formats of N tables specified in the plan responsive to the syntax of the query matching the syntax of a plan in the plan cache for executing the query. The plan for executing the query is obtained based on whether the syntax of the query matches the syntax of the plan and based on identified matches between the generic table formats of the N tables specified in the query to the generic table formats of the N tables specified in the plan.11-05-2009
20090276396SYSTEMS AND METHODS FOR NATURAL LANGUAGE COMMUNICATION WITH A COMPUTER - A system for natural language communication with a computer, comprising a database configures to store at least one table the table configured to store associations between concepts in a text string and associated concept identifiers; and a builder interfaced with the database, the builder configured to construct a concept defined by a text string by performing a process comprising the following steps: assigning a unique identifier to the concept, breaking the concept into sub-concepts, assigning a unique identifier to each sub-concept, using legal joins to join cub-concepts into higher order sub-concepts, assigning a unique identifier to the higher-order concepts, and repeating the steps until the higher order sub-concepts join to form the concept, and storing the concept, sub-concepts, higher order sub-concepts and unique identifiers in a table in the database.11-05-2009
20080306907REDUNDANT VERSION INFORMATION IN HISTORY TABLE THAT ENABLES EFFICIENT SNAPSHOT QUERYING - A system for efficient snapshot querying include: providing a first version value for each data in a history table, where the first version value indicates a beginning of a period in which the data is valid; providing at least a second version value for each data in the history table, where the second version value indicates an end of the period in which the data is valid; receiving a request for a version of a database; and retrieving the data with the first version value less than or equal to the requested version and the second version value greater than or equal to the requested version. By maintaining a history table with redundant version information, the system is able to provide efficient snapshot querying while also avoiding the overhead burden of conventional approaches. No aggregates, joins, or sub-queries are required to retrieve a snapshot.12-11-2008
20080306906SYSTEM FOR AGGREGATION SUBQUERY JOIN ELIMINATION - A system for use with an information retrieval system, in which system is used for transforming a database statement containing a first subquery and a second subquery joined together, the first subquery including a group by operation over a child subquery, the information retrieval system comprising means for removing the first subquery from the database statement thereby eliminating the join between the first subquery and the second subquery.12-11-2008
20080306904SYSTEM, METHOD, AND PROGRAM PRODUCT FOR INTEGRATING DATABASES - A system for integrating databases comprises a first virtual table, a second virtual table, a common table, a list, a generating section, and a selecting section. The first virtual table corresponds to a first data. The second virtual table corresponds to a second data. The common table is associated with the first and second virtual tables. The list indicates information about associations between the first and second virtual tables and the common table. The generating section generates two or more access plans from a database query on the common table. The two or more access plans involve at least one of the first and second virtual tables in accordance with the list. The selecting section selects one of the two or more access plans generated by the generating section to be used to execute the database query.12-11-2008
20090112798COMPUTER SYSTEM AND METHOD FOR REDUCING POWER CONSUMPTION OF STORAGE SYSTEM - A disk rotation control part for controlling the rotations of a plurality of disk devices is provided. The configuration is such that a disk of a disk device for which an access will not be generated is rotated at a second rate of speed, which is faster than 0, and slower than a first rate of speed, which is the rotation speed at access time. DB management information comprises information denoting which DB schema inside a DB is stored in which location. The disk rotation control part, based on a query plan of a query received by the DBMS, and DB management information, specifies the storage location of a DB schema to be accessed when this query is processed, and rotates a disk of the disk device comprising the specified storage location at a first rate of speed.04-30-2009
20080215539DATA ORDERING FOR DERIVED COLUMNS IN A DATABASE SYSTEM - Optimized query execution is disclosed for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data.09-04-2008
20080215537DATA ORDERING FOR DERIVED COLUMNS IN A DATABASE SYSTEM - Optimized query execution for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data.09-04-2008
20080215535AUTONOMICALLY GENERATING A QUERY IMPLEMENTATION THAT MEETS A DEFINED PERFORMANCE SPECIFICATION - A database query optimizer allows specifying a performance specification for a query. When an access plan is created, the actual performance for executing the query using the access plan is determined and compared to the performance specification for the query. If the actual performance does not satisfy the performance specification for the query, the query optimizer autonomically generates a different access plan to see if the performance improves. If an access plan that meets the performance specification is generated, the new access plan is stored in the access plan cache for the query. If no access plan can be generated that meets the performance specification for the query, the access plan that provided the best performance is selected and stored in the access plan cache for the query.09-04-2008
20080215534COST-BASED SUBQUERY CORRELATION AND DECORRELATION - Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.09-04-2008
20080215531DETERMINING VALIDITY RANGES OF QUERY PLANS BASED ON SUBOPTIMALITY - A method for approximating a validity range for a domain of cardinalities of input to an optimal query plan is provided. Such a validity range is iteratively approximated using a modified Newton-Raphson method to find roots of cost functions for optimal and alternative query plans, respectively. The Newton-Raphson method is combined with a method of incrementing roots of cost functions, known as input cardinalities, such that discontinuous and non-differentiable points in cost functions are avoided. In this manner, input cardinalities remain within a domain for which a valid range can be specified. Additionally, a robustness measure is determined by a sensitivity analysis performed on an approximated validity range. Using a robustness measure provided by a sensitivity analysis and resultant validity range and, query plan sub-optimality detection is simplified, re-optimization is selectively triggered, and robustness information is provided to a system or user performing corrective actions.09-04-2008
20090100003Method, Apparatus and Computer Program Product for Enabling Access to a Dynamic Attribute Associated with a Service Point - An apparatus for enabling a user to access a dynamic attribute associated with a service point may include a processing element. The processing element may be configured to receive an indication of a dynamic attribute associated with a service point having a particular geographic location, indicate an availability of the dynamic attribute to a user, and enable the user to access the dynamic attribute in response to a user selection. The dynamic attribute may be provided from a mobile content source proximate to the particular geographic location.04-16-2009
20090171888DATA DEDUPLICATION BY SEPARATING DATA FROM META DATA - Provided are techniques for data deduplication. A chunk of data and a mapping of boundaries between file data and meta data in the chunk of data are received. The mapping is used to split the chunk of data into a file data stream and a meta data stream and to store file data from the file data stream in a first file and to store meta data from the meta data stream in a second file, wherein the first file and the second file are separate files. The file data in the first file is deduplicated.07-02-2009
20090077019FLEXIBLE ACCESS OF DATA STORED IN A DATABASE - A system and computer readable medium for processing a request to retrieve data from a database is disclosed. The system and computer readable medium of the present invention comprises receiving the request which comprises a function that processes at least one data item specified in the request, retrieving the at least one data item from a database, and invoking the function. When the function is invoked, at least one parameter comprising information related to the at least one data item is passed to the function. Thus, a function can be written independently of the data which they are called to process.03-19-2009
20090077017SQL PERFORMANCE ANALYZER - Techniques are provided for analyzing performance differences for a set of database query language statements on two different database systems. The performance analysis is based on quantitative measurements and estimates of the execution of the set of database query language statements on the two different database systems. This performance analysis process may be used by database administrators to predict impacts to performance due to a change in a database system.03-19-2009
20090077018SYSTEM AND METHOD OF HANDLING FILE METADATA - A network storage system comprises data storage, one or more file system APIs, and a metadata handler. The data storage can comprise file data and associated metadata. The file system APIs can be configured to read and write file data and metadata to and from the data storage. The metadata handler can have a library of functions for handling the metadata. The library can include a metadata blob creation function and a metadata blob extraction function. The metadata blob creation function cooperates with the file system APIs to read source metadata associated with specified file data and creates and populates a metadata blob from which a substantial copy of the source metadata can be generated. The metadata blob extraction function receives at least a metadata blob, extracts information from the metadata blob, and cooperates with the file system APIs to generate destination metadata, a substantial copy of the source metadata.03-19-2009
20090077015SYSTEM AND METHOD FOR IMPLEMENTING COMPOSITE APPLICATIONS - A software and/or hardware facility for implementing composite applications. The facility includes a composite application designer that enables users to create and modify composite applications. A composite application can include data from primary assets, as well as data from derived assets, which are assets that are derived from one or more primary assets. The composite application designer also enables the creation of configuration files for configuring access to data corresponding to primary and derived assets. The facility also includes a data access service that enables access to data corresponding to primary and derived assets. The data access service is configured by a configuration file that is created by the composite application designer.03-19-2009
20090077013METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR USER-DRIVEN TARGETED QUERY RE-OPTIMIZATIONS USING DELTA VALUES - A method, system, and computer program product for user-driven targeted query re-optimizations using delta values are provided. The method includes displaying a query tree for a query via a graphical user interface (GUI), where the query tree includes a plurality of interconnected nodes in a tree structure, and outputting a delta value as a difference between an estimated and an actual performance metric of query execution. The method also includes receiving a request to provide alternative execution plans for a subtree of a selected node of the query tree, and displaying at least one alternative execution plan description for the subtree of the selected node. The method further includes receiving a re-optimization request for a user selected alternative execution plan description, and displaying a re-optimized query tree resulting from the re-optimization request.03-19-2009
20090077014DATA MAPPING DOCUMENT DESIGN SYSTEM - A data mapping document design system provides a market differentiator that facilitates creating the technical specification for migrating legacy databases. The system addresses the significant technical problems associated with the immensely labor intensive, complex, and error prone endeavor of manually creating the technical specification. The system not only achieves cost and time savings in clearly measurable aspects of data migration such as migration project cost and completion timelines, but also achieves improvements in other harder to measure and track areas, such as data quality, and achieves reductions in subsequently discovered data errors.03-19-2009
20090077012DISPLAYING RELEVANT ABSTRACT DATABASE ELEMENTS - Embodiments of the invention enable users of an abstract database to use logical fields that are relevant to a given model entity. In one embodiment, a user may be presented with a query interface that includes relevant fields, and which may be used to compose abstract queries. In another embodiment, the query interface may include an initial query result, and may include relevant fields for model entities included in the initial query result. The query interface may be configured to enable a user to perform subsequent query operations using the included relevant fields.03-19-2009
20090077011SYSTEM AND METHOD FOR EXECUTING COMPUTE-INTENSIVE DATABASE USER-DEFINED PROGRAMS ON AN ATTACHED HIGH-PERFORMANCE PARALLEL COMPUTER - The invention pertains to a system and method for dispatching and executing the compute-intensive parts of the workflow for database queries on an attached high-performance, parallel computing platform. The performance overhead for moving the required data and results between the database platform and the high-performance computing platform where the workload is executed is amortized in several ways, for example, 03-19-2009
20090077010Optimization of Database Queries Including Grouped Aggregation Functions - Embodiments of the invention provide techniques for generating predicted cardinality statistics for grouped aggregation functions included in database queries. In general, characteristics of a database query are determined, and are then supplied to a probability function configured to generate a predicted cardinality statistic. The generated statistic represents a prediction of the probable cardinality of the results of a grouped aggregation function in the event that the query is executed. The predicted cardinality statistic may be used by a query optimizer to determine an efficient query plan for executing the database query.03-19-2009
20090292668SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR PARTIAL REDISTRIBUTION, PARTIAL DUPLICATION OF ROWS OF PARALLEL JOIN OPERATION ON SKEWED DATA - A system, method, and computer-readable medium that facilitate management of data skew during a parallel join operation are provided. Portions of tables involved in the join operation are distributed among a plurality of processing modules, and each of the processing modules is provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules scans the rows of the tables distributed to the processing modules and compares values of the join columns of both tables with the list of skewed values. Rows of the larger table having non-skewed values in the join column are redistributed, and rows of the larger table having skewed values in the join column are maintained locally at the processing modules. Rows of the smaller table that have non-skewed values in the join column are redistributed, and rows of the smaller table that have skewed values in the join column are duplicated among the processing modules.11-26-2009
20090259617Method And System For Data Management - The invention provides a method, a system and a computer program product for managing the data of Electronic Design Automation (EDA) tools in data processing units. This data is managed by a database management system. Data entries that are added to a database are sorted, compressed and stored. These data entries can be easily retrieved from the database that is based on a retrieval key.10-15-2009
20090287639Embedding Densities in a Data Structure - A method, apparatus and program product that determine a density for each key value of a plurality of key values in a table over at least one range of rows in the database table, and store the determined densities in a data structure for use in optimizing a query that references a key value in the plurality of key values in the table. By doing so, the density of various key values may be determined and dynamically maintained, often resulting in optimization data for improved query optimization.11-19-2009
20090276395QUERY OPTIMIZATION IN A MULTI-TENANT DATABASE SYSTEM - More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.11-05-2009
20090177622Method and system for speeding up rebuild of user-defined indexes during partition maintenance operations in the database systems - A method, system, and computer program product provides improved performance for rebuild of user-defined indexes during partition maintenance operations (partition split, merge, and move). A method of maintaining a index of a partitioned database table comprises performing a partition maintenance operation on the partitioned database table wherein a plurality of rows of the partitioned database table are moved from one partition to another, storing mapping information for at least some of the plurality of moved rows, including an old mapping for each of the moved rows and a corresponding new mapping for each of the moved rows, and when rebuilding the index, replacing an old mapping in the index for each of the plurality of moved rows with the corresponding stored new mapping for each of the plurality of moved rows.07-09-2009
20090319477PERFORMING COST-BASED OPTIMIZATIONS OF AUTHORIZATION CHECKS IN DATABASE SYSTEMS - One embodiment of the present invention provides a system that facilitates performing a cost-based optimization of authorization checks in a database system. During operation, the system receives a query at the database system. Next, the system estimates a cost for executing the query, which involves estimating a cost for evaluating authorization checks, which involve functional evaluations of access rights for data accessed by the query. The system then rewrites the query to include evaluating authorization checks within the query. The system also estimates a cost for executing the rewritten query. Next, the system determines if executing the rewritten query has a lower cost than executing the query and performing the authorization checks. If so, the system executes the rewritten query. However, if not, the system executes the query.12-24-2009
20090319473METHOD AND SYSTEM OF USING A LOCAL HOSTED CACHE AND CRYPTOGRAPHIC HASH FUNCTIONS TO REDUCE NETWORK TRAFFIC - The described method and system enables a client at a branch office to retrieve data from a local hosted cache instead of an application server over a WAN to improve latency and reduce overall WAN traffic. A server at the data center may be adapted to provide either a list of hashes or the requested data based on whether a hosted cache system is enabled. A hosted cache at the client side may provide the data to the client based on the hashes. The hashes may be generated to provide a fingerprint of the data which may be used to index the data in an efficient manner.12-24-2009
20090006319Data visualization system with axis binding - In one general aspect, the application discloses a data visualization method that includes accessing data tables and receiving an axis binding definition for a particular visualization that relates values in a first of the tables to sets of fields in a second of the tables. A marking indication can then be received that selects one of the values in the first of the tables, and a set of fields in the second table is accessed based on the marking indication and the axis binding definition. This accessed set of fields is presented in the particular visualization for which the axis binding definition was received.01-01-2009
20080313132HIGH ACCURACY BLOOM FILTER USING PARTITIONED HASHING - A method and system for generating a bloom filter by mapping into respective groups each of a plurality of initial keys according to a first hash function and mapping each group hashed key into a bloom filter using k respective hash functions.12-18-2008
20090182706Generating Example Data for Testing Database Queries - Computer-implemented methods, modules and clients relate to expanded, pruned sample table for testing database queries against a base table. The expanded, pruned sample table is formed from the base table by a process of initial sampling, synthesis, and pruning.07-16-2009
20090319476ADAPTIVE MATERIALIZED VIEW SELECTION FOR DATABASES - Techniques described herein adaptively select materialized view fragments for persistent maintenance. During an interval of time, the selected fragments are persistently maintained in the database system, while the other non-selected fragments are not persistently maintained as materialized view fragments. Over time, the composition of the set of selected fragments may change. As queries are executed in the database system over an interval of time, statistics including the frequency of access of each currently selected fragment during that interval are generated. At the start of the next interval of time, based on these statistics, some currently selected fragments may be unselected. Some currently non-selected fragments of one or more candidate materialized views may be selected based on the statistics. For the next interval, the newly unselected fragments cease to be persistently maintained as materialized view fragments, while the newly selected fragments begin to be persistently maintained as materialized view fragments.12-24-2009
20090319475Grouping Predicted Database Queries - Embodiments of the invention provide techniques for aggregating database queries for energy efficiency. In one embodiment, queries received by a DBMS are aggregated and staged according to hard-disk drives required for query execution. Each group of queries accessing a given drive may be dispatched for execution together. Further, the queries received by a DBMS may be matched to patterns of previously received queries. The matching patterns may be used to predict other queries which are likely to be received by the DBMS. The received queries may be staged to be dispatched with the predicted queries. By aggregating queries to be executed, access to each hard-disk drive may be optimized, thus reducing the overall energy consumption required for executing the queries.12-24-2009
20090319472EVENT BASED ORGANIZATION AND ACCESS OF DIGITAL PHOTOS - Architecture and its implementation of an event-based media management system and method are disclosed. A generic model for events is used for developing architecture for media management, called Eventcentric Media Management (EMMa) system. The system focuses on event experiences and provides flexible functionality for media management. The system and method analyze cross-media files for features to extract atomic events and apply algorithms to cluster files including similar or related features. Thus, the EMMa system allows unified media indexing of multiple media types, better abstraction of the real world, use of context, media processing operations to compute and store features and tags, and a more intuitive support for multiple users. It provides environments for querying and browsing media related to events and authoring of multimedia presentations for sharing with other individuals.12-24-2009
20090112792Generating Statistics for Optimizing Database Queries Containing User-Defined Functions - Embodiments of the invention provide techniques for generating statistics for optimizing database queries containing user-defined functions (UDFs). In general, the statistics may be generated based on output values produced during past executions of a UDF. The statistics may also be generated based on input values received during past executions of the UDF. Additionally, the statistics may include input and output value pairs, such that a UDF output may be determined based on a UDF input. The generated statistics may be used by a query optimizer to determine an efficient query plan for executing the database query.04-30-2009
20080281780Query Directives And Access Plan Hints - A query plan modification system and method relate to a database system that includes a cost-based optimizer for generating access plans. The database system also permits a user to view an access plan that has been generated by a particular SQL query and modify the access plan if desired. The user specifies customizations that are associated with the access plan so that when that plan is executed, the customizations are executed as well. Exemplary customizations include specifying an initialization file specific to a query, specifying different implementation methods than those in the original access plan, prohibiting rebuilding of an access plan, and over-riding or ignoring a clause within the query that is used to generate the access plan.11-13-2008
20090112797LOGICAL STRUCTURE ANALYZING APPARATUS, METHOD, AND COMPUTER PRODUCT - A logical structure analyzing apparatus includes an extracting unit that extracts word candidates from a form, a first generating unit that classifies each of the word candidates into a group of heading candidates or a group of data candidates to generate, based on positions of the word candidates on the form, first candidate sets each including one heading candidate and one data candidate identifiable by the heading candidate, and a second generating unit that combines the first candidate sets to generate second candidate sets that each include plural heading candidates that differ and one data candidate. The apparatus also includes a removing unit that, based on positions of the heading candidates and the data word candidate in each second candidate set, removes from among the second candidate sets, a determined set including a data item and headings identifying the data item, and an output unit that outputs the determined set.04-30-2009
20090112795Query statistics - Systems, methods, and other embodiments associated with selectively acquiring and utilizing query statistics are described. One example method includes selectively acquiring statistics associated with search queries submitted to a search process during a sample period. The statistics may be associated with an index and tokens associated with the index and search queries. The method may also include selecting tokens and/or queries to optimize based, at least in part, on the statistics. In one example, whether and/or how the tokens and/or queries are optimized may depend on estimating index fragmentation based, at least in part, on the statistics.04-30-2009
20090112793TECHNIQUES FOR BUSHY TREE EXECUTION PLANS FOR SNOWSTORM SCHEMA - Methods for transforming a query to simulate a bushy tree execution plan for queries containing joins in series are provided. Left deep tree execution plans are supported by most relational database systems but are inefficient at processing queries directed to databases with snowstorm schema. A snowstorm schema contains several large fact tables and many smaller dimension tables, which make reference to one another. Bushy tree execution plans can be much more efficient for processing queries to snowstorm schema. The decision to choose between left-deep and bushy tree execution plans are based on the relative costs of the two execution plans. The methods provided transform queries which are otherwise executed with left deep tree execution plans into queries which are executed with simulated bushy tree execution plans.04-30-2009
20080270343PROCESSING DATABASE QUERIES EMBEDDED IN APPLICATION SOURCE CODE FROM WITHIN INTEGRATED DEVELOPMENT ENVIRONMENT TOOL - Embodiments of the invention provide database integration within an integrated development environment (IDE) tool for displaying database structure and other database information, query editing and execution, and error detection for database statements embedded in program source code. Embodiments of the invention integrate database connectivity and error detection into the IDE tool, thereby potentially reducing the time required for database-aware application development.10-30-2008
20080228707Encoding and Decoding Data System and Method - A system and method for encoding and decoding data. A method includes selecting a subgroup of bits from one or more bytes of binary encrypted information, wherein the binary encrypted information is for tracking, locating, and disabling an electronic device; passing the subgroup of bits to an encoding function that performs binary mapping operations on the subgroup of bits to generate an encoded byte; and encoding the next one or more bytes of binary encrypted information if the end of the binary encrypted information has not been reached.09-18-2008
20090070288METHOD AND SYSTEM FOR UPDATING DOCUMENT CONTENT AND METADATA VIA PLUG-IN CHAINING IN A CONTENT MANAGEMENT SYSTEM - Embodiments of the invention provide a method for managing and updating documents containing specialized content in a content management system (CMS) by chaining plug-ins. Rather than create a unique rule for each specialized scenario, a CMS may be configured to apply a plug-in chain in an order based upon a type of document encountered and/or configured criteria.03-12-2009
20090037371EFFICIENT STORAGE AND SEARCH OF WORD LISTS AND OTHER TEXT - A computer readable storage medium tangibly embodying machine-readable digital data arranged to facilitate expedited searching. The data includes a plurality of words residing in a table having rows and columns, each word residing in a different row and each letter of the word occupying a different column in that row. Each continuous run of same letters in a column forms an interval. The words are positioned relative to each other to maximize lengths of the intervals, and/or optimize efficiency of compression of the columns by run length encoding.02-05-2009
20090037370DISTRIBUTED EVENT PROCESSING - Methods and systems for distributed event processing are disclosed. In one embodiment, a system for distributed event processing includes a first event processor and a second event processor. The first event processor receives event data associated with an event stream. The second event processor receives a query associated with the event stream. A request to the first event processor is generated by the second event processor based on the query for a first portion of event data associated with the event stream. The second event processor receives the first portion of event data from the first event processor. The second event processor then generates an event based on the first portion of event data.02-05-2009
20090037372CREATING PROFILING INDICES - A database engine and optimizer framework support creation of a series of profiling indices over a column having character string data, such as a traditional “varchar” data type. The profiling indices result in a reduction of the number of records that are searched when searching for a sub-string match within that column. In some embodiments, the series of indices are created over a column that is typically searched using the LIKE predicate or some similar technique; these indices indicate for each record whether certain sub-strings may exist in that record's value in the column. Thus, the indices are used to find the rows that may match one or more portions of the particular term being queried or, in other words, eliminate those records that do not have at least a portion of the term to be matched. The number of records actually retrieved and searched for the query sub-string is thereby reduced.02-05-2009
20080288442Ontology Based Text Indexing - A method and system are disclosed for indexing a set of statements, such as RDF statements, that are described in accordance with a specified ontology. The method comprises the steps of defining a set of indexing rules, and using these indexing rules to examine the statements to identify selected ones of the statements and to generate one or more indices from said selected ones of the statements. In a preferred embodiment, the rules match certain predicates of RDF statements to certain indices. Also, preferably, an RDF storage system may be configured with said set of indexing rules. When RDF statements are added to the RDF storage system, each statement is examined by the indexing subsystem. If the predicate of a statement matches one of the predicates of said set of indexing rules, that rule is applied to the statement.11-20-2008
20090006314INDEX EXPLOITATION - Various embodiments of a computer-implemented method, computer program product, and data processing system are provided that generate an index plan that produces a superset of data comprising the query result. In some embodiments, a computer-implemented method, computer program product, and data processing system produce a maximal-index-satisfiable query tree.01-01-2009
20090043730Methods and Apparatus for Improving Data Warehouse Performance - Methods and apparatus for improving data warehouse performance are disclosed. An example method to format data received from a data warehouse includes receiving an analysis instruction, retrieving data from the data warehouse based on the analysis instruction, and associating a mapping file with a fact table, the mapping file stored in a first hierarchical directory file path.02-12-2009
20080249981SYSTEMS AND METHODS FOR FEDERATING DATA - The system and method federates relational and non-relational data by business users creating a virtual relational map of unrelated data in disparate systems. The method uses a declarative language to capture data relationships. As the relationships are built, it captures a virtual relational data map of all the data existing in multiple disparate systems. This virtual map can be viewed as a relational database of enterprise data, further new relationships can be added and existing relationships can be modified. The method supports any business client (user interface or programmatic) that has knowledge of how to modify the virtual relationship map or request for federated data. The map of relationships itself can be constructed and modified by users as they are working with the system unlike traditional techniques where relationships need to be predefined and likewise, new changes and additions to the map are made available to users immediately in real-time.10-09-2008
20090100006INDEX CREATING METHOD BY CREATING/INTEGRATING NODE - There is provided a method of creating an index, which is executed in a document retrieval apparatus. The index includes index information and a trie, the index information includes an index item formed of a character string, the trie is formed of a plurality of nodes each including a part of the character string of the index item, and the index information and each of the plurality of nodes of the trie are associated with each other. The method comprises the steps of: dividing the index information by a unit of an index information block when a first node of the trie is associated with a plurality of the index information blocks, and a search time required for searching all the index information associated with the first node of the trie exceeds a predetermined first threshold; and associating the divided index information with the second node.04-16-2009
20090100005MAPPING NETWORK ADDRESSES TO GEOGRAPHICAL LOCATIONS - A network address mapping system is described. The network address mapping system can identify a set of Web pages, collects information from the Web pages indicating geographical locations (“geolocations”), and correlate the geolocations with the network addresses from which the identified Web pages are served. The collected information can be weighted based on various factors, such as its relative position in a Web page. The collected information can then be used to identify a geolocation. The network mapping system can deduce geolocations for portions of ranges of network addresses based on the score, and can infer geolocations for other portions based on the deduced geolocations. This mapping can then be stored in a database and provided as a geomapping service. The network address mapping system is able to map network addresses to geographical locations. Thereafter, when a user's client computing device accesses a Web server, the Web server can easily and accurately determine a geographical location by querying the database storing the mapping or a geomapping service.04-16-2009
20090100001Database management apparatus and method of managing database - Information on a referenced class or a referenced property is extracted from at least one referenced dictionary having a referencing relation with a referencing dictionary having the hierarchical structure, in which lower classes inherit the properties of upper classes; the extracted information is added to the referencing dictionary and organized; the extracted detailed information is outputted organized referencing dictionary. Thus, the detailed information on an imported property may be acquired simply at the side of the referencing dictionary. In addition, since only the information on the referenced class or property in the referenced dictionary is separately extracted, traffic of the dictionary data may be reduced, and the efficient inter-dictionary data exchange can be realized.04-16-2009
20090100007CUSTOMIZED GEOGRAPHICAL LOCATION INDEXING - A system is disclosed for customizing a geographic location index based on user preferences. The system obtains geographic data provided by a user and generates a customized geographic region based on the obtained geographic data. The system generates relationship data corresponding to the new customized geographic region. The system updates the geographic location index based on the new customized geographic region and corresponding relationship data. Thereafter, on-line content may be delivered to an audience associated with the new customized geographic region, thereby allowing the user, such as an advertiser or publisher, to define targeting regions that are optimal to their specific business environment.04-16-2009
20100023478Utilizing Path IDs For Name And Namespace Searches - In a database system, names and namespace of XML nodes are computed from path ids. The path ids are constructed from tokens, each of which represents a particular name or namespace-name pair.01-28-2010
20100036803ADAPTIVE FILTER INDEX FOR DETERMINING QUERIES AFFECTED BY A DML OPERATION - Techniques are disclosed for creating and using a filter index in order to identify registered queries whose result sets are likely to have been changed by changes made to tables. The filter index entries are based on filter conditions. The filter conditions are created based on predicates contained in the registered queries. The filter conditions may include exclusive predicates and join predicates. Join predicates that join a table T02-11-2010
20090254514HANDLING REQUESTS FOR DATA STORED IN DATABASE TABLES - Method for handling requests for data stored in database tables is provided. The method includes receiving a request for data stored in a database table, the database table including non-hash and hash columns, a hash column including hash values computed based on non-hash values in at least one non-hash column, generating database queries that are executable to retrieve data stored in the database table satisfying the request, each database query using a different combination of columns in the database table, ranking the database queries based on desirability, determining whether any of the database queries only uses indexed columns, responsive to one or more of the database queries only using indexed columns, selecting a highest ranked of the one or more database queries that only uses indexed columns for execution.10-08-2009
20090313213JOINS OF RELATIONS IN AN OBJECT RELATIONAL DATABASE SYSTEM - A database system includes object relational tables having at least one complex attribute. The database system also includes an optimizer module that selects a join plan for a given query that specifies a join of multiple tables. If the query includes a function selected from the group consisting of a selection predicate applied on a complex attribute, a projection applied on a complex attribute, and a user-defined data type method, then a join path for the join query is determined based in part on a cost associated with application of the function. Application of the function is performed on one of a base table and a join table depending on which has a lower cardinality. The join table is a result of a join of the base table and another table.12-17-2009
20090313212RELATIONAL DATABASE WITH COMPOUND IDENTIFIER - A relational database system. The system includes a relational database configured to store and present data in a plurality of tables and a database application operatively coupled with the relational database. The system is configured to execute in an intermediate language runtime environment that supports native treatment of user data type definitions, and the database application and the relational database are configured to populate the plurality of tables with records that are each uniquely identified by a key. For each record, the key is constructed in accordance with a compound user-defined data type, such that the key includes: identification of an originating table and additional record-identifying information for the record.12-17-2009
20090313208SORTABLE HASH TABLE - A method for providing symbolic access to a plurality of objects stored in a data storage is provided. An associative array comprising a plurality of associative array keys and a plurality of associative array values may be generated. A data array comprising a plurality of data array elements may be generated, such that each object stores a sortable property value of the object and an original offset of the object. A mapping table to map original offsets to modified offsets is generated. The mapping table includes a plurality of mapping table elements, and each associative array value is used as an offset into the mapping table, and each mapping table element storing a modified offset, each modified offset is a numeric value used as an offset into the data array.12-17-2009
20090313210ENCODED MATRIX INDEX - A method, apparatus, and program product are provided for creating an Encoded Matrix Index for a column in a database table. An element of the column for all rows in the database table is compared to a corresponding reference value in a reference data structure, and in response to at least one value for the element of the column not matching the reference value, indicating a variation in a variation data structure and creating a value data structure. Queries executed using the Encoded Matrix Index include terms associated with a sub-column defined in a column of a database table. The variation data structure is accessed to determine whether any variation exists between rows belonging to a sub-column of the database table. If no variation exists, a value is accessed from the reference data structure; otherwise, a value for each row of the sub-column is accessed from a value data structure.12-17-2009
20090216712METHODS FOR CALCULATING A COMBINED IMPACT ANALYSIS REPOSITORY - One non-limiting embodiment of the invention comprises the steps of accessing at least two impact analysis repositories, calculating a combined impact analysis repository from the at least two impact analysis repositories, and utilizing the combined impact analysis repository for supplying better quality impact analysis results.08-27-2009
20090216711Method and system for implementing multiple web services for a service query - In a system and method for fulfilling a service query for a user, a processor may parse the query into a set of operations, identify a set of service providers that each provides functionality for performing at least one respective operation of the set of operations, and, for each of the set of operations, select a respective one of the set of service providers to perform the operation, and interface with the service provider selected for the operation to cause the service provider to perform the operation.08-27-2009
20090216708STRUCTURAL CLUSTERING AND TEMPLATE IDENTIFICATION FOR ELECTRONIC DOCUMENTS - Subject matter disclosed herein may relate to clustering electronic documents, such as, for example, web pages, and may also relate to template identification for electronic documents.08-27-2009
20100057670APPARATUS AND SYSTEM FOR REDUCING LOCKING IN MATERIALIZED QUERY TABLES - Disclosed is an apparatus and system for reducing locking in materialized query tables (MQT) for distributive functions. The apparatus includes an insert module that inserts into an MQT table a child record when a new record is inserted into a base table associated with the MQT. The child record includes values associated with the insert operation. Also included is a delete module that inserts into the MQT a child record that includes measure values that are the negative of the measure values in the base table row that is the subject of the delete operation. An update module inserts two child rows into the MQT, one negating the affected record and the other adding the values of the update operation. Each inserted child row includes a unique identifier that relates the inserted row to a parent row. An execution module generates responses using the values indicated by the cumulative records in a family.03-04-2010
20090024565METHOD AND APPARATUS FOR MASKING INDEX VALUES IN A DATABASE - One embodiment of the present invention provides a system for masking index values in a database. During operation, the system receives a request to mask a column in a database, wherein the column is an index-column. Next, the system retrieves a tree which is used to index the column, wherein the tree provides a sorted representation of values in the column. The system then locates the root-node of the tree. Then, for each child-node in the tree, the system determines if the child-node is a leaf-node. If so, the system masks a node-value for the leaf-node without resorting the tree. If not, the system leaves the node-value unmasked.01-22-2009
20080228708Goal Achievement and Outcome Prevention - A method, software, database and system for determining approaches for an individual to achieve a goal or prevent an undesired outcome are presented in which an attribute profile of the individual containing genetic and non-genetic attributes is compared against a database containing combinations of genetic and non-genetic attributes that are statistically associated with successful goal achievement or outcome prevention in other individuals.09-18-2008
20100057672SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR DUPLICATION OPTIMIZATION FOR PARALLEL JOIN OPERATIONS ON SIMILARLY LARGE SKEWED TABLES - A system, method, and computer-readable medium for optimizing join operations in a parallel processing system are provided. A respective set of rows of a first table and a second table involved in a join operation are distributed to each of a plurality of processing modules. The join operation comprises a join on a first column of the first table and a second column of the second table. Each of the plurality of processing modules redistributes at least a portion of the rows of the first table distributed thereto substantially equally among the other processing modules and duplicates at least a portion of the rows of the second table distributed thereto among the plurality of processing modules. The disclosed optimization mechanisms provide for reduced spool space requirements for execution of the parallel join operation.03-04-2010
20090248616INDEXING TECHNIQUE TO DEAL WITH DATA SKEW - A method for facilitating join operations between a first database table and a second database table within a database system. The first database table and the second database table share at least one common index column. The method includes creating a new index column in the second database table that is populated with a limited number of distinct calculated values for the purpose of increasing the overall number of distinct values collectively assumed by the columns common between the two tables. An intermediate table is created, the intermediate table including the common columns of the first database table, the second database table, and the new index column. An index is defined of the intermediate table to be the column(s) common between the first and second tables. An index is defined of the second table to be the column(s) common between the first database table, the second database table and the new index column.10-01-2009
20090319474Aggregating Database Queries - Embodiments of the invention provide techniques for aggregating database queries for energy efficiency. In one embodiment, queries received by a DBMS are aggregated and staged according to hard-disk drives required for query execution. Each group of queries accessing a given drive may be dispatched for execution together. Further, the queries received by a DBMS may be matched to patterns of previously received queries. The matching patterns may be used to predict other queries which are likely to be received by the DBMS. The received queries may be staged to be dispatched with the predicted queries. By aggregating queries to be executed, access to each hard-disk drive may be optimized, thus reducing the overall energy consumption required for executing the queries.12-24-2009
20090259619Online intelligent information comparison agent of multilingual electronic data sources over inter-connected computer networks - A method and system for real-time online search processing over inter-connected computer networks, in which an offline database information is maintained for a plurality of vendor sites from the inter-connected computer networks. The information includes URLs, search form URLs, description of domains, and vendor descriptions, and while the vendor descriptions comprise generalized rules about how product information is organized on each of the vendor sites. Parameters are processed for a price comparison request for a desired product using the information maintained in the offline database whereas price comparison request is received from an online user or buyer and/or from the system of the present invention. Real-time price and product information is then extracted from identified ones of the plurality of vendor sites, wherein the extracted price and product information are in a native language of the site; and the extracted price and product information are displayed to the user.10-15-2009
20080243764GROUP JOINS TO NAVIGATE DATA RELATIONSHIPS - A group join query facilitates navigation of relationships (e.g., one-to-many or many-to-one) across a plurality of data collections. Such a query operator produces nested or hierarchical results that capture the arguments passed thereto. If desired, the nested results can be flattened to simulate conventional relational database results.10-02-2008
20080243768Executing non-blocking parallel scans - Executing non-blocking parallel scans is disclosed. One embodiment includes determining if one or more threads have completed scanning one or more assigned portions of a first division of the data set. The identified one or more threads are directed to immediately scan the portions of a next division of the data set that are identified as available for scanning, upon completing the scanning of assigned portions of the first division of the data set. The threads are directed to immediately scan portions of the next division of the data set free of a need to wait until other threads complete scanning assigned portions of the first division of the data set.10-02-2008
20080243766CONFIGURATION MANAGEMENT OF AN ELECTRONIC DEVICE - A configuration of an electronic device (10-02-2008
20080243763SYSTEM, METHOD AND PROGRAM TO PROVIDE DATA TO ANOTHER PROGRAM - System, method and program product for providing data to a program for processing. An electronic spreadsheet is formed. One or more cells in the spreadsheet are mapped to the program. Based on the mapping, one or more data entries in the one or more cells, respectively are automatically forwarded to the program for processing. The data entries can be forwarded in data objects. Alternately, a list of data objects available for export are published. The data objects include respective data entries from respective cells in an electronic spreadsheet. In response to the program requesting one or more of the data objects, the one or more data objects are forwarded to the program for processing.10-02-2008
20080281778Hardware Accelerator Based Method and Device for String Searching - A method for searching within a data block for a data chunk having a predefined value, the method includes: fetching, by a processor, a data block search instruction; fetching, a data unit that includes multiple data chunks; wherein at least one data chunk within the data unit belongs to the data block; deciding whether to use a mask for data chunk level masking; searching, by a hardware accelerator, for a valid data chunk within the fetched data unit that has the predefined value; wherein the searching comprising applying a mask; wherein a valid data chunk in an non-masked data chunk that belongs to the data block; and determining whether to update the value of the mask and whether to fetch a new data unit that belongs to the data block.11-13-2008
20090210379DYNAMIC MULTIPLE INHERITANCE METHOD DISPATCH AND TYPE EXTENSION TESTING BY FRUGAL PERFECT HASHING - Apparatus, methods, and computer program products are disclosed for constructing and using member dispatch tables for Object-Oriented programming environments.08-20-2009
20080235180EXTENSIBILITY MECHANISM FOR ANALYSIS SERVICES UNIFIED DIMENSIONAL MODEL - Systems and methods that supply extensibility mechanisms for analysis services, via a plug-in component that enables additional functionalities. The plug-in component provide additional custom logic for the analysis services unified dimensional model (UDM). Accordingly, server functionalities can be extended in an agile manner, and without a requirement for a new release, for example.09-25-2008
20090187533AUTOMATICALLY IDENTIFYING AN OPTIMAL SET OF ATTRIBUTES TO FACILITATE GENERATING BEST PRACTICES FOR CONFIGURING A NETWORKED SYSTEM - A method and system for automatically identifying an optimal set of attributes of entities included in a networked system. Entity types are ranked based on information gain. A first classification accuracy relative to a first entity type is determined. The first entity type is the top-ranked entity type or a first aggregate entity type. A second entity type is selected basal on the ranking. A database join of a first set of attributes associated with the first entity type and a second set of attributes associated with the second entity type is performed. A second classification accuracy relative to a second aggregate entity type generated by the join is determined. In response to determining that the second classification accuracy is not greater than the first classification accuracy, an optimal set of attributes contributing to a problem in the networked system is identified as the first set of attributes.07-23-2009
20090164412Multiple Result Sets Generated from Single Pass Through a Dataspace - A method, apparatus and program product are provided for performing a query of a database. A database query is received, which includes first and second operations respectively configured to generate first and second disjoint results sets from a dataspace. The database query is analyzed to identify a set of attributes from the dataspace that are used by at least one of the first and second operations in the database query. During execution of the database query, a plurality of records from the dataspace is iteratively processed in a single pass, including, for each of the plurality of records, processing such record by retrieving the plurality of attributes for such record from the dataspace and performing each of the first and second operations on the record using the retrieved attributes for such record to build the first and second disjoint results sets.06-25-2009
20080319941METHOD AND APPARATUS FOR DOCUMENT CLUSTERING AND DOCUMENT SKETCHING - A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document's fingerprint. One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.12-25-2008
20080319940Message Log Analysis for System Behavior Evaluation - A technique is disclosed that enables the run-time behavior of a data-processing system to be analyzed and, in many cases, to be predicted. In particular, the illustrative embodiment of the present invention comprises i) transforming the messages that constitute an unstructured log into a numerical series and ii) applying a time-series analysis on the resultant series for the purpose of pattern detection. Indeed, it is recognized in the illustrative embodiment that the problem really is to detect patterns that depict aspects of system behavior, regardless of the textual content of the individual log messages. In other words, by analyzing the totality of the messages in the log or logs—as opposed to looking for pre-defined patterns of the individual messages—system behavior can be mapped and understood. The mapping helps in characterizing the system for the purposes of predicting failure, determining the time required to reach stability during failure recovery, and so forth.12-25-2008
20090119248SEARCH BASED ON DIVERSITY - An example method of expanding a search is provided. In this example, a query used in the search is initially accessed. Other queries associated with the accessed query are identified, and these other queries include query terms. A diversity of the query terms is measured and the accessed query may be expanded with the query terms based on the measured diversity. Another example method is also provided for expanding a search. In this alternate example, a result set resulting from the search is accessed and a diversity of the result set is measured. The query used in the search may then be expanded based on this measured diversity.05-07-2009
20090112796Natural language conceptual joins - The invention answers a user's information request, stated in the user's natural language, by dynamically retrieving and merging facts and information from disparate and possibly geographically dispersed databases and presenting a single answer to the user. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. 04-30-2009
20080228701Destiny Modification Using Attribute Combinations - A method and system for computer based destiny modification are presented in which a set of attributes associated with an individual is compared against attribute combinations that are statistically associated with a query attribute, the query attribute representing an attribute which may desirable for the individual to have, or which may be undesirable for the individual have. Based on the comparison, changes to the set of attributes associated with the individual are indicated and can then be implemented to increase/decrease the potential of the individual to acquire (an association with) the query attribute.09-18-2008
20080228709BUILDING DATABASE STATISTICS ACROSS A JOIN NETWORK USING SKEW VALUES - An apparatus and program product that build column statistics utilizing at least one skew value. The column statistics built using skew values, instead of column statistics built only through random sampling, may be used to more accurately reflect skew values across join networks, and thus enable a query optimizer to better select an access plan that is optimal under current runtime conditions.09-18-2008
20090012930System and method for a self-optimizing reservation in time of compute resources - A system and method of dynamically controlling a reservation of resources within a cluster environment to maximize a response time are disclosed. The method embodiment of the invention comprises receiving from a requester a request for a reservation of resources in the cluster environment, reserving a first group of resources, evaluating resources within the cluster environment to determine if the response time can be improved and if the response time can be improved, then canceling the reservation for the first group of resources and reserving a second group of resources to process the request at the improved response time.01-08-2009
20080313134QUERY OPTIMIZATION ON VPD PROTECTED COLUMNS - 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.12-18-2008
20080275841Self Tuning Database Retrieval Optimization Using Regression Functions - A system and method for accessing a relational database and estimating the selectivity of a query (e.g., an SQL query) in order to better predict the number of qualifying records for simple and complex queries. A dataset is created based upon queries applied against the database by the user community. The dataset is populated with information related to query conditions and their respective combinations. A regression function reflecting correlations between query conditions is generated and used as a data mining model to calculate table-specific estimates for the cardinality of subsequent queries. An appropriate access method is then selected from a set of available access methods based upon the number of estimated query-qualifying records. By periodically updating the regression model with FIFO managed queries, a self-tuning mechanism is achieved resulting in better selectivity/result size estimates for use in selecting access methods used in compiling subsequent SQL queries applied against the database.11-06-2008
20080222090LOAD ESTIMATING SYSTEM AND COMPUTER LOAD ESTIMATING METHOD - A load estimating system which estimates a load of a database, includes a storage unit, a record number calculating module, and an access number calculating module. The storage unit includes structure information defining a structure of a table in said database, first distribution information indicating probability distribution of condition variables of a query for said table, and second distribution information indicating probability distribution of values in said table. The record number calculating module calculates the average number of selected records which meet conditions defined by-condition variables, based on said structure information, said first distribution information and said second distribution information. The access number calculating module calculates the number of block accesses for said query based on the average number of selected records.09-11-2008
20080222093AUTOMATICALLY AND ADAPTIVELY DETERMINING EXECUTION PLANS FOR QUERIES WITH PARAMETER MARKERS - A method and system for automatically and adaptively determining query execution plans for parametric queries. A first classifier trained by an initial set of training points is generated. A query workload and/or database statistics are dynamically updated. A new set of training points is collected off-line. Using the new set of training points, the first classifier is modified into a second classifier. A database query is received at a runtime subsequent to the off-line phase. The query includes predicates having parameter markers bound to actual values. The predicates are associated with selectivities. A mapping of the selectivities into a plan determines the query execution plan. The determined query execution plan is included in an augmented set of training points, where the augmented set includes the initial set and the new set.09-11-2008
20080222091Retrieving Documents Transitively Linked to an Initial Document - A method for creating a distinguishing identifier of a collection of data including a primary document and one or more auxiliary documents digests each auxiliary document to create a respective auxiliary document digest, and creates a distinguishing identifier by digesting a concatenation of the primary document with all auxiliary document digests.09-11-2008
20080222087System and Method for Optimizing Query Access to a Database Comprising Hierarchically-Organized Data - An cost based optimizer optimizes access to at least a portion of hierarchically-organized documents, such as those formatted using eXtensible Markup Language (XML), by estimating a number of results produced by the access of the hierarchically-organized documents. Estimating the number of results comprises computing the cardinality of each operator executing query language expressions and further computing a sequence size of sequences of hierarchically-organized nodes produced by the query language expressions. Access to the hierarchically-organized documents is optimized using the structure of the query expression and/or path statistics involving the hierarchically-organized data. The cardinality and the sequence size are used to calculate a cost estimation for execution of alternate query execution plans. Based on the cost estimation, an optimal query execution plan is selected from among the alternate query execution plans.09-11-2008
20080208798DETECTING AND TRACKING MONOTONICITY FOR ACCELERATING RANGE AND INEQUALITY QUERIES - A computer implemented method, apparatus, and computer usable program code for detecting monotonicity. A determination is made as to whether a function that is assumed to be monotonic will remain monotonic after performing an operation in response to receiving the operation. The operation is allowed to be performed in response to a determination that the function will remain monotonic after performing the operation.08-28-2008
20080256031Method and Apparatus for Ranking-Based Information Processing - Techniques are provided for ranking-based information processing. Method steps can include integrating information from at least one source (a plurality of heterogeneous sources can also be handled), to obtain integrated information; mapping the integrated information to at least one application; ranking the integrated information based on the mapping and on ranking criteria from a knowledge base; and processing the integrated information, based on the ranking, to obtain processed integrated information. Optionally, the processing step includes formatting the processed integrated information for a plurality of applications.10-16-2008
20080256026Method For Optimizing And Executing A Query Using Ontological Metadata - A method is provided for optimizing a query. The method includes providing metadata, and inputting an initial query including at least one initial class. The method further includes processing the initial query with the metadata. Additionally, the method includes obtaining an optimized query based on the processing of the initial query, where the optimized query provides at least one subsequent class based on the at least one initial class.10-16-2008
20080256025Database Query Optimization Utilizing Remote Statistics Collection - A method, apparatus and program product to optimize a database query. In a first system having a first dataspace, a query plan is generated for the database query. Remote statistics collection associated with the database query is initiated on a second system having a second dataspace. The remote statistics collection uses the second dataspace, which includes a current copy of at least a portion of the first dataspace on the first system. Database statistics are collected for the first system by analyzing the second dataspace and then communicating the collected database statistics to the first system for use in optimizing database queries executed by the first system.10-16-2008
20080256022TECHNIQUE FOR AUTO FILLING VALUES IN A USER INTERFACE - Disclosed is a method and system to receive a first value of a first attribute in a user interface and create a value pattern for a second attribute in the user interface based on the first value dynamically. A second value for the second attribute is automatically proposed from the created value pattern.10-16-2008
20100057673REUSABLE MAPPING RULES FOR DATA TO DATA TRANSFORMATION - What is described is a method and a system for data transformation by using predefined mapping rules. A transformation between a source data object and a target data object is defined and an initial mapping of elements from the source data object to the target data object is created. A predefined mapping rule is applied as a subsequent mapping between the source data object and the target data object to adjust the transformation. The mapping from the source data object to the target data object is displayed via a graphical user interface.03-04-2010
20080249979Method and arrangement for pairing off parties on a labour market - The invention provides a method and an arrangement for pairing off a job seeker with potential employers on a labour market. A service provider maintains a database (10-09-2008
20090164411METHODS AND APPARATUS FOR COMPUTING GRAPH SIMILARITY VIA SEQUENCE SIMILARITY - This disclosure describes systems and methods for identifying and correcting anomalies in web graphs. A web graph is transformed into a sequence of tokens via a walk algorithm. The sequence is fingerprinted to form a set of shingles. The singles are compared to shingles for other web graphs in order to determine similarity between web graphs. Actions are then carried out to remove anomalous web graphs and modify parameters governing web mapping in order to decrease the likelihood of future anomalous web graphs being built.06-25-2009
20090204571Distributed directory server, distributed directory system, distributed directory managing method, and program of same - There is provided a distributed directory server to be used in a plurality of distributed directory servers connected to one another through a network and in a distributed directory system made up of a plurality of user devices, which includes a transmitting/receiving section to transmit or receive messages between user devices and other distributed directory servers, a use history notifying section to read a totalized information database and to provide notification for instructing the transmitting/receiving section to transmit data on the number of times of using Pushed data to the distributed directory server, and an evaluation function computing section to determine operation rules for Push distribution command and Pull search command to an index for every management unit.08-13-2009
20090299955Model Based Data Warehousing and Analytics - Aspects of the subject matter described herein relate to data warehouses. In aspects, mapping information is received that maps elements of a data warehouse to types of a type system. A type system defines a hierarchy of data types of data in a data source from which the data warehouse obtains data. The mapping information also indicates whether subtypes of the data are mapped to the elements. Using this mapping information, the elements of the data warehouse may be automatically created, maintained, and populated. When the type system is changed, mapped elements in the data warehouse may be updated or created and code to extract and load the data from a data source associated with the type system may be created based on the mapping information. In addition, reports based on the mapped elements may continue to work without change.12-03-2009
20090299956SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR DYNAMIC DETECTION AND MANAGEMENT OF DATA SKEW IN PARALLEL JOIN OPERATIONS - A system, method, and computer-readable medium for dynamic detection and management of data skew in parallel join operations are provided. Receipt of an excessive number of redistributed rows by a processing module is detected thereby identifying the processing module as a hot processing module. Other processing modules then terminate redistribution of rows to the hot processing module and maintain rows of a skewed table of the join operation that would be redistributed to the hot processing module in a local spool. Rows of a smaller table that would be redistributed to the hot processing module are duplicated to each processing module involved in the join operation. Rows of tables that are to be redistributed by a processing module to any processing module excluding the hot processing module are redistributed accordingly and maintained locally by the processing module. The join operation is completed by merging results of local join data sets of each processing module.12-03-2009
20090292669TECHNIQUE FOR REMOVING SUBQUERY USING WINDOW FUNCTIONS - Methods for transforming a query to remove redundant subqueries in HAVING clauses are provided. The methods provided transform queries that contain subqueries in HAVING clauses with tables and join conditions and filter conditions equal to tables, join conditions and filter conditions in outer query to queries that eliminate the original subquery and retain the original outer query with a single inline view using window functions. Whether this transformation can be performed depends on which tables and join and filter conditions are in the outer query and the subquery. The transformation eliminates duplicative table accesses and join operations from queries.11-26-2009
20100030730System, Method, and Computer Program Product for Determining SQL Replication Process - A system, method, and computer program product are provided for replicating a table in a source database to a target database. In accordance with an embodiment of the present invention, a subscription to the table is defined and a query is executed on the source database. The query is then normalized, and it is determined whether the query would cause semantically appropriate changes to the target database. If so, the normalized query is sent to the target database for execution, in accordance with an additional embodiment of the present invention.02-04-2010
20100030731COST-BASED QUERY REWRITE USING MATERIALIZED VIEWS - A system and method of rewriting a database query where the query contains an aggregate includes the following. If one or more aggregate materialized views are considered, rewriting the query using an aggregate materialized view. If one or more non-aggregate multi-table materialized views are considered, the query is rewritten using a multi-table materialized view. A join cost is determined for each such non-aggregate multi-table materialized view. If one or more non-aggregate single table materialized views are considered, the query is rewritten using the single table materialized view. A join cost is determined for each such non-aggregate single table materialized view. Finally, a current total cost is determined for use of various materialized views as a function of join cost, aggregation cost and spool cost to select a rewritten query.02-04-2010
20100030729METHOD AND SYSTEM FOR MITIGATING IMPACT OF USER ERRORS IN DATA STORES - The invention provides a method and system for managing data access. The method includes receiving a request for accessing a file, determining a type of the received request that corresponds to an access pattern based on history of many files, marking the request based on the type of request to identify the request as a candidate to be part of a sequential scan for accessing files in a sequential order, and processing the request based on the marking to throttle access of the file in the case of a potential ongoing erroneously requested sequential scan.02-04-2010
20100030726Mechanism For Deferred Rewrite Of Multiple Xpath Evaluations Over Binary XML - A mechanism is provided for improving the performance of particular database queries operating on a view comprising binary-encoded XML. The key to improving performance is to determine whether a XML index is available to improve the computation of XPath data before deriving an optimized execution plan for a particular query. When a XML index is not available to help expedite the computation of binary-encoded XML, then deferring the computation of the XPath data until after the view merge stage avoids unnecessary computation of XPaths that are part of the view but not needed for the particular query.02-04-2010
20100030732SYSTEM AND METHOD TO CREATE PROCESS REFERENCE MAPS FROM LINKS DESCRIBED IN A BUSINESS PROCESS MODEL - A method of constructing a process reference map. The method includes iterating over each of a plurality of process models. An intermediary reference graph is created. A directed link for each reference in the process models is added to the intermediary reference graph, the link pointing from a node in the reference graph representing a process model within which a reference occurred to a node representing a process model that the reference is pointing towards. The method determines, between two process models of the plurality of process models, whether an inconsistency including one of an outbound process reference missing inconsistency, an inbound process reference missing inconsistency, and an unavailable information inconsistency exists. A new process model map is created from the intermediary reference graph with one element each representing a process models and the elements being linked representing the references therebetween. Each link comprises an attribute indicating one of a context, type of reference, and a modeling element.02-04-2010
20100023481Computer-implemented method for deriving, translating, and using definitional expressions for data in a database - A computer-implemented method is disclosed for deriving definitional expressions for data in a database from membership abstractions, and for deriving membership abstractions from definitional expressions. Definitional expressions may be partially in a natural language. By automating the translation among definitional expressions and membership abstractions, definitional expressions may then be used as database commands for the purpose of query, data update, maintenance, and the like, and may also be used to provide users with a more readable and understandable definition of both stored and derived data (e.g., the result of an ad-hoc query or data modification).01-28-2010
20100023480INDEXING METHOD OF DATABASE MANAGEMENT SYSTEM - A database management system has a plurality of database servers and data can be transferred between them by partitioning a data area into small areas and altering allocation of the small areas to the database servers. After altering the configuration, there occurs degradation in processing speed that accompanies re-creation of the index. If this problem is solved by using conventional techniques, noticeable degradation in processing speed will occur to a specific query at the time of a steady state operation. Accordingly, an index created for each of the small areas and an index to all of the small areas are allocated to the database server and used in combination.01-28-2010
20100023479HEXADECIMAL FILE FAST DECOMPRESSION METHOD - A computer implemented method of selectively accesses a set of subdivisions of a compressed file, wherein the compressed file is a hex dump file. A request to access a first data byte string is received. The first data byte string has a first address from within the compressed file. The compressed file comprises a plurality of subdivisions. Each of the plurality of subdivisions is provided with an address range to indicate the addresses of byte strings contained therein. The address range for each of the plurality of subdivisions is the file name for each of the plurality of subdivisions. A set of subdivisions from the plurality of subdivisions is identified that contains a first data byte string. The step of identifying the set of subdivisions comprises comparing the first address to the address range for the plurality of subdivisions. Only the set of subdivisions which contains the first data byte string is extracted.01-28-2010
20100023477OPTIMIZED BULK COMPUTATIONS IN DATA WAREHOUSE ENVIRONMENTS - A method including extracting data spanning a computational interval from a plurality of database tables in an optimized manner, creating an array of each column of data that is extracted, accessing each array via a standardized programmatic interface to manipulate the data, if needed to perform computations, normalizing the accessed data to a common interval or interpolating the accessed data to derive missing items based on the common interval, performing the computations on the accessed data, and outputting results of the computations to a storage medium or an output device. A corresponding system and computer program product.01-28-2010
20100017364SYSTEMS, METHODS, AND SOFTWARE FOR DISTRIBUTED LOADING OF DATABASES - The present inventors have devised one or more systems, methods, and software for distributed loading of information retrieval systems. One exemplary system includes two or more (at least two) load monitor servers that not only monitor and ensure completion of load tasks by individual load servers in a set of two or more load servers, but also provide for one load monitor to monitor performance of the another. Moreover, the exemplary system provides a service-level-agreement (SLA) data structure for each load server. The SLA data structure governs what types and priority levels of loading tasks will be performed for predetermined time periods.01-21-2010
20100017363EFFICIENT EVALUATION OF SQL PIVOT OPERATIONS - Techniques are described herein for supporting efficient evaluation of pivot operations. In an embodiment, a pivoting query on a data table is received. The query identifies pivot columns, measure columns, and grouping columns. In response to receiving the query, a staging table that comprises new pivot columns, aggregated columns, and new grouping columns may be created. For each particular unique combination of values of the grouping columns and the pivot columns in the data table, stored values in the measure columns in the data table are aggregated for certain rows in the plurality of rows in the data table. Each row of the certain rows comprises the each particular unique combination of values of the grouping columns and the pivot columns in the data table. Results of aggregating are stored in the staging table. Data that has been populated in the staging table is transposed into a result set.01-21-2010
20090216709OPTIMIZED COLLECTION OF JUST-IN-TIME STATISTICS FOR DATABASE QUERY OPTIMIZATION - A system and method are provided for updating database statistics for use in generating query execution plans. A first query for a database is received, for example by a compiler, and the compiler accesses statistics associated with the first query for optimizing a query execution plan for the first query. The statistics may be accessed from a first cache. If the statistics retrieved from the first cache are determined to be stale, the system obtains updated statistics and may store them in a temporary cache. The stale statistics in the first cache are marked as invalid. Existing queries using the first cache may continue to use the first cache, while new queries may be provided with updated statistics.08-27-2009
20080270350SYSTEMS AND METHODS FOR MODULARIZING DATA FLOWS - Systems, devices, and methods for modularizing data flows and for providing stand-alone execution of incomplete data flows are provided based on an improved data warehousing framework. Data flow modularization and code reuse is improved through the use of the disclosed flowlets and allows for consistent and efficient standalone testing of incomplete data flows. The disclosed details enable various refinements and modifications according to system design considerations.10-30-2008
20080201293MULTIDIMENSIONAL QUERY SIMPLIFICATION USING DATA ACCESS SERVICE HAVING LOCAL CALCULATION ENGINE - An enterprise business intelligence system includes a data access service that provides consistent availability of functionality for querying multidimensional data sources regardless of the capabilities of the underlying data sources. The data access service disassembles a multidimensional query into execution units, and may optimize the multidimensional query such that individual execution units may be executed locally or remotely to achieve increase computational efficiently.08-21-2008
20080281776Interactive System For Creating, Organising, and Sharing One's Own Databank of Pictures Such as Photographs, Drawings, Art, Sketch, Iconography, Illustrations, Portraits, Paintings and Images - An interactive system for creating, organising, and sharing one's own databank of pictures is disclosed, it being accepted that one may want to build such data based on one's personal interest, by well-defined classifications, using a computer system comprising of; a. (i) a User Interface; (ii). a Database comprising a. a Picture Bank Database; b. a User Database; c. a Configuration Database; (iii) At least one data input, organising and management module(s) allowing a user to input, append, and modify well-classified data (iv) Module allowing a user to invoke a Picture Session; (v) Module allowing a user to Schedule data; (vi) Module allowing the user to Export data from the Database(s); (vii) Module allowing the user to Import data; (viii) Module allowing the user to use the data in the Database as a screen saver.11-13-2008
20080262998Systems and methods for personalizing a newspaper - Systems and methods for presenting news information and personalizing presentation of news information are disclosed. Users are presented with a selectable, visual representation of the news information. Users can access additional news information and/or a personalized newspaper by selecting a visual representation of the news information. Systems and methods for monitoring user selection and modifying the personalized newspaper are also disclosed.10-23-2008
20100030728COMPUTING SELECTIVITIES FOR GROUP OF COLUMNS AND EXPRESSIONS - Techniques are described herein for estimating selectivities of query predicates that reference more than one column and predicates that include column expressions. Virtual columns are defined based on column groups and column expressions. Statistics are gathered on the virtual columns and are used to estimate the selectivities of query predicates that include column groups or expressions. Query predicates that include column groups are mapped to virtual columns on which statistics are gathered, based on similarities between the column groups in the query predicates and the column groups on which the virtual columns are defined. Virtual columns are defined for column groups and expressions are specified by users or a workload analyzer that analyzes query predicates.02-04-2010
20090070291ACTIVE FILE SYSTEM - A computerized file system is provided that is accessible by users that are stand-alone or over a network (including the Internet), in which the appearance of the standard hierarchical tree structure has been modified to provide the appearance of defining film (leaves) as containers for other files or directories/folders; intelligence is added to the tile system by allowing a user to define rules to be applied to the files and directories present in the file system; and an interface is provided to allow users to extend the attributes of files and directories in the file system to enable them to access this functionality.03-12-2009
20090171890Efficient predicate prefilter for high speed data analysis - A method and system are disclosed for operating a high speed data stream management system which runs a query plan including a set of queries on a data feed in the form of a stream of tuples. A predicate prefilter is placed outside the query plan upstream of the set of queries, and includes predicates selected from those used by the queries. Predicates are selected for inclusion in the prefilter based on a cost heuristic, and predicates are combined into composites using a rectangle mapping heuristic. The prefilter evaluates the presence of individual and composite predicates in the tuples and returns a bit vector for each tuple with bits representing the presence or absence of predicates in the tuple. A bit signature is assigned to each query to represent the predicates related to that query, and a query is invoked when the tuple bit vector and the query bit signature are compatible.07-02-2009
20090171891DATA INDEXING BY LOCAL STORAGE DEVICE - A computing device including a host device (HD) is in communication with a local storage device (LSD), wherein the LSD includes a memory array. A search index is generated with respect to data stored in the memory array of the LSD. By the LSD without involvement of the HD, the index data is generated with respect to the data stored in the memory array of the LSD. By the LSD, the generated index data is stored on the LSD as at least a part of the search index. The index may include data that can be used to respond to search queries with respect to data of the LSD. The queries may be originated from a HD or from within the LSD. The use of the index is not limited to responding to search queries. For example, the index may be used for content screening.07-02-2009
20090171886FILE MANAGEMENT METHOD OF A RING BUFFER AND RELATED FILE MANAGEMENT APPARATUS - A file management method of a ring buffer includes translating actual positions of an actual file stored in the ring buffer into virtual positions of a virtual file according to a specific mapping manner, searching the actual positions in the actual file according to the virtual positions, and accessing data at the actual positions of the actual file stored in the ring buffer.07-02-2009
20090171889SYSTEM AND METHOD FOR OPTIMIZING FEDERATED AND ETL'D DATABASES WITH CONSIDERATIONS OF SPECIALIZED DATA STRUCTURES WITHIN AN ENVIRONMENT HAVING MULTIDIMENSIONAL CONSTRAINTS - A method for creating a data warehousing scheme having optimally selected components. A mathematical model of a goal for the data warehousing scheme is input into an optimization engine. At least one constraint on the data warehousing scheme is input into the optimization engine. A mathematical optimization algorithm is performed using the optimization engine, wherein an output of the optimization engine is an optimized data warehousing scheme having optimally selected components. The optimized data warehousing scheme can be stored.07-02-2009
20090171887PROCESSING ALGEBRAIC EXPRESSIONS FOR KEYED DATA SETS - Embodiments of the present invention address deficiencies of the art in respect to managed object expression and provide a method, system and computer program product for algebraically expressing a managed object in a keyed data set. In an embodiment of the invention, a method for algebraically expressing a managed object in a keyed data set can be provided. The method can include specifying one-dimensional sets of managed objects each with a corresponding single partial object identifier with wildcard and incorporating each single partial object identifier with wildcard into an algebraic expression compositing managed objects in the keyed data set. The method further can include evaluating the algebraic expression to generate an index for the composited managed objects in the keyed data set, and managing the composited index in a computer communications network by reference to the index.07-02-2009
20080270346Estimating the static execution time of a database query - In a method for estimating a static execution time of a database query, a prediction of query runtime tree is built from historical query information. A database query is received. The prediction of query runtime tree is used to estimate the static execution time of the database query.10-30-2008
20090307185METHOD FOR SEAMLESS PLAYBACK OF MULTIPLE MULTIMEDIA FILES - A method for seamless playback of multiple multimedia files is provided. First, a first multimedia file and a second multimedia file are pre-analyzed to establish a playing list. Next, index content of the first multimedia file and the second multimedia file are referred to, so as to establish a first random access table and a second random access table. Then, the multiple multimedia files are played according to the play list, the first random access table, and the second random access table. Accordingly, the multiple multimedia files can be played seamlessly while the video and audio data are kept synchronized, such that the continuity for viewing multimedia files is improved.12-10-2009
20090132476POLICY BASED INFORMATION LIFECYCLE MANAGEMENT - A method, article of manufacture, and apparatus for managing a lifecycle of an auditory communication is disclosed. In an embodiment, this comprises receiving an auditory communication with associated data representing identified keywords in the communication and call transport information. A data for a disposition of the communication is determined from a portion of the identified keywords, a portion of the call transport information, or a portion of the policies invoked. The communication is associated with the date(s).05-21-2009
20090132475Optimized database appliance - A system and method from processing database queries allows for cost and locale based distribution for execution of database queries. The database queries are executed on execution engines that provide flexible configuration and overlapping functionality. The system reduces various costs, including elapsed time, required to perform database queries. The method provides processing of a database query using a database catalog comprising database table locality information, record locality information and execution engine information. A query optimizer receives the query and accesses the catalog to create a query execution plan comprising locality-based database operations. A central database operation processor providing a first execution engine executes the query execution plan by performing at least a portion of the locality-based database operations and distributing at least a portion of the locality-based database operations as a subplan. A second database operation processor providing a second execution engine executes the subplan received from the central processor.05-21-2009
20090132474Method and Apparatus for Optimizing Queries over Vertically Stored Database - A method and device for optimizing queries over a vertically stored database. Items in the database are partitioned into several partitions each having a partition signature. The method includes decomposing a first query received from a user into multiple first subqueries; generating a signature for each first subquery in a way corresponding to the way of generating the partition signature; comparing the signature of each first subquery with partition signatures of all partitions respectively to obtain all partitions matching the first subquery; rewriting a second subquery translated from the first subquery based on the matching partitions to obtain a rewritten second subquery; and composing rewritten second subqueries for all first subqueries to form a second query so that queries are executed over the database using the second query.05-21-2009
20090132473APPARATUS, METHOD, AND COMPUTER PROGRAM PRODUCT FOR PROCESSING DATABASES - An obtaining request requesting that information is obtained from a structured database by using multiple loops is received. A unique identifier is assigned to each of records in element tables each having been created for a different one of the loops. A cross product joined table is created by performing a cross product joining process on the element tables, so that the information specified as an obtained target in the obtaining request is obtained from the element tables. For each of the loops, a single-loop table storing therein records in which the obtained information, the identifiers, and the elements are brought into correspondence is created. An inter-loop joined table is created by joining the plurality of single-loop tables. A correspondence between the records in the cross product joined table and in the inter-loop joined table are controlled, based on the identifiers contained in the cross product joined table and the inter-loop joined table.05-21-2009
20090132472METHOD OF SEARCHING FOR A FILE WITH A DIRECTORY IDENTIFIED FROM A FILE PATH AS A START POINT - There is provided a file search method executed in a file search apparatus for searching for a file relevant to an application, the file search apparatus having an interface, a processor coupled to the interface, and a memory coupled to the processor. The file search method comprising the steps of: obtaining process information which includes an execution start time and file path of the application; identifying, from the obtained file path, a directory that serves as a start point in a search for a file relevant to the application; and searching, with the identified directory as the start point, for a file accessed after the execution start time of the application.05-21-2009
20090132470Generic Table Grouper - A system and process that groups identical values that are adjacent to one another within a column of a table. The system provides this functionality through an application and backend implementation independent module. Custom grouping information for a table or columns within a table can be stored for retrieval each time a table is open or displayed. A user can manage the customizations through a centralized portal.05-21-2009
20090132469GEOCODING BASED ON NEIGHBORHOODS AND OTHER UNIQUELY DEFINED INFORMAL SPACES OR GEOGRAPHICAL REGIONS - A computer-based method for creating a data structure for informal geographic spaces for use with geocoded databases. A set of data is stored in memory for a geographic region, and a plurality of neighborhoods is identified in the geographic region based on processing of the stored set of data. The method includes generating a boundary definition for each of the neighborhoods by processing neighborhood definition information. A data structure is created in the memory for containing neighborhood data content with at least one record for each of the neighborhoods. The data structure is populated by storing, for each neighborhood, the generated boundary definition along with a neighborhood name and identifier in the records of data structure. The boundary definition may be created by combining two or more definitions identified for a single neighborhood to provide a more inclusive geometry such as by aligning the geometries and performing an additive algorithm.05-21-2009
20090132468RANKING OF OBJECTS USING SEMANTIC AND NONSEMANTIC FEATURES IN A SYSTEM AND METHOD FOR CONDUCTING A SEARCH - The invention provides for a system for ranking data including a first calculation component that calculates a qualitative semantic similarity score of at least one data entry from at least one data source, a second calculation component that calculates a general quantitative score of the at least one data entry from at least one data source, a third calculation component that combines the qualitative semantic similarity score and the general quantitative score of the at least one data entry from at least one data source into a vector score for the at least one data entry, and a ranking component that ranks the at least one data entry among other data entries using the vector score. General qualitative scores such as distance scores are never overruled by semantic scores.05-21-2009
20090132467SYSTEM AND METHOD OF ORGANIZING IMAGES - Disclosed are a system, method and computer-readable medium for organizing images. A method aspect relates to receiving an image into a device, receiving incidental information associated with the image, organizing the image and the incidental information into a data structure such as a sparse array, classifying the received image with an image classifier and storing the classified image in an image database, receiving a search query and responding to the search query by searching for and retrieving matching images in the image database based on a comparison of the image search query to the data structure.05-21-2009
20100057671URI FILE SYSTEM - An apparatus and a method for accessing data from a server. In one embodiment, data referred by a Universal Resource Identifier (URI) is mounted on a file system. The mounted data can then be operated on using the file system. To mount the data referred by the URI, a Uniform Resource Locator (URL) fragment of the URI is determined. An identifier on the file system is generated based on the URL fragment. Data referred by the URI is mapped to the file system using the identifier.03-04-2010
20090132466System and method for archiving data - Data to be archived may be stored in a data storage system in a compressed format that allows the compressed data to be accessible without decompression. Along with the data, supporting information is stored in the data storage system. The supporting information may include a location of the data in the storage system and at least one of a schema associated with the data and application information The application information may include a name and version number of an application used to access the data. One or more queries used to access the data may be stored in the storage system or elsewhere. Query attributes also may be stored in the storage system or elsewhere. Query attributes may include a location of a stored query and at least one of data, data formats, and database schemas compatible with a query.05-21-2009
20100049694METHOD AND SYSTEM FOR EXTENDING A RELATIONAL SCHEMA - According to one embodiment, a method of accessing data stored in a data store by using a query is provided and includes receiving a first query in a standardized-language at an relational database interface, the first query identifying a first data type. A provider registry is consulted to identify a first provider associated with the first data type. A request specification is transmitted from the relational database interface to the first provider associated with the first data type. Non-relational data of the first data type is received at the relational database interface. The non-relational data is of the first data type received from the first provider in response to the request specification. The non-relational data is converted to relational data at the relational database interface, and the relational data is returned. The relational database interface does not include code relating to how the non-relational data of the first data type is stored by the first provider, how the non-relational data of the first data type is to be retrieved by the first provider, and how the non-relational data is to be manipulated for format conversion.02-25-2010
20100049693SYSTEM AND METHOD OF CACHE BASED XML PUBLISH/SUBSCRIBE - A publish/subscribe content-based distribution of messages, receives a message, codes the message to generate a message identifier, content filters the message to identify matches to subscription queries, retrievably caches the matches based on the message identifier, receiving another message, codes the message to generate its message identifier, accesses the cache with the message to identify any associated previously identified query match and, if not identified, content filters the message and, conditional on matches to subscription queries, reports the message and updates the cache.02-25-2010
20100049692Apparatus and Method For Retrieving Information From An Application Functionality Table - A computer readable storage medium includes executable instructions to derive a table representing operations associated with an application. One or more parameters are received. A query is executed against the table if the parameters are resolvable with respect to one or more columns in the table. A derived query is constructed based on one or more additional parameters if the parameters are not resolvable with respect to one or more columns in the table. The derived query is executed against the table. A query result is returned.02-25-2010
20080215540OPTIMIZING A QUERY TO A PARTITIONED DATABASE TABLE USING A VIRTUAL MAINTAINED TEMPORARY INDEX THAT SPANS MULTIPLE DATABASE PARTITIONS - A query optimizer optimizes a query to a partitioned database table by determining common characteristics of the partitions and generating a virtual maintained temporary index that spans multiple partitions. Using the virtual maintained temporary index allows the query optimizer to generate an access plan based on the virtual maintained temporary index, which relieves the optimizer from having to individually optimize access to each partition for partitions that share common characteristics.09-04-2008
20100010961DISTRIBUTED DIRECTORIES - Disclosed is a method for improving performance of distributed directory servers, which includes identifying directory servers configured to serve a partition index; monitoring the directory servers to identify whether a primary directory server has reached a maximum number of allowable entries in the partition index; and dynamically allocating a secondary directory server to the partition index on determining that the primary directory server has reached the maximum number of allowable entries in the partition index.01-14-2010
20100010959SYSTEMS AND METHODS FOR QUERY EXPANSION IN SPONSORED SEARCH - The present invention is directed towards systems, methods and computer program products for providing query-based advertising content. According to one embodiment, a method for providing query-based advertising content comprises receiving a web query and generating an ad query associated with the web query, wherein the ad query is generated on the basis of one of a query to advertisement relationship, a query to feature vector relationship, or a rewritten query vector. An advertisement is selected on the basis of the generated ad query.01-14-2010
20090327218Systems and Methods of Reverse Lookup - In one embodiment, a system and method is provided for reverse lookups using a reverse lookup hint stored in metadata associated with a file or directory. The reverse lookup hint is used to retrieve an entry, comprising a name of the file or directory, which is stored in a map structure related to a parent directory of the file or directory. In an embodiment, the reverse lookup hint comprises a hash value generated from the name of the file or directory.12-31-2009
20090018993METHODS AND SYSTEMS FOR OPTIMIZING DATA ACCESSES - 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.01-15-2009
20090018992MANAGEMENT OF INTERESTING DATABASE STATISTICS - A method, system, and computer program product for managing database statistics are provided. The method, system, and computer program product provide for receiving a query for optimizing, collecting statistics specific to the query prior to generating any access plans for executing the query, and generating an access plan for executing the query based on the collected statistics.01-15-2009
20090018991QUERY REWRITE WITH A REMOTE OBJECT - A query statement, issued to a local database server, is re-written. The query references at least one of a first or a second object. The first object is remote with respect to the local database server, for accessing a first materialized view that is local or remote with respect to the local database server. The second object is local with respect to the local database server, to access a second materialized view that is remote with respect to the local database server. Rewriting the query can include dynamically tracking a staleness state associated with one or more of the materialized views.01-15-2009
20090018989USING SQL EXTENSIBILITY FOR PROCESSING DYNAMICALLY TYPED XML DATA IN XQUERY QUERIES - XQuery queries that include functions that operate on dynamically typed XML data are rewritten into compilable SQL constructs. XML data that is dynamically typed is XML data for which a specific XML data type cannot be determined at compile time and in fact may vary. In general, XQuery queries are rewritten into SQL queries that use SQL constructs in lieu of XQuery constructs. The SQL constructs include an “SQL polymorphic function” that is defined or recognized by a database system as valid syntax for an SQL query. The rewritten query applies the XML data to the SQL polymorphic function, but the XML data has been typed as XMLType, a data type recognized by SQL standards.01-15-2009
20090018996CROSS-CATEGORY VIEW OF A DATASET USING AN ANALYTIC PLATFORM - In embodiments, systems and methods may involve using a platform as disclosed herein for applications described herein where the systems and methods involve receiving a dataset in an analytic platform, the dataset including fact data and dimension data for a plurality of distinct product categories. It may also involve storing the data in a flexible hierarchy, the hierarchy allowing the temporary fixing of data along a dimension and flexible querying along other dimensions of the data. It may also involve pre-aggregating certain combinations of data to facilitate rapid querying, the pre-aggregation based on the nature of common queries. It may also involve facilitating the presentation of a cross-category view of an analytic query of the dataset. In embodiments, the temporarily fixed dimension can be rendered flexible upon an action by the user.01-15-2009
20090018995Semi-supervised visual clustering - A clustering system includes a visual mapping sub-system configured to display an N-dimensional to two- or three-dimensional mapping of items to be clustered, where N is greater than three, the mapping having mapping parameters for the N-dimensions. A user interface sub-system is configured to receive user inputted values for the mapping parameters, user inputted values selecting whether selected mapping parameters are fixed or adjustable, and user inputted values associating selected items with selected groups. An adjustment sub-system is configured to adjust the adjustable mapping parameters, without adjusting any fixed mapping parameters, to improve a measure of distinctness of one or more groups of items in the two- or three-dimensional mapping.01-15-2009
20090018994Time series data complex query visualization - A system and method provide a visual based query interface for time series data to facilitate entry of n query reference patterns and specification of temporal relationships between multiple such patterns.01-15-2009
20090018988METHOD AND SYSTEM FOR CREATING SEMANTIC RELATIONSHIPS USING HYPERLINKS - A method and system are disclosed for creating a hyperlink together with an associated semantic link between a source entity, and a target entity. The source entity includes descriptive text. The system includes means for selecting text within the source entity, and means for selecting the target entity. Also, means are provided for selecting a type of semantic link, and means are provided for creating a hyperlink between said selected text and said target entity. The system further includes means for creating a semantic link of said type between said source entity and said target entity, including means for including in the hyperlink a reference to said semantic link. In the preferred embodiment of the invention, the means for selecting the type of semantic link includes means for prompting a user to select from among a plurality of candidate types of semantic links.01-15-2009
20090018990Retrieving Electronic Documents by Converting Them to Synthetic Text - The present invention relies on the two-dimensional information in documents and encodes two-dimensional structures into a one-dimensional synthetic language such that two-dimensional documents can be searched at text search speed. The system comprises: an indexing module, a retrieval module, an encoder, a quantization module, a retrieval engine and a control module coupled by a bus. A number of electronic documents are first indexed by the indexing module and stored as a synthetic text library. The retrieval module then converts and input image to synthetic text and searches for matches to the synthetic text in the synthetic text library. The matches can be in turn used to retrieve the corresponding electronic documents. It should be noted that a plurality of matches and corresponding electronic documents may be retrieves ranked by order according the similarity of the synthetic text. In one or more embodiments, the present invention includes a method for indexing documents by converting them to synthetic text, and a method for retrieving documents by converting an image to synthetic text and comparing the synthetic text to documents that have been converted to synthetic text for a match.01-15-2009
20090037369Using sibling-count in XML indexes to optimize single-path queries - A method and apparatus are provided for using sibling-counts in XML indices to optimize single-path queries. Using a b-tree XML index with a SQL query logarithmically reduces the number of disk accesses by passing over index entries where it is determined that a match will not be found. However, because certain index entries are passed over, it is impossible to ascertain if a path expression occurs more than once in the XML index, as certain queries sometimes require. This hurdle can be overcome by maintaining a sibling count with each node entry in the XML index. Because the sibling count is stored with the index entry, the index will reveal whether the matching node is single or has other siblings. In additional to re-writing the original query for optimization by use of an XML index, it will be re-written to check for a single-path condition in the index.02-05-2009
20090327215LINEAR HINT VIDEO STREAMING - A streaming file is constructed with a file header section that includes a file header object, a media data file descriptor, and an index descriptor. A hinting index section includes a first level hinting index with a linear organization corresponding to timing tick key values. A second level hinting index has a non-sequential organization corresponding to such timing tick key values. A special mark in the second level hinting index indicates that the first level hinting index must be consulted for a next timing tick key value. Such mark is positioned in the last of a sequential run of timing tick key values associated with its entries. A data section that can be put in a separate file, and it accepts media data blocks associated in sequential runs of timing tick key values as its entries. Thus hinting is provided for a non-sequential media data file.12-31-2009
20080306905Electronic directory system - A reverse based Electronic directory system is disclosed in which a subscriber can record a number of individual contact details about themselves, such as their telephone numbers (all types, including business, office direct line, business mobile, VoIP, home, personal mobile, facsimile) and e-mail addresses. The system allows other users to use one of these personal details as a search term in order to obtain other personal details. The system further provides for the ability to set permissions on any detail (such as personal details), so that they are not released without its owner's explicit permission.12-11-2008
20080301086STREAMING MULTIDIMENSIONAL DATA BY BYPASSING MULTIDIMENSIONAL QUERY PROCESSOR - A data warehouse comprises a multidimensional data storage area to store multidimensional data and a transactional data storage area to store underlying transactional data from which the multidimensional data is generated. The data warehouse also comprises a multidimensional query processor to provide one or more interfaces to issue a first set of queries conforming to one or more multidimensional query languages to retrieve the multidimensional data from the multidimensional data storage area. Furthermore, the data warehouse comprises a dynamic query engine to provide an additional interface to issue a second set of queries that bypass the interfaces provided by the multidimensional query processor to retrieve the transactional data from the transactional data storage area, wherein the second set of queries do not conform to any of the one or more multidimensional query languages.12-04-2008
20080301085Dynamic Database File Column Statistics for Arbitrary Union Combination - Embodiments of the invention provide techniques for generating database statistics for optimizing union queries. In general, working sets including samples of values in database columns are persistently maintained in a database. To optimize a union query, the working sets describing the columns included in the union query are combined to generate an ad hoc working set. The ad hoc working set is then used to generate a database statistic describing the combined columns. In another embodiment, working sets may also be maintained for generating statistics for optimizing non-union queries, thus enabling statistics to be refreshed more frequently.12-04-2008
20090077016FULLY AUTOMATED SQL TUNING - Techniques are provided for a fully-automated process for tuning database query language statements that selects database query language statements for tuning, tunes the database query language statements and generates tuning recommendations, tests the tuning recommendations, and determines whether to implement the tuning recommendations based on the test results. The fully-automated tuning process may also automatically implement certain tuning recommendations and monitor the performance of the database query language statements for which tuning recommendations have been implemented.03-19-2009
20080256030FINE-GRAINED AUTHORIZATION FRAMEWORK - A system and method for controlling access to an instance method on an instance-specific basis by intercepting an invocation of the instance method on an instance.10-16-2008
20080256029PARTITION MANAGEMENT SYSTEM - A partition management system is disclosed for a database comprising at least one database table. The system comprises a partition controller arranged to automatically create at least one table partition in advance so that at least one table partition is available prior to when the table partition is required by the database. A corresponding method is also disclosed.10-16-2008
20080256028SYSTEM AND METHOD FOR ANALYZING AND CORRECTING RETAIL DATA - A computer system and method is disclosed that analyzes and corrects retail data. The system and method includes several client workstations and one or more servers coupled together over a network. A database stores various data used by the system. A business logic server uses competitive and complementary fusion to analyze and correct some of the data sources stored in database server. The data fusion process itself is an iterative one—utilizing both competitive and complementary fusion methods. In competitive fusion, two or more data sources that provide overlapping attributes are compared against each other. More accurate/reliable sources are used to correct less accurate/reliable sources. In complementary fusion, relationships modeled where data sources overlap are projected to areas of the data framework in which fewer sources exist—enhancing the accuracy/reliability of those fewer sources even in the absence of the other sources upon which the models were based.10-16-2008
20080256027SYSTEM AND METHOD FOR ANALYZING AND CORRECTING RETAIL DATA - A computer system and method is disclosed that analyzes and corrects retail data. The system and method includes several client workstations and one or more servers coupled together over a network. A database stores various data used by the system. A business logic server uses competitive and complementary fusion to analyze and correct some of the data sources stored in database server. The data fusion process itself is an iterative one—utilizing both competitive and complementary fusion methods. In competitive fusion, two or more data sources that provide overlapping attributes are compared against each other. More accurate/reliable sources are used to correct less accurate/reliable sources. In complementary fusion, relationships modeled where data sources overlap are projected to areas of the data framework in which fewer sources exist—enhancing the accuracy/reliability of those fewer sources even in the absence of the other sources upon which the models were based.10-16-2008
20080256024Portable and Iterative Re-Usable Suboptimization of Database Queries - A method, apparatus and program product to optimize a database query. A query plan is generated for the database query where the query plan includes first and second subplans. Cached optimization data associated with the first subplan and generated during evaluation of another query plan for a previous query that uses the first subplan is retrieved. The first subplan is evaluated for resource cost using the retrieved optimization data. The second subplan is also evaluated for resource cost. The query plan is then evaluated for resource cost based upon the evaluations of resource cost for the first and second subplans. A query plan is selected based on evaluations of resource cost and the plan is executed to generate a result set.10-16-2008
20080256023Method And System For Research Using Computer Based Simultaneous Comparison And Contrasting Of A Multiplicity Of Subjects Having Specific Attributes Within Specific Contexts - A method and system for an internet-based online research solution through the comparison and contrasting of a potentially infinite number of subjects having defined attributes within predefined as well as dynamic subject contexts; a method and system for searching a potentially infinite number of subjects against a customized set of attribute-value configurations to arrive at an appropriate set of subjects for further research; a method and system for an online research solution by which the user efficiently researches online using a highly customized search, collation, and compilation of comparison-contrast information; a Universal Research Framework that may be embedded within any externally managed information system and which enables the above three methods to be performed within the specific system for research.10-16-2008
20080243770Method for creating a scalable graph database - Embodiments of a method for creating a graph database which is arranged to store or process data in the form of graph tuples comprising n-parts, are described. In an embodiment, each tuple-part is encoded into a unique part identifier (hereinafter called a UPI), each UPI comprises a tag at a fixed position within the UPI. The tag indicates the datatype of the encoded tuple-part. The content data for the tuple-part is encoded in a code that is configured to reflect the ranking or order of the content data, corresponding to each datatype, relative to other tuples in a set of tuples. For content data that comprises a character-string, the code comprises a hashcode; and for content data that comprises or includes a numeric value, the code comprises an immediate value that directly stores the numeric value without encoding.10-02-2008
20080243769System and method for exporting data directly from deduplication storage to non-deduplication storage - A method, system, and computer-readable storage medium are disclosed for exporting data from a deduplication data store to a non-deduplication data store. A set of data may be stored in the deduplication data store in a format eliminating one or more duplicates of data objects in the set of data. The set of data in the deduplication data store may be stored separately from metadata describing the set of data. The set of data stored in the deduplication data store may be read. The set of data read from the deduplication data store and the metadata may be stored in a non-deduplication data store. In the non-deduplication data store, the set of data is stored in a format preserving the one or more duplicates of data objects in the set of data.10-02-2008
20080243767APPARATUS AND METHOD FOR CONSTRUCTING AND USING A SEMANTIC ABSTRACTION FOR QUERYING HIERARCHICAL DATA - A computer readable storage medium includes executable instructions to receive hierarchical data. A schema for the hierarchical data is also received. An entity relationship model for the hierarchical data is generated. A semantic abstraction associated with the entity relationship model is defined. An abstract term representing an underlying data element within the hierarchical data represented by the semantic abstraction is also defined.10-02-2008
20080243765METHOD FOR GENERATING NESTED MAPPING SPECIFICATIONS IN A SCHEMA MAPPING FORMALISM - A method for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification.10-02-2008
20080243762APPARATUS AND METHOD FOR QUERY BASED PAGING THROUGH A COLLECTION OF VALUES - A computer readable storage medium includes executable instructions to receive from a requester a query for objects within a system. An index for the objects within the system that match the query is generated. The index is segmented into pages. A set of page state queries is returned to the requester. The page state queries specify criteria for retrieving objects from segments of the index.10-02-2008
20080235183Workload Aware Checking of Database Reorganization - The present solution addresses the need to carry out reorganization of a database storage. A statistics-based reorganization check procedure is performed on at least first database tables and indexes, resulting in a preliminary reorganization recommendation. Information on workload on tables and indexes of said database storage is received. Based on the information on workload and the preliminary reorganization recommendation, it is decided whether to carry out reorganization of the database storage in accordance with the preliminary reorganization recommendation.09-25-2008
20080235181Query Expression Evaluation Using Sample Based Projected Selectivity - Methods, systems, and computer program products are provided for query expression evaluation for query optimization. Embodiments include receiving a query including a plurality of predicates; creating a truth table representing the possible solutions to the query; identifying a plurality of intersections of the truth table, the plurality of intersections including each predicate of the query; assigning a selectivity factor to each predicate; determining in dependence upon the selectivity factors for each predicate a selectivity rating for each of the intersections of the truth table; selecting one or more of the intersections in dependence upon the selectivity rating; and determining in dependence upon the selected intersections a percentage of rows in a database table returned by the query; and providing the percentage of rows in the database table to an access plan generator for query optimization.09-25-2008
20080235179IDENTIFYING EXECUTABLE SCENARIOS IN RESPONSE TO SEARCH QUERIES - Systems, methods, and computer-readable media for identifying executable scenario solutions relevant to a user query and returning such executable scenario solutions as search results in response to the user query are provided. Upon receiving a user query, a plurality of results is returned, each result being representative of a series of steps which may be implemented to address a particular issue relevant to the received user query. Often, a series of steps or scenario includes a number of sub-scenarios, each of which is to be executed sequentially to achieve the desired result. Accordingly, upon selection of a particular search result, the user may be guided through a series of sub-scenario result options until an item having direct association to a series of steps is selected. Once selected, the executable scenario solution is presented to the user for execution.09-25-2008
20080228697View maintenance rules for an update pipeline of an object-relational mapping (ORM) platform - A database update pipeline may be incorporated into a data access architecture for providing data services to applications, thereby bridging the gap between application data and data as persisted in databases. The update pipeline has the ability to translate changes made to object instances into data store change constructs, and carry those changes over to a data store. Such a pipeline can also advantageously perform the reverse operation, allowing applications to query using the database update pipeline, and receive materialized object instances.09-18-2008
20080249980METHOD FOR CLASSIFYING TERMS OF LEGAL DOCUMENTS - A method for classifying terms and conditions of legal documents is provided. The method includes the steps of: standardizing terms and conditions of all of the legal documents stored in a database; classifying the all of the legal documents having standardized terms and conditions into different categories according to different areas of practices; extracting universal terms and conditions of each of the categories; extracting universal terms and conditions of all of the legal documents in all categories; and extracting categorical terms and conditions of each of the categories.10-09-2008
20080222092AUTOMATICALLY DETERMINING OPTIMIZATION FREQUENCIES OF QUERIES WITH PARAMETER MARKERS - A method and system for automatically determining optimization frequencies of queries having one or more parameter markers. Execution plans for a query are generated and each plan is associated with one or more bind value sets. An optimization frequency is selected based on differences between pairs of execution costs where one execution cost of a pair is a cost of executing the query with a bind value set via a first execution plan and the other execution cost of the pair is a cost of optimally executing the query with the bind value set via a second execution plan. The differences are based on maximum selectivity or cardinality distances associated with the bind value sets. If none of the differences exceeds a predefined value, the query is optimized once. If at least one of the differences exceeds the predefined value, the query is reoptimized each time the query is executed.09-11-2008
20080222088Apparatus and Methods for Generating an Implicit Vote for a Media Item Based on User Behavior Relative to a Media Client - A method of generating an implicit vote for a media item based on user behavior may comprise recording information identifying a first set of user inputs to a media client associated with playing of a first media item, receiving and storing an explicit vote for the first media item, and storing information that correlates a user input from the first set of user inputs with the explicit vote. The first set of user inputs may comprise at least one user input. The method may comprise recording information identifying a second set of user inputs to the media client associated with playing of a second media item, wherein the second set of user inputs may comprise at least one user input matching the stored correlated user input. The method may comprise generating an implicit vote for the second media item based on the stored information correlating the stored correlated user input with the explicit vote.09-11-2008
20100030733Transforming SQL Queries with Table Subqueries - A computer automated technique for rewriting SQL with table subqueries into more optimal table expression equivalents without derived tables. The context of the table subqueries, including any join and filter predicates are moved to the encompassing outer query. The advantage of this technique is to provide optimized source SQL to the relational database optimizers.02-04-2010
20090192981Query Deployment Plan For A Distributed Shared Stream Processing System - A method of providing a deployment plan for a query in a distributed shared stream processing system includes storing a set of feasible deployment plans for a query that is currently deployed in the stream processing system. A query includes a plurality of operators hosted on nodes in the stream processing system providing a data stream responsive to a client request for information. The method also includes determining whether a QoS metric constraint for the query is violated, and selecting a deployment plan from the set of feasible deployment plans to be used for providing the query in response to determining the QoS metric constraint is violated.07-30-2009
20080215538DATA ORDERING FOR DERIVED COLUMNS IN A DATABASE SYSTEM - Optimized query execution is disclosed for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data.09-04-2008
20080215536AUTONOMICALLY GENERATING A QUERY IMPLEMENTATION THAT MEETS A DEFINED PERFORMANCE SPECIFICATION - A database query optimizer allows specifying a performance specification for a query. When an access plan is created, the actual performance for executing the query using the access plan is determined and compared to the performance specification for the query. If the actual performance does not satisfy the performance specification for the query, the query optimizer autonomically generates a different access plan to see if the performance improves. If an access plan that meets the performance specification is generated, the new access plan is stored in the access plan cache for the query. If no access plan can be generated that meets the performance specification for the query, the access plan that provided the best performance is selected and stored in the access plan cache for the query.09-04-2008
20080215533Method for interfacing application in an information search and retrieval system - In a method for interfacing search, analysis, and report applications in an information search and retrieval system with a complex structured record or content repository, a schema discovery is performed on the basis of a search application, schema paths associated with a search result are extracted, and summary information of the extracted schema paths is computed.09-04-2008
20080215532DATABASE OPTIMIZATION THROUGH SCHEMA MODIFICATION - A database optimizer collects statistics regarding applications accessing a database, and makes one or more changes to the database schema to optimize performance according to the collected statistics. In a first embodiment, the optimizer detects when a certain type of application accesses the database a percentage of time that exceeds a predefined threshold level, and if the data in the database is stored in a less-than-optimal format for the application, the data type of one or more columns in the database is changed to a more optimal format for the application. In a second embodiment, the optimizer detects when one type of application accesses a column a percentage of time that exceeds a first predefined threshold level and is less than a second predefined threshold level, and creates a new column in the database so the data is present in both formats.09-04-2008
20080215530METHOD FOR USING TWO-DIMENSIONAL DYNAMICS IN ASSESSING THE SIMILARITY OF SETS OF DATA - A method for finding sets of data (SDDs) for presentation in two-dimensions, which are similar to a target SDD, is invented. The method leverages a new category of signatures, called equivalence signatures, to characterize the SDDs. The equivalence signature is computed as the action for the motion of a string which sweeps out a sheet specified by the values of the digital data. These signatures have the salient feature that, at worst, they change in a bounded manner when small changes are made to the SDDs and when used to find SDDs that are similar to a target SDDs, they allow for a significant reduction in the number of SDDs to be compared with the target. This is an improvement over the state of the art wherein the computational expensive process of performing a complete search against the entire corpus must be applied.09-04-2008
20080215529METHOD FOR USING LENGTHS OF DATA PATHS IN ASSESSING THE SIMILARITY OF SETS OF DATA - A method for finding sets of data (SDDs) for presentation in one-dimension, which are similar to a target SDD, is invented. The method leverages a new category of signatures, called equivalence signatures, to characterize the SDDs and is applicable to all types of data with special interpretation for data that may be presented in two-dimensions. These signatures have the salient feature that, at worst, they change in a bounded manner when small changes are made to the SDDs and when used to find SDDs that are similar to a target SDDs, they allow for a significant reduction in the number of SDDs to be compared with the target. This is an improvement over the state of the art wherein the computational expensive process of performing a complete search against the entire corpus must be applied.09-04-2008
20080208799DIRECT CALL THREADED CODE - A pre-pass and direct call mechanism which replaces the interpreter. The mechanism moves static decisions out of the repeated runtime path, into a pre-pass operation. Advantageously, the mechanism reduces runtime overhead, and improves overall performance of the DBMS during runtime, while maintaining the considerable investment in opcode generation and plan representation, already invested in the implementation of the DBMS.08-28-2008
20080201298 ADMINISTRABLE COMMAND LINE INTERFACE - A command line interface administration for a data processing system is provided. According to one embodiment, a method for an improved command line interface for a data processing system in a telephony device is provided. The method comprising administering a language definition for an improved command line interface, the improved command line interface having a command and a keyword and storing the language definition.08-21-2008
20080201297Method and System for Determining Relation Between Search Terms in the Internet Search System - A method of determining a relation between search queries, includes: maintaining a database comprising a search session and a record about a search query which is received from a user terminal during the search session; recording and maintaining click rate information for each of the search queries in a predetermined storage unit; generating total search session number information by counting a total number of search sessions which is set during the time interval generating first search session number information by counting a number of search sessions where a first search query is received during the time interval, and generating second search session number information by counting a number of search sessions where a second search query is received during the time interval, by referring to the database; generating third search session number information by counting a number of search sessions where the first search query and the second search query are received during the time interval, by referring to the database; generating conditional probability information by using the first search session number information and the third search session number information; generating correlation information by using the total search session number information, the first search session number information, the second search session number information, and the third search session number information; querying click rate information of the second search query by referring to the storage unit; and determining a relation between the first search query and the second search query, based on the conditional probability information, the correlation information, and the click rate information.08-21-2008
20080201296Partitioning of nested tables - Techniques for partitioning nested tables are provided. A parent table includes a column for collection items. A nested table is created for storing items that belong to the collection items. The nested table is partitioned to create a plurality of nested table partitions. Each nested table partition is a distinct, separately stored structure within a database. How the nested table is partitioned may, or may not, be based on how the parent table is partitioned. For example, a nested table may be partitioned based on the same criteria in which the parent table is partitioned. As another example, a nested table may be partitioned, whereas the parent table is not partitioned.08-21-2008
20080201295CACHING PLANS WITH USING DATA VALUES - A method of selecting for use a stored execution plan for a dynamic SQL query within a database system. Respective selectivity values are maintained that are associated with one or more predicates in the dynamic SQL query for respective historical data values. Respective confidence level values are maintained that are associated with one or more of the selectivity values. One or more data values are received with which to execute the dynamic SQL query. Respective selectivity values are calculated for one or more of the predicates in the dynamic SQL query for the received data value(s). The stored selectivity values are compared with respective corresponding calculated selectivity values. A stored execution plan is selected for use on detecting substantial equality between the respective pairs of compared values.08-21-2008
20080201294Community-Based Strategies for Generating Reports - A strategy is described for maintaining a plurality report logic units in a network-accessible community report system. An agnostic reporting module in a local environment can peruse the reports offered by the community report system and download a report logic unit corresponding to a selected report. The reporting module generates the report using a mapping module. The mapping module maps data fields identified in the downloaded report logic unit to one or more data sources. The mapping module uses a data connector to establish a link between the data fields and data sources. This strategy provides a mechanism by which an entity can be conveniently informed of relevant issues that may affect it.08-21-2008
20090164417TOPICAL SENTIMENTS IN ELECTRONICALLY STORED COMMUNICATIONS - The present application presents methods for performing topical sentiment analysis on electronically stored communications employing fusion of polarity and topicality. The present application also provides methods for utilizing shallow NLP techniques to determine the polarity of an expression. The present application also provides a method for tuning a domain-specific polarity lexicon for use in the polarity determination. The present application also provides methods for computing a numeric metric of the aggregate opinion about some topic expressed in a set of expressions.06-25-2009
20090063404SELECTION OF A SET OF OPTIMAL N-GRAMS FOR INDEXING STRING DATA IN A DBMS SYSTEM UNDER SPACE CONSTRAINTS INTRODUCED BY THE SYSTEM - The present invention provides a computer-readable medium and system for selecting a set of n-grams for indexing string data in a DBMS system. Aspects of the invention include providing a set of candidate in grams, each n-gram comprising a sequence of characters; identifying sample queries having character strings containing the candidate n-grams; and based on the set of candidate n-grams, the sample queries, database records, and an n-gram space constraint, automatically selecting, given the space constraint, a minimal set of an n-grams from the set of candidate n-grams that minimizes the number of false hits for the set of sample queries had the sample queries been executed against the database records.03-05-2009
20080313135METHOD OF IDENTIFYING ROBUST CLUSTERING - A method of finding robust clusters comprises the use of principal component analysis and consensus ensemble clustering. In another aspect, the method may comprise normalizing a data set; identifying attributes of the data set that contribute to most of variation in the normalized data set; selecting data having the attributes that contribute to most of variation in the normalized data set; identifying a plurality of clusters from the selected data using consensus ensemble clustering; and identifying robust clusters from the plurality of clusters. The method can be used in healthcare and life science.12-18-2008

Patent applications in class Access augmentation or optimizing