Abstract: Disclosed are systems, apparatus, and methods for identifying and processing duplicative records in one or more database systems. In various implementations, a first data object may be created and stored in a first database system, where the first data object includes a plurality of data fields capable of storing a plurality of data values. A trigger function may be executed in response to creating the first data object, where the trigger function causes one or more servers to determine if one or more existing data objects stored in the second database system match the first data object, and where the trigger function further causes one or more servers in the first database system to retrieve one or more data values from the one or more existing data objects. The retrieved one or more data values may be stored in one or more data fields of the first data object.

Abstract: Systems and methods for enhancing content quality and user engagement in social platforms are described. In one implementation, a method includes assessing a quality of each of a plurality of user contributed contents related to at least one topic associated with a web based social platform based at least on topic quality assessment parameters to generate a topic quality score for the at least one topic. Further, the method comprises generating a credibility score for each of a plurality of users who contributed the user contributed contents based in part on the topic quality score. Based on the credibility scores, at least one credible user from the plurality of users is identified to enhance at least one of quality of the web based social platform and user engagement in the web based social platform.

Abstract: A fuzzy joins system that is integrated in a database system generates fuzzy joins between records from two datasets. The fuzzy joins system includes a tokenizer to generate tokens for data records and a transformer to find transforms for the tokens. The fuzzy joins system invokes a signature generator, running within a runtime layer of the database system, to generate signatures for data records based on the tokens and their transforms. Subsequently, an equi-join operation joins the records from the two datasets with at least one equal signature. A similarity calculator, running within a runtime layer of the database system, computes a similarity measure using the token information of the joined records. If the similarity measure for any two records is above a threshold, the fuzzy joins system generates a fuzzy join between such two records.

Abstract: A data profile request is handles by utilizing data in a distributed file system. Tabular data is extracted from a data source and stored in a distributed file system. Each table in the tabular data is split by columns, which are each stored in separate files in a set of physical nodes of the distributed file system. In response to a data profiling request, a master node determines, based on the profiling request, which groups of files are needed to be on a same physical node in order to perform the profiling analysis. The master node creates jobs using physical nodes that contain the requisite files needed for each job.

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: A mechanism is provided for efficiently searching a database for data associated with a key value that is unidentifiable in a set of nodes of the database. A request is received to retrieve data from the database, where the request specifies a searched-for key value that is unidentifiable in the set of nodes of the database. The data associated with the searched-for key value is identified in a lowest level node of the database between a current leftmost node and a current rightmost node. A key index is updated in at least one node of the database with the key index value associated with the data and identified from the lowest level node thereby making the searched-for key value identifiable within the at least one node. The data associated with the searched-for key value is then returned to a user.

Abstract: Techniques are described for identifying conflicts between a prospective temporal key and an index of temporal keys, the index sorted based on a time value associated with each of the temporal keys. Embodiments determine whether a first temporal key within the index of temporal keys conflicts with the prospective temporal key. Here, the keys within the index may be sorted based upon a respective time value associated with each of the keys. Upon determining that the first temporal key conflicts with the prospective temporal key, the prospective temporal key is designated as conflicting with at least one existing temporal key in the index of temporal keys.

Abstract: Provided are techniques for rejecting rows while locating a target row. For a row that is stored in a hash space, a row filter value is generated for that row, and the row filter value is stored with the row. While trying to locate the target row in a collision chain in the hash space, a row filter value is calculated for the target row. For the row in the collision chain, the stored row filter value of the row in the collision chain is compared with the computed row filter value of the target row. In response to determining that the stored row filter value does not match the computed row filter value, it is determined that the row in the collision chain is not the target row.

Abstract: A hash table supports extended entries. The extended entries permit a base entry to extend its associated data into one or more neighboring entries. Extended entries thereby provide a mechanism through which a hash table entry may store additional data compared to a base entry. Extended entries may coexist with base entries in the hash table. The hash table thereby provides the flexibility to adapt dynamically to meet system requirements and to balance the needs of additional data storage by blending the number of extended entries (that each store more data than a base entry) and the number of base entries (each storing less data than an extended entry).

Abstract: System and Methods for time-based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. A circular buffer is generated to store a plurality of starting time for a plurality of garbage collections. Generational garbage collection is performed, and the time data in conjunction with the starting times stored in the circular buffer are used to determine when objects are promoted from one generation to the next oldest generation.

