Abstract: The disclosed technology provides systems and methods for filtering information based on a set of properties. The information consists of a set of items that the user is interacting with, such as documents, presentations, audio and video files, and the like. The properties can be specified by the user (by, for example, putting a set of items in lists and folders), based on actions taken by users in the system (such as commenting on, or liking, or viewing an item), or can represent a variety of other characteristics. Related properties can also be grouped together. Furthermore, the disclosed techniques provide mechanisms for automatically identifying useful properties and providing an indication of those useful properties to a user to use in narrowing results.

Abstract: A method for updating an index of a person, the method includes: an index providing during which an index is defined as a function of at least one parameter related to the person is provided; a parameter monitoring during which the at least one parameter of the person is monitored over time; an index update during which the index of the person is updated based on the evolution over time of the at least one parameter of the person.

Abstract: Described are methods, systems and computer readable media for data source refreshing using an update propagation graph having a merged join listener.

Abstract: In this information processing device, a claim term frequency distribution generation unit separates the content of the claims in a publication into individual terms and generates a claim term frequency distribution indicating the frequency distribution of each separated term. A description term frequency distribution generation unit separates the content of the specification in the publication into individual terms and generates a description term frequency distribution indicating the frequency distribution of each separated term. A description synonym frequency distribution generation unit classifies each term extracted from the specification into a plurality of groups respectively corresponding to the plurality of terms in the claims, and generates a description synonym frequency distribution indicating a frequency distribution in which each of the classified plurality of groups serves as a unit.

Abstract: A system, method, and computer program product are provided for configuration based coexistence routing. In operation, a coexistence router system receives data from one or more systems during a coexistence period of a data migration process where information is in process of being migrated from one or more migration source systems to one or more migration target systems. The coexistence router system identifies one or more routing keys included with the data capable of being used to determine whether the data is associated with the one or more migration target systems or the one or more migration source systems. The coexistence router system queries a migration master database to determine whether the data is associated with the one or more migration target systems or the one or more migration source systems, based on the one or more routing keys.

Abstract: Methods for enhanced exploration of dimensionally reduced data. The method including: obtaining at least one data set having a plurality of data objects, wherein each data object is characterized by a plurality of numerical features; applying a dimensionality reduction technique to the at least one data set; generating a two-dimensional scatter plot of the at least one data set, wherein each data object in the plurality of data objects corresponds to a data point in a plurality of data points in the scatter plot; and altering at least one numerical feature of a data object in the plurality of data objects, wherein a position of the data point corresponding to the data object is affected in real-time, and wherein the remaining data points in the plurality of data points are unaffected. In addition, the present invention provides another method and computer program product.

Abstract: Disclosed are systems and methods for editing aggregated data based on edit requests that are received. An edit file is updated to include a newly-received edit. The edit file includes anchor points that each point to one of a plurality of aggregate data objects. The anchor points are used to determine one of the objects to which the edit file corresponds. The edit file is then applied to update data in this object including making the new edit.

Abstract: Techniques facilitating resolution-based spatial computing are provided. In one example, a computer-implemented method comprises traversing, by a device operatively coupled to a processor, a data structure corresponding to a land area for a location having an index; and determining, by the device, whether the location is at least partially within the land area based on a result of the traversing. In some embodiments, the traversing comprises: obtaining a threshold number of levels based at least in part on a resolution parameter; scanning a first level of the data structure for a node having an index corresponding to the index of the location; and iterating the scanning for respective subsequent levels of the data structure based on the scanning returning a node having subordinate nodes and a number of levels for which the scanning and iterating have been performed being less than the threshold number of levels.

Abstract: A system for hash collision tables for relational operations is provided. In some implementations, the system performs operations comprising generating a plurality of hash values for at least a portion of one or more database tables based on a database query, and generating a hash table for at least a portion of the plurality of hash values. The operations can further include generating first results based on execution of a first operation in the database query using the hash table. Additionally, the operations can further include generating second results based on the first results and execution of a second operation in the database query using the hash table. Related systems, methods, and articles of manufacture are also described.

Abstract: A transactional block storage system is provided which is capable of supporting a single-phase commit for data writes specifying a protected storage unit. The storage system includes a data storage map that logically links the protected data storage unit to two or more block storage units associated with a layer of the protected data storage unit. The storage system also includes an address abstraction layer which translates write requests to the block storage units and resolves whether those write requests are atomically committed to the storage system in a single phase transaction. The address abstraction layer is further configured to detected when a block storage unit becomes unavailable during a transaction and create a cleaning kit for that block in order to prevent data loss. Additionally, the address abstraction layer facilitates moving, copying, and merging of block storage units without global locking in the storage system.

