Abstract: Aspects of the present disclosure involve, a customizable system and infrastructure which can used to retrieve and scout metadata on a distributed file system for data management. In one embodiment, a system is introduced which can be used to scout metadata from a distributed file system using an isolated node which can enable the determination and response to customized queries. The customizable system can include a NameNodeAnalytics module which can stream, filter, and process client queries without locking the NameNode in the distributed file system. In another embodiment, the analytics distributed file system can communicate with a streaming API and other time-series module for the reporting and visual representation of the metrics obtained.

Abstract: A system and method for providing context to collaborative media. Such a system may comprise associating timestamps with media as entered by one or more users. When a user types, or otherwise inputs media (text, images, video, audio, files, etc.), such media may be associated with a project, as well as provided an associated timestamp. Such associations between media and timestamps may be stored in a database. When such media comprises text, various aspects of the system may provide for associating each character with a timestamp. When one or more users views the project, an application may cause all media to be displayed to the viewing user. The viewing user may click, highlight, or otherwise select any of the media such that only media relevant to the selected media (e.g. captured within 1 s, 2 s, 5 s, etc.) is displayed in a related media panel.

Abstract: A method performed on a client computing device for providing a graphical user interface for searching through topics and user profiles. It includes rendering, the graphical user interface comprising a first search node, associated with a first node data structure; receiving user input corresponding to a selection of one of the first plurality of nodes as a second search node; and node position input of the second search node; transmitting, a selection request corresponding to the node selection of one of the first plurality of nodes; receiving, data relating to a second plurality of node data structures associated with the second search node; generating on the graphical user interface the second search node at a location on the graphical user interface corresponding to the node position input; and a linking member connecting the first search node to the second search node.

Abstract: The data storage system according to certain aspects can implement table level database restore. Table level database restore may refer to restoring a database table and its related data without restoring the entire database. The data storage system may use table metadata index to implement table level restore. A table metadata index may be created for each table, e.g., during a backup of the database. The table metadata index for a table can include any type of information for restoring the table and its related data. Some examples of the type of information included in the table metadata index include the following: container for the table, table backup location, system data, table index, table relationships, etc. Table metadata index can make the restoring of tables fast and efficient by packaging information that can be used to restore a table and its related data in an easily accessible manner.

Abstract: According to one exemplary embodiment of the present disclosure, disclosed is a computer program stored in a computer readable storage medium. The computer program causes operations for improving data retrieval performance to be performed when the computer program is executed by one or more processors of a computing device, and the operations include: an operation of initiating an index search for retrieving a target index key from a root node of an index tree; an operation of performing an index tree search to a child node along a link connected to the child node; and an operation of reading a currently searched node and determining whether to change an index search route.

Abstract: In one embodiment, a method includes accessing a first set of posts that includes a number of posts of the online social network posted within a first timeframe. In particular embodiments, each post is associated with one or more topics of a number of topics of the online social network. The method also includes determining a trending topic from the plurality of topics of the online social network; and generating a news-event object associated with the trending topic. In particular embodiments, the news-event object includes a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic. The method also includes identifying, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; and generating one or more search-results modules. In particular embodiments, each search-results module includes one or more search results.

Abstract: The data storage system according to certain aspects can implement table level database restore. Table level database restore may refer to restoring a database table and its related data without restoring the entire database. The data storage system may use table metadata index to implement table level restore. A table metadata index may be created for each table, e.g., during a backup of the database. The table metadata index for a table can include any type of information for restoring the table and its related data. Some examples of the type of information included in the table metadata index include the following: container for the table, table backup location, system data, table index, table relationships, etc. Table metadata index can make the restoring of tables fast and efficient by packaging information that can be used to restore a table and its related data in an easily accessible manner.

Abstract: A digital media content classification, discovery, and management system includes a computerized database storing content representative identifiers corresponding to content items. Each of the content representative identifiers is keyed to a plurality of author-based, content-centered criteria elements, wherein an input selection field of a user GUI has a plurality of selectable fields which matches at least one of the plurality of author-based, content-centered criteria elements. management of the digital media content may include valuation management where the digital content items are ranked into valuation tiers. The ranking is analyzed to designate the digital content items to have a valuation value within at least one of the plurality of valuation tiers. The digital content items axe graphically displayed on a GUI of a remotely-located user computing device and download requests are received from the user computing device.

Abstract: Computer systems, devices, and associated methods of providing personalized content suggestion are disclosed herein. In one embodiment, a method performed by a search engine includes receiving an indication to perform a search for content items from a member. In response to the received indication, the search engine generates a list of content items represented as nodes in an interaction graph. The nodes uniquely correspond to the member from whom the indication to perform the search is received. In the nodes, at least one is indirectly connected to a node representing the member via at least one other node in the interaction graph.

Abstract: A file-management system of a computer operating system transfers a hierarchical set of files. The system generates a histogram of the files' true filesizes, using a non-parametric kernel-density estimation (KDE) procedure to estimate the width of each histogram bin. The system splits the fileset into subsets and generates a second-level histogram to represent the true-filesize distribution of each subset, using the previously estimated kernel width to initialize another KDE procedure for each second-level histogram. The distributions identified by each second-level histogram are used to organize the file transfer into a series of passes, each of which completely transfers a group of files that together fit into the computer's I/O buffer minimal wasted space. A waypoint is set at the beginning of each pass and if the system is interrupted mid-transfer, no file transferred before the most recent waypoint is lost.