Abstract: In one general aspect, a computer-implemented method includes a computer-implemented method that includes executing, using at least one processor, instructions recorded on a non-transitory computer-readable storage medium. The method includes receiving a request to insert a data record within a database of a data collection system. The data record can be placed within a buffer in a main memory of the data collection system. A record data structure and a record index structure associated with the data record are defined. The record data structure and the record index structure are stored within a storage chunk in a storage medium of the database, and the storage medium is different than the main memory. The storage chunk has an associated index that can be used to retrieve the data record and the storage chunk can include other data records different than the data record associated with the received request.

Abstract: A cost estimator may estimate execution costs for execution of at least one query against a database, using at least one existing index, if any, and based on estimation criteria determined from analyzing the query execution. A candidate index provider may provide candidate indexes, based on the estimation criteria, and re-estimate the execution costs to obtain updated execution costs, using the candidate indexes. An index recommender may recommend a recommended index, based on the updated execution costs.

Abstract: Embodiments of the present invention are directed to a method and system for filesystem deduplication that uses both small fingerprint granularity and variable length sharing techniques. The method includes accessing, within an electronic system, a plurality of files in a primary storage filesystem and determining a plurality of fingerprints for the plurality of files. Each respective fingerprint may correspond to a respective portion of a respective file of the plurality of files. The method further includes determining a plurality of portions of the plurality of files where each of the plurality of portions has the same corresponding fingerprint and accessing a list comprising a plurality of portions of files previously deduplicated. A portion of a file of the plurality of files not present in the list may then be deduplicated. Consecutive portions of variables lengths having the same corresponding fingerprints may also be deduplicated.

Abstract: Systems and methods are disclosed for contextual analysis and segmentation of information objects. In accordance with one implementation, information objects, such as web pages and user profiles, may be processed to obtain a list of key terms. An index may be created containing each of the information objects and associated key terms. Information objects may then be matched to contextual segments (i.e., categories of information objects) by submitting terms associated with the contextual segments against the index. Further, thresholding may be applied, so that only the most relevant information objects for a contextual segment are assigned to the contextual segment.

Abstract: An apparatus which receives client-server transactions such as HTTP REQUESTS and transforms them into a synopsis format for archival storage. HTTP transactions are logged and parsed for key words called HTTP METHODS. For each HTTP METHOD, data is extracted from the message or the resources provided by the transaction. The data is efficiently stored into a transaction store. The data is also indexed and the index is stored into the transaction store. A record is kept for all concurrent sessions by usernames associated with a directory entry.

Abstract: Various embodiments for deduplicated data processing congestion control in a computing environment are provided. In one such embodiment, a congestion target setpoint is calculated using one of a proportional constant, an integral constant, and a derivative constant, wherein the congestion target setpoint is a virtual dimension setpoint. A single congestion metric is determined from a sampling of a plurality of combined deduplicated data processing congestion statistics in a number of active deduplicated data processes. A congestion limit is calculated from a comparison of the single congestion metric to the congestion target setpoint, the congestion limit being a manipulated variable. The congestion limit is compared to the number of active deduplicated data processes. If the number of active deduplicated data processes are less than the congestion limit, a new deduplicated data process of the number of active deduplicated data processes is spawned.

Abstract: Devices, methods and systems are disclosed herein to describe a document element indexing system which efficiently organizes different files or the constituent parts of different files into an index, thereby allowing users to easily and efficiently access, annotate and/or review the desired information. The indexing system may be applied to organize components of homogeneous and/or heterogeneous file types.

Abstract: Under the present invention, index keys are generated for a set of documents. This is typically accomplished by examining the set of documents, and connecting data values extracted from the set of documents to yield the index keys. Once the index keys are generated, an index view will be generated into which the index keys are populated. Using the index keys in the index view, an agent will automatically obtain the set of documents (i.e., in the background). Then, when a user requests one of the documents, the document will already have been retrieved from storage. As such, it can readily be provided to the user. It should be understood that as used herein, the term “document” is intended to refer to any type of electronically stored data.

