Abstract: There is disclosed a method of managing a database of positioning data, the positioning data including electromagnetic signal source data for use by a positioning system, and the method comprising: receiving signal data relating to signals received from a plurality of electromagnetic signal sources; associating an appropriate one of a plurality of zone identifiers with each of the electromagnetic signal sources, each zone identifier being associated with a respective geographical zone; selecting a subset of the plurality of electromagnetic signal sources in dependence on their associated zone identifiers; processing the signal data relating to the subset of the plurality of electromagnetic signal sources to compute position estimates of the electromagnetic signal sources; and updating the database of electromagnetic signal source data in dependence on the computed position estimates.

Abstract: An image is built. The building of an image includes selecting an image to be built, performing a hashing function on the image to produce a checksum, querying a registry for an existing image including the same checksum, and if no existing image including the same checksum is found, acquiring a parent image for the image to be built, building the image to produce a built image, adding the checksum for the image to the built image, and storing the built image in the registry.

Abstract: Partial-image search criteria are derived that include a combination of multiple partial-image user selections of portions of at least one image. Visual search results are returned responsive to a search for images that correspond to the derived partial-image search criteria. The visual search results include at least one identified image that includes features that correspond to the derived partial-image search criteria that include the combination of the multiple partial-image user selections.

Abstract: A first command may be received from a client computing platform. The first command may include a proxy image. The proxy image may represent an image stored on the client computing platform. An identifier may be associated with the proxy image. The identifier may be transmitted to the client computing platform. The identifier may be associated with the image stored on the client computing platform. Edits to the image based upon the proxy image may be determined at a remote computing platform. Instructions may be transmitted from the remote computing platform to the client computing platform. The instructions may include the identifier. The instructions may be configured to cause the client computing platform to process the edits on the image.

Abstract: A system that incorporates teachings of the present disclosure may include, for example, a system having a controller to collect one or more user-generated comments from each of a plurality of computing devices, detect a correlation in the one or more user-generated comments collected from the plurality of computing devices, and establish a social network between the plurality of computing devices according to the detected correlation. The one or more user-generated comments can be temporally associated with media content presented at the plurality of computing devices. Other embodiments are disclosed.

Abstract: A method, apparatus, and system for automatically determining an optimal database subsection is provided. A database subsection is selected to optimize certain benefits when the database subsection is translated, transferred, and cached on an alternative database system, which may utilize a different technology or database engine that provides certain performance benefits compared to the original database system. Algorithms such as multi-path greedy selection and/or dynamic programming may provide optimal or near-optimal results. A host for the alternative database server may be shared with or otherwise located in close physical proximity to improve latency for a database application or client layer. Once the database subsection analysis is completed, a report may be generated and presented to the user, and an implementation script may also be created to automatically configure a client host to function as a cache or replacement system according various cache size configurations described in the report.

Abstract: A system for archiving data objects using secondary copies is disclosed. The system creates one or more secondary copies of primary copy data that contains multiple data objects. The system maintains a first data structure that tracks the data objects for which the system has created secondary copies and the locations of the secondary copies. To archive data objects in the primary copy data, the system identifies data objects to be archived, verifies that previously-created secondary copies of the identified data objects exist, and replaces the identified data objects with stubs. The system maintains a second data structure that both tracks the stubs and refers to the first data structure, thereby creating an association between the stubs and the locations of the secondary copies.

Abstract: In some examples, a plurality of content properties may be used for managing indexing of object data, such as a plurality of files. Each content property may include an expression for extracting data values from specific data fields in the object data. Further, each content property may include a name that may be used for indexing the objects using the extracted data values. For instance, multiple content properties may have the same name, but may each have different expressions for extracting different data values from different data fields. Accordingly, the content properties may be used to extract desired data values from the objects for indexing. When a search query is received including a content property name and a specified value, one or more of the objects that are indexed with the specified value may be searched.