Abstract: Apparatuses and Methods for sorting a data set. A data storage is divided into a plurality of buckets that is each associated with a respective key value. A plurality of stripes is identified in each bucket. A plurality of data stripe sets is defined that has one stripe within each respective bucket. A first and a second in-place partial bucket radix sort are performed on data items contained within the first and second data stripe sets, respectively, using an initial radix. Incorrectly sorted data items in the first bucket are grouped by a first processor and incorrectly sorted data items in the second bucket are grouped by a second processor into a respective incorrect data item group within each bucket. A radix sort is then performed using the initial radix on the items within the respective incorrect data item group. A first level sorted output is produced.

Abstract: The storage management computer according to the present invention can relatively easily configure a file sharing system for a file system. The storage management computer is provided with a calculation unit that includes at least a microprocessor and a communication interface circuit which communicates with a storage system, and the storage system is provided with a plurality of first pools for storing file data, and a plurality of second pools for storing block data corresponding to the file data. The calculation unit selects, from among the plurality of first pools, a predetermined first pool associated with one of the plurality of second pools, then selects a predetermined file system associated with the selected predetermined first pool, and configures a file sharing system for the selected predetermined file system.

Abstract: Embodiments of document management systems that utilize replicas are disclosed. A core document management module of a document management system is configured to return a replica (if one exists) in response to a request for either a version of a document or a replica of the document. Thus, modifications that are done by a user or an automated add-in module may be performed on the replica. When a process stores the modified document it may store it as a replica. This modified replica will replace the existing replica of the version.

Abstract: Cache memory can be organized to include adapted data objects that reflect queries. A data object can be identified in cache memory. This data object can be identified based on its being referenced by a query, and both the data object and the query can have a number of attributes. The data object can be adapted to create a subset data object that contains only a subset of attributes. This subset of attributes can be those referenced by the query.

Abstract: A storage device for storing a column store database, the storage device comprising: a column read unit which reads page data to be searched that have been read from the column store database, acquires a leading row number included in the page data, and reads each column of data in the page data, sequentially from the leading row number to the last row in the column of data; a data search unit which compares each row in each read column of data with first search criteria, from the first row to the last row, and outputs a comparison result; and a search result aggregation unit which, when a comparison result for a range of columns specified by a search request has been output, compares each row in the comparison result with second search criteria, and determines one or more rows in the comparison result that satisfy the second search criteria.

Abstract: A method is provided for searching semiconductor parts using a last alphabet deletion algorithm. A user can newly create a query term for a relevant semiconductor part by deleting an entered relevant semiconductor part name one by one starting from a last alphabet of the query term entered by the user so that the users can search the query term complementarily in order to search a desired semiconductor part more correctly although he or she incorrectly recognizes a relevant semiconductor part name or erroneously enters a query with a typo for the semiconductor part name during the retrieval of a specification of a semiconductor part when the user desires to grasp the function and use method of the semiconductor part which the user want to use.

Abstract: Techniques are provided for creating a backup of a source pluggable database (SPD) of a source container database and porting the backup for recovery into a different target container database. In an embodiment, a source database server retrieves metadata that describes backups of the SPD. The source database server inserts, into an unplugged pluggable database of the SPD, the metadata that describes each of the backups. For example, unplugging the SPD may automatically create the unplugged pluggable database. Eventually, the unplugged pluggable database may be plugged into the target container database. A target database server transfers the metadata that describes each of the backups from the unplugged pluggable database and into the target container database. Based on at least one backup and the metadata that describes backups of the SPD, the target database server restores a target pluggable database within the target container database.

Abstract: In a processing time, a dense graph is received, nodes of the dense graph are clustered using the first parameter to generate a sparse graph, a weight for each edge of the sparse graph is assigned; and the weights are stored in computer memory for use in a run time. In the run time after the processing time, a request for a weight of an edge between two first nodes of the dense graph is received, using a weight stored in computer memory, an approximated weight for the request is found and returned.

Abstract: Lineage graphs corresponding to data objects are generated. A data object of the data objects is associated with a source dataset table stored at a data lineage server (DLS). The source dataset table includes data of the data object received from a dataset stored at a data source system (DSS). A lineage graph corresponding to the dataset is determined from the lineage graphs. Based on the lineage graph, one or more data lineage structures are provided. The one or more data lineage structures include data from the dataset and from one or more datasets related to the dataset, and define lineage relationships between the data object and one or more data objects corresponding to the one or more datasets.

Abstract: A method includes generating, by a processor, a Systems, Applications, Products (SAP) profile standardization data structure for secure SAP profile entry submission. A reporting data structure including records from a first SAP profile data structure and a second SAP profile data structure is generated for a visual line-by-line result of a comparison of the first SAP profile data structure with the second SAP profile data structure. The reporting data structure comprises a compare template data structure including the first SAP profile data structure and the second SAP profile data structure placed side-by-side and each indicating the visual line-by-line result of the comparing.