Abstract: Embodiments disclosed herein generate visual summaries of data and improve the same using cognitive feedback. In one embodiment, a data visualization application determines properties associated with data or portion(s) thereof, and then generates and combines visualizations of the determined properties into visual data summaries. Examples of visualizations that may be generated include box plots, histograms, graphs, charts, and word clouds. Examples of visual summaries that combine such visualizations include videos, animated GIF (Graphics Interchanged Format) files, powerpoints, PDF (Portable Document Format) files, and web pages. Subsequent to generating visual summaries, the data visualization application may monitor user interactions with those visual summaries and update the same by rebuilding the visual summaries based on the user interactions.

Abstract: Page filtering in a database using a compression dictionary. A page of a database table is compressed, creating a compression dictionary. The compression dictionary includes entries with a byte sequence from the page and a compression symbol associated with the byte sequence. A part of the compressed page, the compression dictionary, and a page symbol list with compression symbols from the dictionary present in the part of the page, are received. A query having a predicate with a predicate value is received. A predicate symbol list, including symbols in the dictionary whose byte sequences at least partially match the predicate value, is generated. Based on the predicate symbol list and the page symbol list, it is determined that at least one symbol from the predicate symbol list is also present in the part of the page. The query is performed by evaluating the predicate on the part of the page.

Abstract: Page filtering in a database using a compression dictionary. A page of a database table is compressed, creating a compression dictionary. The compression dictionary includes entries with a byte sequence from the page and a compression symbol associated with the byte sequence. A part of the compressed page, the compression dictionary, and a page symbol list with compression symbols from the dictionary present in the part of the page, are received. A query having a predicate with a predicate value is received. A predicate symbol list, including symbols in the dictionary whose byte sequences at least partially match the predicate value, is generated. Based on the predicate symbol list and the page symbol list, it is determined that at least one symbol from the predicate symbol list is also present in the part of the page. The query is performed by evaluating the predicate on the part of the page.

Abstract: Implementations of the present specification provide classification and indexing methods and devices, and methods and devices for querying similar samples. During classification, the samples in the sample set are clustered at two levels, and the clustering results are recorded in a first vector table and a second vector table. During indexing, indexes are established at two levels for each sample in the sample set, where the first level index points to a coarse cluster center to which the sample belongs, and the second level index points to a segment cluster center corresponding to a segment vector of the sample. During query of similar samples, searches are performed at two levels on the query samples. The first-level search is to determine a coarse cluster center that is closer to the query sample from the first vector table obtained through classification, and obtain comparison samples that belong to the coarse cluster center.

Abstract: An example operation may include one or more of monitoring, by an adaptive traffic engine, transactions data of a blockchain, detecting, by the adaptive traffic engine, a transaction commit event time out in a blockchain, determining, by the adaptive traffic engine, a processing queue of a the blockchain, measuring, by the adaptive traffic engine, a sending rate of the blockchain, and adjusting the sending rate, by the adaptive traffic engine, based on the transaction commit event time out, the processing queue and the sending rate to optimize performance of the blockchain.

Abstract: Systems, methods, and computer program products to perform an operation comprising receiving, by a database management system (DBMS), a first query specifying to insert data into a database, generating, by a first clustering algorithm applied to a first portion of the data, a first clustering value for the first portion of the data, and storing the data and the first clustering value as a record in a table of the database, wherein the first clustering value is stored in a first hidden column configured to store clustering values in the table.

Abstract: A storage system in one embodiment comprises a plurality of storage devices and a storage controller. The storage system implements a loopback replication process in which one or more source storage objects are replicated to one or more corresponding target storage objects within the storage system. The storage system obtains a pairing identifier, pairs a source storage object with a target storage object by associating respective distinct instances of the pairing identifier with the source storage object and the target storage object, and replicates the source storage object to the target storage object based at least in part on the associated instances of the pairing identifier. Each of the source and target instances of the pairing identifier comprises a collision field. The collision fields of the source and target instances of the pairing identifier have respective distinct values in order to prevent collisions between the source and target storage objects during loopback replication.

Abstract: A method of improving a data storage system includes dividing input/output (I/O) data into a plurality of blocks, and deduplicating the I/O data to produce deduplicated I/O data. The deduplication includes determining whether a first block is a duplicate block of another one of the blocks, and in response to determining that the first block is a duplicate block, replacing the duplicate block with a reference to the first block. The method determines whether the first block has a maximum overlapping area of duplicate data with a particular one of the blocks that is not a duplicate block, and replaces the particular block with a reference to the first block and to non-overlapping data.

Abstract: An apparatus in one embodiment comprises at least one processing device comprising a processor coupled to a memory. The processing device is configured to determine a plurality of block offsets indicating respective positions of data within a plurality of uncompressed data blocks respectively encoded to have variable sizes, to generate a block index file comprising the plurality of block offsets, a plurality of block positions and a plurality of block sizes respectively corresponding to the plurality of uncompressed data blocks, to compress data from at least one uncompressed data block of the plurality of uncompressed data blocks to at least one compressed data block of a plurality of compressed data blocks, and to utilize the block index file in connection with decompressing the compressed data.

Abstract: Systems, methods and computer storage media for enhancing object representations using data items selected based upon inferred user intents are provided. Information indicative of an initial object representation is received. At least one user intent related to the initial object representation is inferred based upon one or more of a plurality of artifacts related to the user and/or the user's activities. Based upon the inferred user intent and the initial object representation, one or more data items are determined that are relevant to the both the intent and the representation. The determined data items are mapped to the initial object representation to create an enhanced object representation.