Abstract: Disclosed herein are system, method, and computer program product embodiments for utilizing an intrusive data hash table to support processing transactions. An embodiment operates by receiving a transaction comprising a plurality of operations. Responsive to the receiving, the transaction is verified by verifying the validity of the plurality of operations. Responsive to verifying the transaction, the transaction is applied to the intrusive hash table.

Abstract: A method, computer program product and apparatus provide an improved data structure for storing key-value pairs. The data structure comprises six arrays. The method, computer program product and apparatus provide for efficient searching, adding, removal, and iteration of elements. The data structure utilizes a scaled hash code and may store multiple values associated with a same scaled hash code. The required memory is allocated at the time of instantiation, resulting in improved performance. An insertion time of a new key-value pair is a linear function of the total number of key-value pairs.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A system and method for storing, reading, and updating data structures in a database. The system and method can include storing an entry in a structure table for each data structure, where each data structure is associated with a unique identifier. The system and method can also include storing an entry for each field of a data structure in n field table corresponding to a data type of the field, where the entry for each field is associated with the unique identifier of the data structure. A field for a data structure can be accessed by searching the appropriate field table for the unique identifier of the data structure. Additionally, the data structure can be updated by adding a new entry in the structure table and new entries in the field tables.

Abstract: A tokenization environment includes a first tokenization system in a first token domain and a second tokenization system in a second token domain. A token mapper accesses a first token from the first tokenization system and maps it to a second token from the second tokenization system. The first token can be a single-use or SLT token mapped to a clear text value within a single-use token table in the first tokenization system. The token mapper can identify the clear text value, and can query a multi-use token table in the second tokenization system with the clear text value to identify a multi-use token (the second token) mapped to the same clear text value. The token mapper can store the association between the first token and the second token in a token map.

Abstract: Described are methods, systems and computer readable media for a permissions system including relationships of partitioning, grouping, and the application of access control deferred filters.

Abstract: A distributed shared-nothing database provides serializable isolation for transactions and includes a mechanism for adding storage and processing capacity to the database without stopping the database from processing transactions.

Abstract: Disclosed are techniques employed alone or in combination, to further enhance a database language and improve conciseness and comprehensiveness of query statements in application code. Embodiments may build upon an initial extension of database language to accommodate concepts of entity-relationship models (ERMs). That initial extension may include entities with structured types, and named associations. One technique modifies SQL to allow the SELECT command to specify element path expressions based upon a relationship (e.g. named associations between ERM elements). Another technique modifies SQL to introduce filter expressions suffixed to associations within path expressions, thus improving adherence to the principle of locality within query statements. Yet another technique allows a shorthand to “factor out” association path prefixes, thereby avoiding lengthy lists of path expressions in order to read several elements from the same nested structure or a same target entity behind a single association.

Abstract: A computer-implemented method for optimizing a queue of queries for database efficiency is implemented by a controller computing device coupled to a memory device. The method includes receiving a plurality of database queries at the computing device from at least one host, evaluating the plurality of database queries to determine a resource impact associated with each database query of the plurality of database queries, prioritizing the plurality of database queries based upon a set of prioritization factors and the resource impact associated with each database query, and submitting the prioritized plurality of database queries to a database system for execution. The database system executes the plurality of database queries in order of priority.

Abstract: An apparatus for conducting a hierarchical join on a hierarchically clustered data stream is disclosed. The apparatus may include a memory storing query conditions that each determine whether a Structured Query Language query is suitable for performing a non-buffering read operation on a hierarchical data storage. A processor in communication with the memory may be configured to receive a Structured Query Language (“SQL”) query from a client device and evaluate the SQL query for one or more of the query conditions stored in the memory. When the processor determines that the SQL query satisfies one or more of the query conditions, the processor may then perform a non-buffering read operation on the hierarchical data storage to obtain a hierarchically clustered data stream. The hierarchically clustered data stream may be evaluated to obtain a plurality of record results, which may be transmitted to the client device.