Abstract: A method for providing a purchase history context search includes receiving at least one search term from a user through an input device. A purchase history for the user is then accessed from at least one purchase history database over a network. A web index that is located on at least one storage device is then accessed. A plurality of search results, each associated with a web page indexed by the web index, are then determined using the at least one search term and the purchase history, each search result including a link to an associated web page. The plurality of search results are then provided for display on a display device.

Abstract: A particular case is matched to further cases, where the matching is based on plural attributes contained in the particular case and in the further cases, wherein one of the plural attributes relates to a flow of activities taken to address the respective case.

Abstract: Embodiments facilitate greater flexibility in definition of user segments for targeted advertising, by employing indexed semantic user profiles. Semantic user profiles are built through extraction of online user behavior data such as user search queries and page views, and include user interest information that is inferred based on user behavior. Semantic user profiles are then indexed to facilitate search for a set of users that fit specified semantic search terms. Search results for semantic profiles are ranked according to a ranking model developed through machine learning. In some embodiments, building and indexing of semantic profiles and learning of the ranking model is performed offline to facilitate more efficient online processing of queries.

Abstract: Methods for acquiring, generating and displaying ranked points of interests for use in an augmented reality service provisioning system are described. The method for generating such ranked points of interest comprises: receiving feedback information comprising information on users interactions associated with one or more points of interest displayed as selectable graphical indicators on a screen of a mobile device and assigning popularity scores to points of interests identified in said feedback information on the basis of said user interactions; associating a point of interest in a recording list, comprising points of interests sent to one or more mobile devices in said augmented reality service provisioning system, with a popularity score assigned to points of interests identified in said feedback information; and, storing said point of interest and said popularity score in a points of interest database.

Abstract: A URL inspector may determine a uniform resource locator (URL) which includes an indexable fragment. A URL separator may separate, from the URL which includes the indexable fragment, a base URL occurring prior to the indexable fragment. An indexer may process content of the base URL to obtain processed content thereof. A rendering system may render the processed content together with the URL which includes the indexable fragment to obtain rendered content. A content converter may convert the rendered content into indexable content.

Abstract: A data management apparatus sends specific data and key information corresponding to the specific data to another apparatus, when executing a process to change a storage destination of the specific data in which the hash value obtained by applying a predetermined hash function to corresponding key information belongs to a certain range, from the data management apparatus to the other apparatus, and sends the identification information of the other apparatus stored in correspondence with the certain range to a request source of an operation request, when the operation request with respect to data corresponding to key information is received after the process.

Abstract: A method and apparatus for enabling virtual tags is described. The method may include receiving a first digital image data and virtual tag data to be associated with a real-world object in the first digital image data, wherein the first digital image data is captured by a first mobile device, and the virtual tag data includes metadata received from a user of the first mobile device. The method may also include generating a first digital signature from the first digital image data that describes the real-world object, and in response to the generation, inserting in substantially real-time the first digital signature into a searchable index of digital images. The method may also include storing, in a tag database, the virtual tag data and an association between the virtual tag data and the first digital signature inserted into the index of digital images.

Abstract: Embodiments are directed to efficiently correlating internet resources and to providing relevant content to a user. In an embodiment, a computer system gathers portions of information from multiple different resources and organizes the gathered information into different indices according to at least one of the following data axes: author, topic and source. The computer system computes correlations between the organized information across the data axes so that each portion of information has relationship information linking it to other portions of organized information. The computer system also intelligently learns which other informational items are to be searched for based on the computed correlations and returns the additional data relevant to the gathered data.

Abstract: Making an information retrieval process public, so that it can be followed by others, allows capturing of an interest graph that allows people to learn more about shared interests with other people. This also allows items of interest to a trusted resource (such as an expert) to be identified. These items can then be brought to the attention of other users that share the same interest as the expert. In addition, by keeping track of what particular content a user has already seen, the system can bring items of interest to the user's attention, where the user has not yet seen those items.

Abstract: A data management apparatus includes a storage device; and a processor that executes a procedure, the procedure including selecting a data group, each data in the data group including one of a plurality of tags, among a plurality of data, compressing the data group into a compressed data group, and storing the compressed data group in the storage device, the stored compressed data group being associated with tagging information which indicates that each data of the data group includes the certain tag.

