Abstract: A Database method for a B+ tree based on a PRAM. The database method divides each node into two areas, area 1 and area 2. A key value is inserted/retrieved/deleted for the each node. Inserting the key value requires firstly inserting a new key value to area 2 if area 2 in the node is not in a full state. Retrieving the key value requires identifying whether the node is a leaf node. If the node is a leaf node, the key value is retrieved from area 1 and area 2 sequentially. Deleting the key value requires merging area 1 and area 2 in the node, and deleting the key value in the merged node. The method enhances durability and data processing capability.

Abstract: A method of garbage collection in a storage device including a central processing unit (CPU), a self-organized fast release buffer (FRB), and a non-volatile memory, the method including receiving a command to perform garbage collection in a first block stripe of the non-volatile memory from the CPU, the command including a second block stripe to write to and valid logical block numbers (LBNs) corresponding to a first codewords (CWs) stored in the first block stripe, allocating space in a buffer memory of the FRB for storage of the first CWs, storing the first CWs into the allocated space in the buffer memory, transferring a second CWs to a plurality of physical addresses in the second block stripe of the non-volatile memory, and sending the valid LBNs and the plurality of physical addresses to the CPU to update a logical-to-physical table, wherein the second CWs is based on the first CWs.

Abstract: Technologies are described herein for compressing or decompressing data using polar codes. Some example technologies may receive a data string comprising a first set of symbols. The technologies may transform the data string into a generalized message comprising a second set of symbols by mapping the data string to the generalized message via an inverse of a transformation function. The technologies may identify, based on a polar code, fixed symbols of the generalized message. The technologies may generate a compressed data string by extracting the fixed symbols from the generalized message and concatenating the fixed symbols into the compressed data string. As a result, the generalized message may be transformed into the compressed data string.

Abstract: A Multi-Shot Scheduling System chooses from multiple candidate playlists of positions to select a broadcast playlist. Candidate playlists are generated based upon scoring and selecting content items for the positions through the use of index values. Various embodiments of the Multi-Shot Scheduling System can select broadcast playlists for multiple groups of content and can provide different methods of controlling scheduling performance by restricting the range of candidate playlists from which the best playlist can be selected.

Abstract: In one embodiment, data of a data set that describes the topography of a three-dimensional surface (e.g., a DTM) is obtained at a resolution appropriate for visualization on a display screen. The data is organized into a number of resolutions by spatial indexing. A lowest resolution cluster of data is selected. For any visible data in the selected cluster of data for a type of visualization to be shown on the display screen, a point density in a coordinate system of the display screen resulting from data is compared to a configured threshold. If the point density in the display screen's coordinate system is below the configured threshold, visible data in the selected cluster of data is returned for display. If the point density in the display screen's coordinate system is above the configured threshold, one or more next-higher resolution clusters of data are selected, and the technique repeated.

Abstract: Managing user bookmark information includes receiving a bookmark-related action request and determining a type of action associated with the bookmark-related action request and user information associated with the bookmark-related action request. In the event that the type of action corresponds to an add bookmark action, managing user bookmark information further includes generating a bookmark data record, the bookmark data record comprising the user information and information to be bookmarked; determining, using the user information, bookmark database information associated with a bookmark database to which the bookmark data record is to be stored, the bookmark database being one of a plurality of bookmark databases; generating index information based on the user information and the bookmark database information; storing the index information in an index database that is separate from the plurality of bookmark databases; and storing the bookmark data record in the bookmark database.

Abstract: Lockless burst trie indexing inserts marker nodes into a linked list of data and marker nodes, each marker node corresponding to a symbol in an ordered data sequence stored in the data nodes. A trie structure contains entries that represent the symbols of the marker nodes and point to the corresponding marker nodes. The trie structure can contain multiple levels of entries that are linked together in a hierarchy to represent subsets of the data sequences.

Abstract: Systems, methods, and other embodiments associated with a unit of work for incremental data processing are described. In one embodiment, a method includes selecting a unit of work key for a program that processes records in a source table. The unit of work key is selected such that modifications to a record having a certain unit of work key value will not affect the program's processing of records having a different unit of work key value. The selected unit of work key is associated with the program. When a record in the source table is created, modified, or deleted, a unit of work key value is identified for the record and a selected set of records having the identified unit of work key value is provided to the program. Thus, records in the data source that do not have the identified unit of work key values are not provided to the program.