Abstract: The invention relates to a method and system that provide a high performance and extremely scalable triple store within the Resource Description Framework (or alternative data models), with optimized query execution. An embodiment of the invention provides a data storage and analysis system to support scalable monitoring and analysis of business processes along multiple configurable perspectives and levels of granularity. This embodiment analyses data from processes that have been already executed and from ongoing processes, as a continuous flow of information. This embodiment provides defining and monitoring processes based on no initial domain knowledge about the process and such that the process will be built only from the incoming flow of information. Another embodiment of the invention provides a grid infrastructure that allows storage of data across many grid nodes and distribution of the workload, avoiding the bottleneck represented by constantly querying a database.

Abstract: A database management system (DBMS) generates a query execution plan including information representing one or more database (DB) operations necessary for executing a query, and executes the query in accordance with the query execution plan. In the execution of the query, the DBMS dynamically generates tasks for executing the DB operations and executes the dynamically generated tasks. The query execution plan includes a plurality of query blocks, which are sets of one or more DB operations. When newly generating a task, the DBMS executes determination processing of simultaneous-task-generation number. The determination processing of simultaneous-task-generation number is to calculate, targeting each of the query blocks, the number of simultaneous task generation, which is the number of tasks simultaneously generatable as tasks for executing the query block. The number of the dynamically generated tasks is equal to or smaller than the number of simultaneous task generation.

Abstract: A computer-implemented method for scanning a file is described. A Golomb-Compressed Sequence (GCS) index may be queried to determine whether GCS data is associated with the scanned data. The GCS index may be stored in a first storage medium and the GCS data may be stored in a second storage medium. The second storage medium may be different from the first storage medium. Upon determining the GCS data is associated with the scanned data, the location of the GCS data associated with the scanned data may be identified. The GCS data may be retrieved from the identified location. At least a portion of the retrieved GCS data may be analyzed. Based on the analysis of the retrieved GCS data, it may be determined whether to perform additional data querying.

Abstract: A data analysis system is proposed for providing fine-grained low latency access to high volume input data from possibly multiple heterogeneous input data sources. The input data is parsed, optionally transformed, indexed, and stored in a horizontally-scalable key-value data repository where it may be accessed using low latency searches. The input data may be compressed into blocks before being stored to minimize storage requirements. The results of searches present input data in its original form. The input data may include access logs, call data records (CDRs), e-mail messages, etc. The system allows a data analyst to efficiently identify information of interest in a very large dynamic data set up to multiple petabytes in size. Once information of interest has been identified, that subset of the large data set can be imported into a dedicated or specialized data analysis system for an additional in-depth investigation and contextual analysis.

Abstract: A system receives a search query from a user and searches a group of repositories, based on the search query, to identify, for each of the repositories, a set of search results. The system also identifies one of the repositories based on a likelihood that the user desires information from the identified repository and presents the set of search results associated with the identified repository.

Abstract: Systems and methods are disclosed for data management and visualization. In accordance with one implementation, a method is provided that includes, for example, receiving data from one or more sources, the data being associated with a plurality of locations. The method also includes receiving, based on input from a user, a selection of a set of metrics for scoring each of the plurality of locations and a weight to assign to each metric. In addition, the method includes calculating an overall score for each of the plurality of locations based on the received data, the selected set of metrics, and the weight assigned to each metric.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for ranking query completions based on activity session data. One of the methods includes receiving a query prefix from a user. A reference parameter for the user is obtained. One or more likely queries that are likely to co-occur with the reference parameter in user activity sessions are identified, wherein each likely query has an associated prediction score. A ranking of the one or more likely queries is provided in response to receiving the query prefix.

Abstract: A computer receives a request from a client application for data within an enterprise grid. The computer sends the data along with a program to monitor the application's use of the data. The computer subsequently receives from the program a subset of the data being utilized by the client application. Responsive to a subsequent request for the data, the computer sends to the client application only the data corresponding to the identified subset of data being utilized.