Abstract: A network control system that includes several controllers for managing several switching elements and a distributed hash table (DHT) formed across the controllers for storing data regarding the switching elements that is accessible by the controllers. Each hash table serves as a DHT instance. In some embodiments, the DHT instances of all controller instances collectively store one set of records that is indexed based on hashed indices for quick access. These records are distributed across the different controller instances to minimize the size of the records within each instance and to allow for the size of the DHT to be increased by adding other DHT instances. According to this scheme, each DHT record is not stored in each controller instance. In fact, in some embodiments, each DHT record is stored in at most one controller instance.

Abstract: Embodiments are configured to provide sharing of business logic items. A document may contain business logic items, for example, sets, members, or measures. Some business logic items may be created by a publisher who wants to make the business logic available to other users so that others can access the business logic. Embodiments provide for using an integrated server platform search component to automatically retrieve business logic items which exist in one or more documents stored in a document library. This may allow for a publisher to provide business logic to other users without having to rely on the other users to retrieve the business logic from a specific document, and without requiring the other users to know of the existence of the business logic. Restrictions may be placed so that a publisher can control what specific pieces of business logic may be made available.

Abstract: Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

Abstract: A request for a font file including a first font table and a second font table is received. A first entropy encoder is selected, based on characteristics of the first font table, front among a plurality of entropy encoders. A second entropy encoder is selected, based on characteristics of the second font table, front among the plurality of entropy encoders. The first entropy encoder is applied to the first font table. The second entropy encoder is applied to the second font table. Compressed data corresponding to the first and second font tables are combined to generate a compressed font file. The compressed font file is transmitted.

Abstract: A system and method are provided for creating or extending a preservation-ready digital document. This document is represented so as to be durably intelligible and reliably trustworthy. It includes within itself standardized metadata, provenance information, and reliable links to chosen documents within a world-wide network of digital repositories. These links and the documents' own identifier(s) are chosen to uniquely, unambiguously, and forever identify what they refer to. This system provides a robustly durable method of preserving an unbounded number of digital objects for as long as their representing bit-strings are kept in existence and findable by now-conventional digital library technology, as first described in [Gladney 2000] and publications by the same author.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for calculating a size of an entity. These mechanisms and methods for calculating a size of an entity can enable optimized data analysis, improved system resource knowledge, increased efficiency, etc.

Abstract: A method of compressing an electronic file is provided. The method comprises reading a first electronic file in reverse order sequence from bottom to top, while reading the first file, identifying patterns in a content of the first file and while reading the first file, building a dictionary comprising a plurality of entries, each entry defining an association of a code to one of the patterns identified in the content of the first file. The method further comprises, while reading the first file, building a second electronic file that is a compressed version of the first file, wherein the second electronic file comprises a compressed content portion and a dictionary portion, wherein the compressed content portion comprises codes from the dictionary and wherein the dictionary portion comprises the dictionary.

Abstract: Technologies are generally described herein for compressing an array using hardware-based compression and performing various instructions on the compressed array. Some example technologies may receive an instruction adapted to access an address in an array. The technologies may determine whether address is compressible. If the address is compressible, then the technologies may determine a compressed address of a compressed array based on the address. The compressed array may represent a compressed layout of the array where a reduced size of each compressed element in the compressed array is smaller than an original size of each element in the array. The technologies may access the compressed array at the compressed address in accordance with the instruction.

Abstract: Dynamically generated lists are provided. Data elements may be sorted in a list according to a value. An index may be dynamically generated to divide the data elements into one or more index groupings, the index groupings containing an equal or nearly-equal number of data elements. The index may comprise index grouping entry points allowing for navigation to each of the one or more index groupings. If a list is modified, for example a data element is added, removed, or otherwise modified, the index may be automatically regenerated to preserve equal distribution of data elements across the index groupings.

Abstract: Described herein are methods for finding substantially similar/different sources (files and documents), and estimating similarity or difference between given sources. Similarity and difference may be found across a variety of formats. Sources may be in one or more languages such that similarity and difference may be found across any number and types of languages. A variety of characteristics may be used to arrive at an overall measure of similarity or difference including determining or identifying syntactic roles, semantic roles and semantic classes in reference to sources.