Abstract: A method, a system, and a computer program product for managing a database are disclosed. Managing the database includes managing an index of a table of the database. Managing the index includes determining the table includes a first field having a first input value configured to identify a first dynamic data function utilized to determine a first output value for the first field. In embodiments, managing the index includes determining the first dynamic data function is deterministic, determining the first output value for the first field using the first dynamic data function, and storing the first output value for the first field. In embodiments, managing the index includes determining the first dynamic data function is nondeterministic, determining a first special value to represent the first output value for the first field, and storing the first special value for the first field.

Abstract: A method includes, in a master data management system, identifying a profile including a plurality of master data attributes and receiving a persistent modification request for the profile. The persistent modification request affects one or more of the master data attributes. The method further includes, for each affected attribute, either: (i) identifying a preexisting master record associated with preexisting ownership information; or (ii) determining that no preexisting master record exists.

Abstract: An optimistic, latch-free index traversal (“OLFIT”) concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT scheme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

Abstract: A consistency checker and (200) a method performed by a consistency checker (200) for finding inconsistencies of data posts stored in a data repository (220) is provided. The consistency checker (200) has a storage unit (202) in which a number of inconsistency patterns are stored, each inconsistency pattern being associated with an inconsistency analysis rule for a value of a data attribute.

Abstract: An optimized fact checking system analyzes and determines the factual accuracy of information and/or characterizes the information by comparing the information with source information. The optimized fact checking system automatically monitors information, processes the information, fact checks the information in an optimized manner and/or provides a status of the information. In some embodiments, the optimized fact checking system generates, aggregates, and/or summarizes content.

Abstract: A fact checking system is able to verify the correctness of information and/or characterize information by comparing the information with one or more sources. The fact checking system automatically monitors, processes, fact checks information and indicates a status of the information. Fact checking results are able to be validated by re-fact checking the fact check results.

Abstract: Aspects of the present disclosure relate to performing agnostic data integrity checks on source data, and based on the data integrity checks, generating a human-readable report that may be useable to identify specific errors or anomalies within the source data. Example embodiments involve systems and methods for performing the data integrity checks and generating the human-readable reports. For example, the method may include operations to ingest data from a source database through a data pipeline and into a local database, access the data from the data pipeline, determine a data type of the data, determine subtypes of data elements which make up the data, determine a count of each subtype, and generate a human-readable report, to be displayed at a client device.

Abstract: In various embodiments, static, dynamic, and behavioral analysis may be performed on an application. A set of software libraries or code fragments employed by the application may be determined. A set of device resources employed by the application may be determined. An application fingerprint is generated for the application. The application fingerprint encodes identifiers for the set of software libraries or code fragments and identifiers for the set of device resources.

Abstract: A device for data management, the device is in communication with a memory and includes: a verification module configured to receive a first identity information and a first request and verify the first identity information; a search module configured to search for at least one first data stored in the memory in response to the first request if the first identity information is verified, the at least one first data being assigned a first rating point; and an evaluation module configured to receive a second rating point associated with the first identification information, retrieve the first rating point from the at least one first data and generate a third rating point in accordance with the verified first identity information, the first rating point and the second rating point and store the third rating point in the memory.

Abstract: A querying method for a database of graph data encoded as triples being stored on storage servers. The method including dividing a query into a plurality of result criteria triple patterns which query results match, each triple pattern element being either: a single value triple pattern element; or a variable value triple pattern element specifying an ID of a variable. The method includes forming one or more sub-queries each having triple patterns having the same single value triple pattern element or specifying the same ID of a variable as a variable value triple pattern element, issuing each formed sub-query to each of the servers, and receiving triples satisfying a sub-query as results from the servers and using the sub-query results in as a response to the query.

Abstract: A method and apparatus for acquiring hot content are disclosed. The method includes: acquiring N search requests and N search responses corresponding to the N search requests; analyzing the N search requests and the N search responses to obtain N initial hot content datum; calculating a weight of each initial hot content data and selecting M middle hot content datum from the N initial hot content datum according to the weight of each initial hot content data, and M is a natural number and no greater than N; performing repetition elimination on the M middle hot content datum; and selecting hot content from the M middle hot content datum after the repetition elimination. The apparatus includes acquiring module, analyzing module, selecting module, repetition eliminating module and processing module. According to the disclosure, the hot content can be acquired automatically without extra editing, thereby improving the efficiency of acquiring hot content and saving the human cost.

Abstract: A method and system for expanding a template tree. A received search request includes (i) a search query and (ii) path information specifying at least one path of data nodes of the template tree. The template tree is a hierarchically organized data structure of data nodes. Each specified path in the path information includes a sequence of data nodes of the template tree. The data nodes in each sequence in each specified path are traversed. Each traversed data node that does not have a child node in the template tree is expanded to form in the template tree one or more child nodes corresponding to each expanded data node. Any other data node of the template tree is not expanded. Each formed one or more child nodes is instantiated with data values by retrieving the data values, in accordance with the search query, from at least one data source.