Abstract: Embodiments provide a data caching mechanism based on a user's request (query) to a remote database, and the corresponding response (query result) received therefrom. As part of a database query, the user can define cache parameter(s). When a viable communications link becomes available to access the remote database, volumes of relevant data are returned as a query result and cached locally according to those predefined cache parameter(s). Embodiments are particularly suited to allow a mobile device to interact with data of a remote database in an efficient and reliable manner. The mobile device's small form factor, may preclude local storage of large volumes of remotely stored data. However, this can be compensated for by selectively storing data in the cache memory according to user-specified parameters, allowing the mobile device to continue to have access to relevant information in the event that communication with the remote database is degraded or lost.

Abstract: The present invention relates to a system and method for pre-processing the data and storing the pre-processed data based on its type at the time of storage. During the pre-processing time, the system extracts all the relevant information such as entities, events/time stamped data, domain specific associations from the received content and stores them separately in a different data store. The system also generates different views based on the correlation between the identified entities, events and domain specific associations using data folding techniques. The system also stores the created views in a separate data store such as a view store, wherein the view store is optimized to serve end user queries by traversing through the stored views.

Abstract: A computer system for calculating a quantity from a set of input values. The computer system comprises a database that is configured to store a sequence of first input values xn wherein n=1, 2, . . . i, wherein for any value of n, xn lies between xn+1 and xn?1 in the sequence. Each value of x has associated with it a second input value yn, a conversion value pn that is calculated from yn according to a conversion algorithm, and an output value zn, wherein zn=zn?1+pn. The database is configured to store the plurality of output values zn.

Abstract: Embodiments of the invention are directed to systems, methods and computer program products for converting MLOAD and TPUMP operations. In some embodiments, a system is configured to: receive a first information, wherein the first information comprises at least one piece of data; count the number of pieces of data; compare the counted number of pieces of data to a predetermined threshold value; and identify a load utility based on the comparison between the counted number of pieces of data and the predetermined threshold value.

Abstract: A system and method are described herein that provide for visualizing business objects stored in a backend system in database model views for display as nodes in a user interface. Business objects are retrieved from the backend system, with metadata from the business objects being customized and sorted into a plurality of node types. Each business object may be displayed in a user interface as a node along with other nodes generated from the database model views. The nodes represented by the business objects may be connected by edges that provide for an interconnection between each of the nodes. The edges may be customized by providing directional components to the edges to demonstrate the relationship between the displayed nodes.

Abstract: An operation method and apparatus for a data storage system are provided, which relate to the field of data storage and enhance efficiency of a read operation on distributed stored data. The method includes: receiving, by a data node, a data operation message, where the data operation message carries a data operation type and a data object of an operation; querying a state parameter of the data object, where the state parameter is allocated to the data node by a management node, and is used to indicate an update state of the data object, and the update state includes a synchronous state, a semi-synchronous state and an asynchronous state; and if the state parameter is the synchronous state and the operation type is a read operation, reading the data object stored by the data node. Embodiments of the invention are used to operate data in a distributed data storage system.

Abstract: A replication chain comprising one or more replication nodes of a multi-tenant stream management system is assigned to store data records of a partition of a particular data stream. A data record of the partition is received at a selected replication node of the replication chain. In a sequential order, a respective replica of the data record is stored at each replication node of the chain. An acknowledgement of a successful storage of the data record is provided after the replications are completed.

Abstract: A plurality of servers are each coupled to a different one of a plurality of databases that are synchronized with each other. A search request specifying a search range is sent from a search-requesting device to the servers. Each server calculates a search subrange from the search range specified in the search request received from the search-requesting device, performs a data search operation only within the calculated search subrange of the database coupled thereto, and sends a search result back to the search-requesting device.

Abstract: A CAS data storage method and apparatus comprising: receiving input data including a succession of data items with corresponding logical addresses at a source CAS data storage space for storage therein and for replication at a destination CAS data storage space, generating a hash key for each data item at the source storage space, comparing respective hash keys with hash keys stored at a hash key storage table, to determine whether respective further data items are already present at the destination storage device; transferring respective data items to the destination storage space if no match is made to a hash key stored at the hash key storage table, but not transferring respective further data items if a match is made to a hash key stored at the hash key storage table, thereby transferring to the destination storage space only unique data items.