Abstract: A method, an apparatus and an article of manufacture for accessing a specific location in voice site audio content. The method includes indexing, in a voice site index, a specific location in the voice site that contains the audio content, mapping the audio content with information regarding the location and adding the mapped content to the index of the voice site, using the index to determine content and location of an input query in the voice site, automatically marking the specific location in the voice site that contains the determined content and location of the input query, and automatically transferring to the marked location in the voice site.

Abstract: Methods for accessing impact analysis repositories and transaction-refinement index for each of the impact analysis repositories. According to the obtained transaction-refinement index, associating the combined repository with information from the most transaction refined impact analysis repository. Associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to insert or delete a table record for tables that do not contain any impacted transaction in the more transaction refined impact analysis repository. And associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to update a table record for table columns that do not contain any impacted transaction in the more transaction refined impact analysis repository.

Abstract: Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

Abstract: Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data.

Abstract: A tool set is provided that uses a series of modules (e.g. spreadsheet workbooks) for assessing risks/threats to and attacks against a project and developing countermeasures against such risks/threats/attacks. The project may cover a wide berth of functionality from alarm systems, computer security, building projects, etc. The roll up feature of the spreadsheet may be employed to evaluate changing scenarios in a short period of time. Ranked threats and countermeasures operable to defeat such threats may be displayed in a tree diagram generated by one or more of the modules.

Abstract: The present invention includes a system and method for generating a discussion group based on different electronic images. A mixed media reality database receives MMR objects that correspond to source material and indexes the MMR objects. A content management engine generates a cluster that includes MMR objects based on a similarity of source material. An MMR engine receives an electronic image from a user device, performs a visual search and identifies an MMR object that is associated with the electronic image. A social network application identifies a discussion group associated with the cluster that includes the MMR object and provides the user device with access to the discussion group.

Abstract: A lookup is performed using multiple levels of compressed stride tables in a multi-bit Trie structure. An input lookup key is divided into several strides including a current stride of S bits. A valid entry in a current stride table is located by compressing the S bits to form a compressed index of D bits into the current stride table. A compression function logically combines the S bits to generate the D compressed index bits. An entry in a prior-level table points to the current stride table and has a field indicating which compression function and mask to use. Compression functions can include XOR, shifts, rotates, and multi-bit averaging. Rather than store all 2S entries, the current stride table is compressed to store only 2D entries. Ideally, the number of valid entries in the current stride table is between 2D-1 and 2D for maximum compression. Storage requirements are reduced.

Abstract: A method, computer program product, and computer system for using a device description repository comprises calculating an index by a processor based upon, at least in part, at least a portion of a plurality of user preferences associated with a computing device. One of a first experience and a second experience may be provided to the computing device based upon, at least in part, the index.

Abstract: The invention notably relates to a computer-implemented method for compressing data. The data is partitioned into clusters of pieces of data resulting from K-means clustering. Each cluster has a centroid. The method comprises applying (S10) a compression scheme to the data. The compression scheme preserves the centroid of each cluster and reduces the variance of each cluster. The method also comprises rescaling (S20) the data by moving the pieces of data towards the centroid of their cluster. Such a method improves the compression of data partitioned into clusters.

Abstract: Provided is a system and method for providing a location-sensitive auto-complete query. The system includes at least one processor; a memory to store at least one program configured to be executed by the at least one processor; a keyword generating unit to generate a keyword based on the query inputted from a user terminal and location information received from the user terminal; and a query providing unit to provide an auto-complete query corresponding to the generated keyword among the auto-complete queries indexed according to location information.

Abstract: A method for compressing a sequence of records, each record comprising a sequence of fields, comprises steps of buffering a record in a line of a matrix, reordering the lines of the matrix according to locality sensitive hash values of the buffered records such that records with similar contents in corresponding fields are placed in proximity, and consolidating fields in columns of the matrix into a block of codes. In this, consolidating yields codes of one of a first type comprising a sequence of individual fields and a second type comprising a sequence of fields with at least one repetition. The second type of code comprises a presence field indicating repeated fields and an iteration field indicating a number of respective repetitions. Decompression of the records from the block codes compressed above is also described.

Abstract: A method for storing data in a storage system. In one embodiment, implementation of a method for storing data in compliance with a compression handling instruction includes: at a storage controller, receiving an object for storage within a data storage, wherein the object is in an original state; determining whether a compression handling instruction is received in association with the object; and executing the compression handling instruction when storing the object.