Abstract: A database query is intercepted by a query analyzer before it reaches a database. The query analyzer then tracks where the query accesses the database and how long the operation takes to complete. A statistical model is then constructed during runtime based on this tracking information to create an updated index schema for the database. The database index structure is then updated with the new schema to reduce query access times.

Abstract: Technologies are disclosed for generating query execution plans optimized for parallel execution for programs having both core database relational functions and user-defined functions. A variety of optimization strategies can be employed to improve performance in a parallel execution scenarios. A flexible range of permitted partition arrangements can be specified as acceptable to parallelized instances of the user-defined function. The optimizer can leverage such information when constructing an optimized query execution plan. Partitioning arrangements or other properties can be leveraged to avoid additional or unnecessary processing.

Abstract: Techniques are provided for performing a refresh or update of a materialized view without modifying the materialized view. Such a refresh is referred to as an out-of-place materialized view refresh. An out-of-place materialized view refresh involves creating one or more outside tables into which data will be inserted. During the refresh, the materialized view may be accessible for query processing, even though the materialized view contains “stale” data. After the insertion, the one or more outside tables are made accessible for query processing and future queries will target the one or more outside tables instead of the materialized view.

Abstract: A method and system for executing database queries in parallel using a shared metadata store. The metadata store may reside on a master node, and the master node may distribute this metadata with query plans to worker nodes. The worker nodes may request additional metadata from the master node when necessary.

Abstract: Bloom filter cost estimation engine for improved performance and accuracy is described. An example method includes building an execution plan for a join operation having a plurality of levels, where the execution plan includes a top join operator at a top level, a leaf scan operator on a bottom level, and one or more intermediate operators between the top level and the bottom level. A row reduction effect of applying a Bloom filter is determined by simulating a semi-join operation over table statistic representation at each of the plurality of levels of the execution plan. A cost savings of the join operation is calculated based on the row reduction effect at the each of the plurality of the levels.

Abstract: Processing a metric of a component of a SDN can include registering a unique identifier associated with the metric in storage of the SDN.

Abstract: The APPARATUSES, METHODS AND SYSTEMS FOR AN EMPLOYEE ONBOARDING AUTOMATOR (hereinafter “EOA”) implement efficient and scalable monitoring, regulation, and allocation of computational processing, data, labor, and/or the like resources within an enterprise. The EOA may facilitate the dissemination and integration of information associated with employee status updates, including the hiring of job candidates, promotions, demotions, and/or the like. The EOA may be configured to automatically update enterprise database systems as needed or desired to reflect employee status changes and/or to transfer employee data from one place to another, such as from a human resources application database where the employee status change may be first entered to a wide variety of other enterprise systems, such as those associated with information technology, facilities, payroll, benefits, legal, marketing, and/or other enterprise departments.

Abstract: The APPARATUSES, METHODS AND SYSTEMS FOR AN EMPLOYEE REIMBURSEMENT EVALUATOR (hereinafter “EREVAL”) implement efficient and scalable monitoring, regulation, and allocation of computational processing, data, labor, and/or the like resources within an enterprise. The EREVAL may facilitate the receipt, processing, evaluation and fulfillment of employee reimbursement requests. The EREVAL may be configured to receive an employee reimbursement request, extract request parameters, and evaluate whether or not the request can be fulfilled according to system rules, based on employee characteristics and/or employee-selected benefits, and/or the like. The EREVAL may further be configured to interact with and/or exploit global data exchanger and/or automated date extractor components to retrieve reimbursement requests from employee email records and/or to facilitate payment of authorized employee reimbursements.

Abstract: The various embodiments of the invention provide software and metadata structures for a data processing system and method, for applications such as marketing campaign management, speech recognition and signal processing. An exemplary system embodiment includes a first data repository adapted to store a plurality of entity and attribute data; a second data repository adapted to store a plurality of entity linkage data; a metadata data repository adapted to store a plurality of metadata modules, with a first metadata module having a plurality of selectable parameters, received through a control interface, and having a plurality of metadata linkages to a first subset of metadata modules; and a multidimensional data structure. The control interface may modify the plurality of selectable parameters in response to received control information.

Abstract: According to embodiments described in the specification, a method, system and apparatus for managing contact data are provided. The method comprises storing a plurality of contact attributes distilled from at least one data source in a memory, the contact attributes defining a plurality of contacts; receiving input data at a communications interface; identifying at least one search attribute from the received input data; selecting at least one of the plurality of contacts based on matches between the plurality of contact attributes and the at least one search attribute; and transmitting notification data based on the selected contact.