Abstract: In a system comprising a production environment and a replication environment, a method and program product for dynamically switching from an asynchronous replication policy to a synchronous replication policy. In a system comprising a production environment and a replication environment, a method for dynamically switching from a synchronous replication policy to an asynchronous replication policy.

Abstract: According to one aspect, embodiments of the invention provide a sequence engine comprising a local queue configured to receive captured data in a first sequence, the captured data including a plurality of individual messages, each message including sequence information representative of a chronological order in which the messages was captured, a coupling facility in communication with the local queue, the coupling facility comprising a plurality of data tables wherein a first one of the plurality of data tables is configured to store the captured data in the first sequence, and a dispatcher in communication with the plurality of data tables and configured to resequence, based on the sequence information, the captured data into a second sequence, wherein the second sequence corresponds to the chronological order in which the plurality of individual messages were captured, and to forward the captured data to a destination database in the second sequence.

Abstract: A data model for managing identity and access management (IAM) data implemented at an electronic database may include a set of logical resource elements, a set of physical resource elements, and a set of access requests elements that respectively model logical resources, physical resources, and access requests received at an access request manager of an enterprise. The physical resource elements may be respectively associated with the logical resource elements such that access rights for the physical resources may be obtained based on a logical resource specified in the access request. A system for managing IAM may include a mapping module configured to transform heterogeneous IAM data provided by a plurality of IAM data sources into homogeneous IAM data formatted according to the common IAM data format. A data store may implement the IAM data model such that the data store is configured to store the homogeneous IAM data.

Abstract: An automated method of detecting and reporting exceptions to a plurality of real-world processes, designed to combine the real-time speeds of automated transaction processing systems with the in depth analysis of automated business intelligence systems. The system operates by storing input data in the form of process agnostic database system (PADS) objects, configured to accept data without limitation as to specific process, and design to allow flexible automated linking between various things, activities, and processes to any desired depth. The system operates by analyzing real-time input data against various exception criteria, thereby determining exception marked objects, and then using linkages between different PADS objects to immediately determine the impact of these exceptions on other activities and processes.

Abstract: Processing data of a data warehouse is provided and includes receiving, by a processing device, user input to create simple filter objects. Each filter object defines an ad hoc subset of a respective dimension of a dimension table of the data warehouse. User input is received to create a filtered operation object that specifies an operation and a plurality of the simple filter objects. The ad hoc subset differs from all subsets defined in the dimension table.

Abstract: Systems and methods for collecting, classifying and organizing user information into a dynamically-updated user profile are provided. Information pertaining to a user is obtained from one or more data sources, and the information is then classified into specific categories using field mapping and other techniques, after which it is organized into a user profile and securely stored in a database. The user profile is dynamically-updated by automatically detecting and storing updates to the information in the user profile based on user interactions, communications and other online or electronic activities. Information is instantaneously collected from user-completed electronic form input fields which is mapped back to the user profile. The user profile is a single, comprehensive source of user information that is securely stored and available to the user in any location and for any purpose, such as automatically and instantaneously populating fields of an electronic document, form or web-based application.

Abstract: A system and method for dynamic, semi-supervised clustering comprises receiving data attributes, generating a set of ensemble partitions using the data attributes, forming a convex hull using the set of ensemble partitions, generating a simplex vector by performing ensemble clustering on the convex hull, receiving dynamic links, deriving an optimal simplex vector using the simplex vector and the dynamic links, computing a current optimal clustering result using the optimal simplex vector, and outputting the current optimal clustering result.

Abstract: Various embodiments disclose methods and systems to categorize automatically a merchant listing. In one example, the method includes determining a first category identifier for the merchant listing by performing a first search to compare the first category identifier with a plurality of category identifiers in a first database. Based on a determination that no match was found as a result of the first search, a second search is performed to compare the first category identifier with a plurality of category relationships in a second database. A second category identifier of the merchant listing is provided in response to a match being found in the second search and the second category identifier is associated with the merchant listing. Other methods and systems are disclosed.