Abstract: Example apparatus and methods transform a non-metric latent space produced by a matrix factorization process to a higher dimension metric space by applying an order preserving transformation to the latent space. The transformation preserves the order of the results of an inner product operation defined for the latent space. The higher dimension metric space may be queried for the results to different requests. Example apparatus and methods may assign every user i a vector ui in a latent space, and may assign every item j a vector vj in the latent space. The dot product ui·vj represents the score between the user i and the item j. The score represents the strength of the relationship between the user i and the item j. Example apparatus and methods may then apply ranking methodologies (e.g., LSH, K-D trees) to problems including recommendation, targeting, matchmaking, or item to item.

Abstract: Techniques for search with more like this refinements are disclosed. In some embodiments, search with more like this refinements includes receiving a product and a context (e.g., the context can include related category information, user context, and/or other context related information); generating a search query based on the product and the context; and determining a plurality of products that match the search query to generate more like this search results.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for ranking search results. One method includes ranking web objects in response to a search query to generate a global ranking based on a relevance of each web object to the search query and a relative authority of each web object compared to other web objects in the plurality of web objects, each web object including a web page in a corresponding website that includes a plurality of web pages; ranking the plurality of web pages corresponding to each website based on onsite ranking criteria to generate an onsite ranking; generating a combined ranking for each web page based on a combination of the global ranking of the web object that includes the web page and the onsite ranking of the web page; and presenting web pages responsive to the search query based on the combined rankings.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for analyzing user profiles. One of the methods includes identifying websites with which users of a social networking service have established an affiliation. The method includes filtering the identified websites by removing websites in which a count of users who have established an affiliation with the website exceeds a threshold. The method includes producing a list of valid affiliations for each filtered website, including generating a validity score for each of the established affiliations with the respective filtered website, determining whether each of the established affiliations with the respective filtered website is valid based on the corresponding validity score, and ranking the users who established valid affiliations with the respective website based on the corresponding validity scores. The method also includes providing the list of the valid affiliations ordered by the ranking.

Abstract: Techniques described herein relate to generating new assessment items and updating existing assessment items. Input data may be received corresponding to the addition, removal, or modification of assessment components within assessment items, and may cause immediate generation and validation of corresponding markup language data blocks, thereby allowing for interactive construction and automated encoding of assessment items. Additional techniques described herein relate to determining compatible scoring types for assessment items and generating and embedding markup language data blocks corresponding to assessment item scoring data.

Abstract: A computer implemented method for searching data in a plurality of data sources is described. At a host system, a request to search a local data source is received. The request is associated with a user account of the local data source. The request is processed to determine one or more third party data sources associated with the user account. Local search parameters associated with the local data source and third party search parameters associated with the one or more third party data sources are dynamically assembled. The local search parameters and the third party search parameters are transmitted to a client device for display. A host system comprising a processor and memory storing instructions for implementing the method is also described.

Abstract: A new approach is proposed that contemplates systems and methods to generate customized search results as well as metrics, such as aggregated sentiment, counts of targets or sources or citations, or aggregated gross impressions or exposure, of social media content items over a social network while discriminating between the perspectives of individuals from the media and individuals not from the media. This approach can be used to generate search results and/or metrics including only media perspectives, or excluding media perspectives. More specifically, while social media content items are retrieved from corpus based on certain search criteria, for the purpose of providing search results or providing aggregated metrics, the search criteria can include a media or non-media filter, which is applied to the authors posting social media content to exclude or include certain authors meeting media/non-media criteria.

Abstract: Methods, systems, and apparatus, including computer program products, for searching for and presenting backups. A first search result including a first version of an item is presented. The first version is associated with a first date range having a first start date and a first end date. User input requesting that an archive including one or more versions of the item be searched is received. A second search result including a second version of the item is presented. The second version is different from the first version. The second version is associated with a second date range having a second start date and a second end date. The second date range does not overlap with the first date range.

Abstract: Techniques are disclosed for implementing custom object-in-memory formats in a data grid network appliance. The techniques include maintaining a record of format definitions on a client device of the data grid and a corresponding record of format definitions on a server device of the data grid. Each format definition may indicate one or more attributes of an object class and data types and byte ranges of the attributes. The client device may serialize one or more objects for storage in the data grid based on respective format definitions associated with the one or more objects and retrieved from the record of format definitions maintained on the client device. Further, the server device may perform one or more data grid operations using format definitions retrieved from the record of format definitions maintained on the server device.

Abstract: Providing messages for Java message service (JMS) is disclosed. A described method includes determining timestamp information associated with a first Java™ message service (JMS) message. The timestamp information represents a time when the JMS message is either generated or received by a processing device. The method also includes determining destination information associated with the JMS message. The method further includes converting the JMS message into a first key-value data pair having a key data and a value data. The key data includes the timestamp information and the value data includes the destination information of the first JMS message.

Abstract: A method, computer program product and computer system to validate a write of a replica record to a replica data store in a transaction processing system, the replica record duplicating a source record in a source data store. The transaction processing system obtains a value associated with a record location of the source record in the source data store. The transaction processing system predicts a value associated with a record location of the replica record in the replica data store and responsive to the obtained value associated with the source record location not corresponding to the predicted value associated with the replica record location, not writing the replica record.

Abstract: Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances.

Abstract: Provided are techniques for managing, importing, and exporting teamspace templates and teamspaces in content repositories. A file is created using a teamspace template and associated metadata at a first content repository. The file is exported from the first content repository to a second content repository, wherein the file can be used to create a teamspace instance at the second content repository.

Abstract: A method for processing requests includes receiving, from a requestor, a first read request to read a portion of a seismic cube. The first read request includes a virtual location of the portion. The method further includes querying a seismic cube index to obtain a mapping parameter and a storage location of a section including the portion of the seismic cube. The mapping parameter maps virtual locations in the seismic cube with data locations in the section. The section is identified using the virtual location of the portion. The method further includes calculating, on a computer processor and using the mapping parameter, a data location in the section corresponding to the virtual location of the portion, and transmitting a second read request to the storage location of the section. The second read request includes the data location. The requestor receives the portion from the storage location.

Abstract: Dynamic sourcing, in which a data request that is associated with a query is received and a parameter of data needed for satisfaction of the query is identified. Parameter information defining data available in at least one cube stored in a cache is accessed and the parameter is compared with the parameter information. Based on comparison results, it is determined whether one or more cubes in the cache include sufficient data to satisfy the query. In response to a determination that one or more cubes include sufficient data to satisfy the query, a response to the data request is generated by executing the query against the one or more cubes. In response to a determination that the cubes do not include sufficient data to satisfy the query, a response to the data request is generated by executing at least a portion of the query against a database system.

Abstract: The present invention relates to a heterogeneous data cluster generation apparatus and method and a data clustering method and apparatus, and more particularly, to a data clustering method and apparatus which cluster data measured by different sensors into a number of groups. Aspects of the present invention provide an apparatus and method for generating clusters by putting together heterogeneous data which are values measured by different types of sensors. Aspects of the present invention also provide an apparatus and method for generating clusters by setting indices in order to effectively cluster multi-dimensional data, massive data, or scattered data.

Abstract: A call center application program allows a call center administrator to access, view, and edit data across multiple applications used by multiple customer interaction systems of the call center. The application program is adapted to retrieve data from a plurality of different applications and systems, consolidate redundant data, and display the data to a user, enabling a single unified view of resources across call center applications. Changes can be made to the data application program, which in turn propagates the changes to the individual call center applications, eliminating the need for the user to manually change the data in each individual application.

Abstract: A document management & retrieval system is configured to: store, for each word in a set of words, appearance positions of the each word in a set of documents as a word index; store, for each tag in a set of tags attached to words, a set of words that appear to a right and left of the each tag, and also store, as a tag LR index, appearance positions of the each tag in a set of documents with a combination of the each tag and a word appearing to its right or a combination of the each tag and a word appearing to its left as a key; and, in a tag search where a query phrase contains words and a tag next to each other, refer to the index with a tag and the word to the right or left of the tag as a key, thereby reducing the size of a document list to be read without needing to have a tag name as a secondary key. A tag is updated by just updating two places in the tag LR index.

Abstract: A method for managing messages is provided, including: displaying, by a first terminal, a conversation screen associated with a plurality of messages; displaying an indication that there is a link query corresponding to a first message; detecting whether the indication is selected; responsive to the indication being selected, performing a first search of the plurality of messages for the first message, the first search being performed based on a first search key that is generated using the link query; and displaying the first message when the first search is successful.

Abstract: A system for automatically generating entity collections comprises a data graph including entities connected by edges and instructions that cause the computer system to determine a set of entities from the data graph and to determine a set of constraints that has a quantity of constraints. A constraint in the set represents a path in the data graph shared by at least two of the entities in the set of entities. The instructions also cause the computer system to generate candidate collection definitions from combinations of the constraints, where each candidate collection definition identifies at least one constraint and no more than the quantity of constraints. The instructions also cause the computer system to determine an information gain for at least some of the candidate collection definitions, and store at least one candidate collection definition that has an information gain that meets a threshold as a candidate collection.