Abstract: This disclosure relates to systems, methods, and computer readable media for performing multi-format, multi-protocol personalized message threading in a way that is most beneficial for the individual user. Users desire a system that will provide for ease of message threading by “stitching” together related communications in a manner that is seamless from the user's perspective. Such stitching together of communications across multiple formats and protocols—in conjunction with the use of contextual learning techniques and/or personalized index search parameter weighting techniques—may facilitate the providing of personalized query result sets to users of such systems. Personalized results may be based, at least in part, on, e.g.

Abstract: A system and method provide for querying a knowledge base. The knowledge base includes a plurality of layers, each layer corresponding to a different type of information, such as user's intent, lack of knowledge, and specific issue. The system includes categorization rules for categorizing at least a part of a user's request according to the types of information and for mapping the request to respective layers of the knowledge base. The user's request is categorized with the categorization rules and mapped to one of the layers of the knowledge base, based on the categorization. A search is conducted for responsive problem descriptions among the problem descriptions in that layer. The system and method can thus provide for differential searching of the knowledge base, depending on the type of information being sought.

Abstract: The present invention includes an expert system in which a search index furnishes answers to incoming queries provided in natural language. A search index for a specific field contains components that facilitate selecting a best fitting stored answer to the incoming query. Furthermore, context of the incoming query (e.g. location of the user, a current web page or service being used/viewed by the user, the time, etc.) may be considered when selecting a best fitting answer. A language specific storehouse of weighted words and a private storehouse of weighted words associated with a field-specific search index provide the basis for evaluating the significance level of a natural language word of a query. Again, context of the incoming query may be considered when evaluating the significance level of a natural language word of a query. Irrelevant portions of an incoming query may first be deleted from the inquiry prior to processing.

Abstract: An electronic device includes a receiving unit, a searching unit, a storing unit, and a displaying unit. The receiving unit receives a search character string. The searching unit searches a dictionary database according to the received search character string. The storing unit stores headwords which are obtained by the searching unit in a memory as search history data. The displaying unit displays a search history graph based on the search history data. Marks are arranged in the search history graph. The marks show positions of headwords searched for in past times, within a range of headwords collected in the dictionary data.

Abstract: A method for summarizing topology transparent zone (TTZ) traffic engineering (TE) information, comprising computing a TE link state for every TE link internal to a TTZ from a root node to one or more non-root edge nodes, wherein the TE link state comprises the maximum bandwidth of the link, summarizing the computed TE link state information and storing the summary in a memory, and distributing at least a portion of the information in the summary to at least one neighboring node external to the TTZ connected to the root node via an external link.

Abstract: Example signature comparison methods disclosed herein include accessing a first set of values from a query signature based on a first index value, the first set of values determined based on a corresponding set of first angles between a first reference line and respective first lines tangent to first functions defined from first frequency band values determined for monitored audio. Disclosed example methods also include accessing a second set of values from a reference signature based on the first index value. Disclosed example methods further include computing a first correlation coefficient based on the first and second sets of values, and comparing a set of correlation coefficients including the first correlation coefficient to a threshold to determine whether the query and reference signatures match.

Abstract: A host computing device includes a communication subsystem for communicatively coupling the host computing device to one or more user computing devices. The host computing device includes a logic subsystem and a storage subsystem containing instructions executable by the logic subsystem to send a musical soundtrack matching graphical user interface to the one or more user computing devices. The musical soundtrack matching graphical user interface comprises a plurality of user-selectable musical arc descriptor selectors configured to receive input of a user-selected musical arc descriptor selection, wherein each of the user-selectable musical arc descriptor selectors corresponds to a different one of a plurality of musical arc characteristics. The musical soundtrack graphical user interface further includes a results region displaying one or more musical tracks that embody the user-selected musical arc descriptor selection.