Abstract: Search using data warehouse grants including determining, for a user, one or more access grants for a cloud-based data warehouse, each of the access grants comprising an object identifier of a data object accessible to the user; generating a search query comprising one or more search terms and a filter based on each of the access grants; sending the search query to a search indexing service configured to maintain an index of the cloud-based data warehouse; and receiving, in response to the search query, first search results responsive to the one or more search terms and included in a scope based on the filter.

Abstract: A computing system may store a first file in a system repository that is to be synchronized with at least a first repository associated with a first client device and a second repository associated with a second client device. The computing system may determine that the first repository is to receive a downloaded copy of at least a portion of the first file, and may cause a copy of the at least a portion of the first file to be downloaded from the system repository to the first repository. Based at least in part on the computing system determining that the first repository is to receive the downloaded copy, an identifier of the at least a portion of first file may be stored in the second repository without storing a copy of the at least a portion of the first file in the second repository.

Abstract: A technique for reducing recovery time in a computing apparatus includes: storing data in a key-value store residing in a persistent memory, the key-value store including a plurality of persistent nodes including key-value pairs, the key-value pairs of the persistent nodes being unsorted; caching selected persistent nodes in a volatile memory, the key-value pairs of the cached nodes being sorted, the caching including instantiating a dual pointer for each cached node, the dual pointer including a volatile pointer to a child node of the cached node and a persistent pointer to the child node of the corresponding persistent node in the key-value store; and rebuilding the cache of selected nodes upon demand using the dual pointers in the event of recovery.

Abstract: In an approach to online reorganization of database tables with concurrent updates using virtual partitions, responsive to receiving a table to reorganize, rows of the first table are selected, where the rows of the first table create a first virtual partition. A memory for a second virtual partition is allocated, where the second virtual partition is appended to a second table. A union view is created comprising a union of remaining rows of the first table with the second table, where the remaining rows of the first table have not been copied to the second table. The first virtual partition is copied into the second virtual partition. Responsive to receiving queries before copying the first virtual partition into the second virtual partition is complete, the queries are allowed to access the union view.

Abstract: A distributed join is performed with two large data sets that are shuffled on different keys without shuffling the larger data set, even when the distributed join is performed on the key of the smaller data set. A third data set is generated that is shuffled on the key of the smaller data set and includes data associated with the key of the larger data set. The third data set and the smaller data set are joined on the shuffle key of the smaller data set to create a fourth data set that includes the first and second key. The fourth data set is shuffled on the key of the larger data set. The fourth data set and the larger data set are joined on the key of the larger data set to generate a fifth data set that can be shuffled on the key of the smaller data set.

Abstract: Methods, systems, and computer-readable storage media for range queries over encrypted data include actions of receiving a range query token, determining one or more of whether a tree list of an encrypted search index is empty and a range of the token intersects with a range accounted of a tree in the tree list, the encrypted search index including the tree list and a point list, receiving encrypted query results based on one of a search tree, if the tree list is not empty and a range of the token is at least a sub-range of a range accounted for in the tree list, and the point list, if the tree list is empty or the range of the token is not at least a sub-range of a range accounted for in the tree list, and updating the encrypted search index based on the token.

Abstract: Herein are fine grained updates to pieces of JavaScript object notation (JSON) documents by database statements that can update, delete, and insert parts of JSON documents. In an embodiment, a computer receives a request that specifies a modification of a JSON document that is stored in a compressed format in persistent storage. The modification adds additional content to the JSON document, and/or replaces an old value in the JSON document with a new value that is not a same size as the old value. The modification is recorded in a change log. The change log is eventually applied to the compressed format of the JSON document in the persistent storage without entirely rewriting the compressed format of the JSON document in the persistent storage.

Abstract: A system has a collection of central processing units. Each central processing unit is connected to at least one other central processing unit and has a path into flash memory resources. A central processing unit supports a mapping from a data address space, to a flash memory virtual address space, to a flash memory virtual page number to a flash memory physical address space.

Abstract: A computer-implemented method, computerized apparatus and computer program product for query performance prediction, the method comprising: obtaining a result list comprising a listing of documents retrieved from a collection in response to a query; obtaining for each of the listed documents in the result list a score indicating a measure of the document's relevance to the query; sampling the result list to obtain a plurality of sub-lists each of which comprising a listing of documents subsumed by the result list; for each of the plurality of sub-lists, analyzing scores of the documents listed therein to obtain a sample performance estimator; and estimating performance of the result list based on the sample performance estimator of each of the plurality of sub-lists.

Abstract: A computing system may perform a method that involves receiving, from a first computing device, a request for a file, where the request identifies at least one user who has access to the file and includes information indicative of the file. The method further includes identifying, based at least in part on the received request, the file within a repository of files, sending, to a second computing device, a first indication of the request to access the file, receiving, from the second computing device, a second indication that the file is to be made accessible via the first computing device, and causing the file to be transferred from the repository to the first computing device.

Abstract: Pinnacle concepts are not amenable to detection by the use of keywords. A unit of natural language discourse (UNLD) “refers” to a pinnacle concept “C” when that UNLD uses linguistic expressions in such a way that “C” is regarded as expressed, used or invoked by an ordinary reader of “L.” A reference can have a “reference level” value that is proportional to: the “strength” with which the pinnacle concept is referenced, the probability that a pinnacle concept is referenced or both strength and probability. Pinnacle concepts can be divided into Quantifiers and non-Quantifiers. A Quantifier can modify the reference level assigned to a non-Quantifier. A concept “C,” that is determined to be referenced by a UNLD “x,” after application of its Quantifiers, is said to be asserted by “x.” Concept-based classification is the identification of whether a pinnacle concept “C” is asserted by a UNLD. Concept-based classification can be used for concept-based search.

Abstract: Data records are joined using a computer. Data records in a first plurality of data records and a second plurality of data records are hashed. The data records in the first and second pluralities are respectively assigned to first and second groupings based on the hashes. Associated pairs of groupings from the first and second groupings are provided to a thread executing on a computer processor, and different pairs are provided to different threads. The threads operate on the pairs of groupings in parallel to determine whether to join the records in the groupings. A thread joins two data records under consideration if the hashes associated with the data records match. The joined data records are output.

Abstract: Systems and methods for engagement mapping based on counterfactual experiments are provided. In example embodiments, a network system receives parameters for one or more counterfactual experiments or tests. Based on the parameters, the network system selects one or more users of a social network platform to subject to the test(s) and selects edges of a social network of each of the one or more users to block. The network system then filters out notifications and feed items from the selected edges of the one or more users. Behavior data of the one or more users based on the filtering out of the notifications and feed items is aggregated, whereby the behavior data indicates engagement of the one or more users on the social networking platform based on the filtering of the notifications and feed items. Recommendations are derived based on the aggregated behavior data and presented to the users.

Abstract: Methods and systems for indexing data for a search tool are disclosed, wherein the method is performed using one or more processors. The methods and systems may comprise an operation of providing an indexing application programming interface (API) for implementation in relation to one or more data resources of a data processing platform requiring data of the data resource to be indexed for searching using a search tool of the data processing platform. The interface may be configured, when implemented in relation to a data resource, to send data indicative of one or more definitions of data to be crawled from said data resource to an indexing system of the data processing platform, and to generate an event queue indicative of one or more events associated with said defined data that have occurred in relation to the data resource.

Abstract: A graphical classification method for classifying graphical structures, said graphical structures comprising nodes defined by feature vectors and having relations between the nodes. The method includes representing the feature vectors and relations as a first graphical representation. The method also includes mapping said first graphical representation into a second graphical representation wherein the mapping comprises using an attention mechanism, said attention mechanism establishes the importance of specific feature vectors dependent on their neighbourhood and the relations between the feature vectors, said mapping transforming the feature vectors of the first graphical representation to transformed feature vectors in the second graphical representation. The method also includes combining the transformed feature vectors to obtain a third combined representation said third combined representation being an indication of the classification of the graphical structure.

Abstract: The invention relates to computer-implemented systems and methods for analyzing data from a variety of data sources. Embodiments of the systems and the methods further provide for generating responses to specific questions based on the analyzed data, wherein the generating includes: retrieving related documents associated with the analyzed data; determining which information should be reported from which of the retrieved related documents; and providing a response based on the determination and a graph schema associated with the related documents.

Abstract: A heterogeneous database storage system based on optical disk includes a magnetic disk storage device and an optical disk storage device connecting, via a data connection, to a server. A relational database management system, a non-relational database management system, a data processor and a database connector are installed on the server. Fields of a record are divided into two parts by the data processor. A part of the fields are in a relational database, and the other part of the fields are in a non-relational database. Fields of the relational database constitute a subrecord of the relational database, and Fields of the non-relational database constitute a subrecord of the non-relational database. The subrecord of the relation database and the corresponding subrecord of the non-relational database form an integral record by the database connector.

Abstract: Building and using multiple different types of sub-indices to search a database is provided. A plurality of different physical data ranges is generated within the database based on a set of logical hot data ranges and a set of logical non-hot data ranges to form a set of physical hot data ranges and a set of physical non-hot data ranges. A set of sub-index types is built for each respective data range of the plurality of different physical data ranges within the database using a set of selected high-speed sub-index types for the set of physical hot data ranges and another set of selected sub-index types for the set of physical non-hot data ranges to accelerate data availability for query. An index is built for the database using the set of sub-index types built for each respective data range of the plurality of different physical data ranges within the database.

Abstract: Disclosed herein are computer-implemented methods, computer-implemented systems, and non-transitory, computer-readable media, to index blockchain data for storage. One computer-implemented method includes generating one or more encoded blocks by executing error correction coding (ECC) on one or more blocks of a blockchain. Each of the one or more encoded blocks are divided into a plurality of datasets. An index is provided for the one or more encoded blocks, where the index is used to index each dataset of the plurality of datasets to a blockchain node at which a respective dataset is stored.

Abstract: A system and method for leveraging a native operating system (130) page cache (315) when using non-block system storage devices (120) is disclosed. A computer (105) may include a processor (110), memory (115), and a non-block system storage device (120). A file system (135) may be stored in memory (115) and running on the processor (110), which may include a page cache (315). A key-value file system (KVFS) (145) may reside between the file system (135) and the storage device (120) and may map received file system commands (310) to key-value system commands (330) that may be executed by the storage device (120). Results of the key-value system commands (330) may be returned to the file system (135), permitting the operating system (130) to cache data in the page cache (315).

Abstract: Systems and methods may be used to display document critiques on a display device. A method may include receiving information including a document type of a document. The method may include determining a set of critiques for use with the document type, the set of critiques including a critique specific to the document type. The method may include providing, on a display, feedback within the document, including a visual indication on a user interface presenting the document, based on the set of critiques, for text within the document.

Abstract: Described herein are systems and methods for indexing document data in order to facilitate chemical structure searching. The document data may include chemical structure data corresponding to a chemical structure. Bit-screening data and connection data in the chemical structure data may be identified. The bit-screening data may correspond to constituent elements of the chemical structure, and the connection data may correspond to connections between the one or more constituent elements. A string tag may be generated based on a portion of the identified bit-screening data. The string tag may include an alphanumeric value for describing the chemical structure that corresponds to the chemical structure data. The document data may be indexed based on the string tag. The chemical structure data corresponding to a chemical structure in the document may be searchable based on correlating at least a portion of text data of a query with the indexed document data.

Abstract: The present disclosure relates to a method of providing product information, the method including identifying a product corresponding to a request from a user, verifying whether a category of the product is included in a first category for which brand information is additionally provided, identifying, when the product belongs to the first category, logo content mapped based on brand information of the product identified from information on or regarding the product, and providing, in response to the request, a page related to a product in which the brand information of the product including the identified logo content is displayed in a first area.

Abstract: The disclosed embodiments provide a system that facilitates the processing of network data. During operation, the system obtains a set of event streams from one or more remote capture agents over one or more networks, wherein the set of event streams comprises time-series event data generated from network packets captured by the one or more remote capture agents. Next, the system causes for display, within a graphical user interface (GUI), a first set of user interface elements, wherein the first set of user interface elements includes event stream information for an event stream in the set of event streams and a first graph of a metric associated with the time-series event data in the event stream. The system then updates the first graph in real-time with the time-series event data from the one or more remote capture agents.

Abstract: Compounding file system metadata operations via buffering is disclosed. In various embodiments, an indication to send locally-stored file system operations to a remote file system metadata server is received. A dependency graph or other data structure reflecting dependencies between the locally-stored file system operations to identify a linear chain of dependent file system operations. Operations comprising the linear chain are combined into a compound file system operation. The compound file system operation is sent to the remote file system metadata server.

Abstract: Methods, systems and computer program products are described herein that enable data workload optimization through “what-if” modeling of indexes and index recommendation. In an example aspect, a system is configured to accept a workload comprising a plurality of queries directed at data having a first physical data layout, generate a set of candidate indexes based on the plurality of queries, enumerate index configurations based of the set of candidate indexes, each index configuration comprising a subset on the set of candidate indexes, generate a hierarchical graph of the index configurations, search the hierarchical graph for a recommended index configuration comprising an index configuration with the lowest estimated cost while pruning index configurations not considered from the graph of index configurations to generate a pruned graph, execute a graph query against the pruned graph generating a graph query result and perform an optimization operation based on the graph query result.

Abstract: A method includes receiving a set of documents related to data discovery issues, wherein at least a first data discovery issue is unrelated to a second data discovery issue. The method further includes generating a map of terms and words for the set of documents that correspond to concepts. The method further includes providing a user interface that includes a search analytics tool to a user associated with the first data discovery issue.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for enumerating rooted partial subtrees are disclosed.

Abstract: Embodiments of the present invention provide a divide-and-conquer algorithm which divides expanded data into a cluster of machines. Each portion of data is used to train logistic classification models in parallel, and then combined at the end of the training phase to create a single ordinal model. The training scheme removes the need for synchronization between the parallel learning algorithms during the training period, making training on large datasets technically feasible without the use of supercomputers or computers with specific processing capabilities. Embodiments of the present invention also provide improved estimation and prediction performance of the model learned compared to the existing techniques for training models with large datasets.

Abstract: Disclosed herein are computer-implemented methods, computer-implemented systems, and non-transitory, computer-readable media, to index blockchain data for storage. One computer-implemented method includes generating one or more encoded blocks by executing error correction coding (ECC) on one or more blocks of a blockchain. Each of the one or more encoded blocks are divided into a plurality of datasets. An index is provided for the one or more encoded blocks, where the index is used to index each dataset of the plurality of datasets to a blockchain node at which a respective dataset is stored.

Abstract: A method of automatically estimating the difficulty level of online content. The method includes receiving, by one or more processors, electronic content which is accessible via an online network and which is at least temporarily stored in at least one non-transitory storage media, extracting, by the one or more processors, structural and non-linguistic information from the electronic content. The method further includes extracting, by the one or more processors, linguistic information from the electronic content. The method further includes generating, by the one or more processors, a difficulty estimation for the content based on the structural and non-linguistic information in addition to the linguistic information. The method further includes generating, by the one or more processors, a recommendation of a subset of the electronic content to a user based on the difficulty estimation.

Abstract: Methods, systems, and computer program products for contextual anomaly detection across assets are provided herein. A method includes obtaining time-series data frames corresponding to assets; clustering the assets into one or more cohorts based on the time-series data frames, each cohort comprising assets having statistically similar time-series data frames; for each given asset within each cohort: applying a time-context window to the portion of the time-series data frames corresponding to the given asset to generate at least one transformed data frame, and determining an asset distribution for the given asset based on the at least one transformed data frame; determining one or more of that at least one of the assets within at least one of the cohorts is anomalous and that at least one of the cohorts is anomalous; and causing at least one remediation action to be performed based on the determining.

Abstract: A method of increasing the efficiency of the Aviation Environmental Design Tool (AEDT) by using a computer algorithm to generate an input file with far fewer flight tracks than would normally be required to obtain the same AEDT results using the same data pool.

Abstract: Disclosed herein is a field-of-interest based preference search guidance system.

Abstract: A method and apparatus for interacting with a distributed database is provided. The database includes plural storage devices. Plural keys are generated and associated with a data item. Plural operations, such as storage or retrieval operations are then initiated on the distributed database. Each operation specifies a different key acting as an index for a corresponding data record. The keys can be generated using functions operating on an initial descriptor. For example, the characters of the descriptor can be reordered to produce new keys. As such, a data item can be stored in multiple different storage devices to provide redundancy.

Abstract: Techniques and technologies described herein can generate and provide identifiers, such as unique identifiers, for individual records of aggregate data. Such identifiers allow systems to cache and reuse individual records of aggregate data. Also, such identifiers can facilitate simpler analytic views of aggregate data.

Abstract: Disclosed herein are systems, methods, and devices for providing load unit recommendations. An example method includes monitoring queries executed by a database management system including a database object, determining an access frequency of the database object based upon the monitoring, and determining relative access counter information for the database object based on the access frequency. Subsequently, the method includes generating a sorted element based on the relative access counter information, determining threshold values based on threshold information and the sorted element, and determining a load unit for the database object based on the sorted element and the threshold values. The load unit indicates whether to load the whole database object, or only a portion thereof, into a main memory of the DBMS while accessing the database object.

Abstract: Example implementations include a system to present opportunities from third-party applications, with a data processing system comprising memory and one or more processors to identify, via an interface of the data processing system, a third-party application of a plurality of third-party applications configured with application programming interfaces (“APIs”) compatible with the interface of the data processing system, transmit, to the third-party application, a query constructed based on a template that is compatible with an API of the third-party application, receive, responsive to the query, a response from the third-party application comprising an opportunity event, select a participant object that satisfies one or more parameters associated with the opportunity event, and provide, to a computing device linked with the participant object, an indication of the opportunity event.

Abstract: Disclosed herein is a platform for translating various user input into a standardized input used to cause a database to sort data in a specified manner and present the data in a graphic user interface according to user instruction. User input is a text string that includes a first set of characters and a second set of characters split by a dividing symbol. Based on the choice of dividing symbol and the arrangement of the first set of character and second set of characters the system converts the input into a standardized form.

Abstract: Disclosed herein are computer-implemented methods, computer-implemented systems, and non-transitory, computer-readable media, to index blockchain data for storage. One computer-implemented method includes generating one or more encoded blocks by executing error correction coding (ECC) on one or more blocks of a blockchain. Each of the one or more encoded blocks are divided into a plurality of datasets. An index is provided for the one or more encoded blocks, where the index is used to index each dataset of the plurality of datasets to a blockchain node at which a respective dataset is stored.

Abstract: A collector (110) included in a data delivery control apparatus (100) collects data from a PLC (603, 604) and outputs the data to which collection time information indicating collection time is added. A validity determiner (140) determines whether the data is valid based on whether the collection time indicated by the collection time information added to the data is at or later than a starting time indicating a time at which a data sequence as a preset data processing sequence is started. A deliverer (130) delivers the data in accordance with a data sequence setting defining the data sequence in response to validity determination means determining that the data is valid.

Abstract: Co-browsing shadow DOM elements is enabled by detecting shadow host DOM elements and nested shadow host DOM elements on the visitor DOM. Identifiers are attached to the DOM elements within shadow DOM regions to uniquely and efficiently identify the DOM elements within shadow DOM regions and nested shadow DOM regions. When shadow DOM elements are transmitted on the co-browse session, the identifiers specify where the DOM elements are located (which shadow DOM regions) so that the agent co-browse JavaScript is able to efficiently locate the DOM elements without querying each shadow DOM region. The agent co-browse JavaScript maintains a map correlating shadow root identifiers with the HTML of the shadow DOM regions and associated constructed stylesheets, so that the HTML of a shadow DOM region is not required to be re-transmitted if the portion of the DOM including the shadow host is replaced.

Abstract: A multiresolution voxel space is discussed herein. Data can be represented in individual levels in the multiresolution voxel space. A first level can correspond to a first region of an environment and a second level can correspond to a second region of an environment, the second region corresponding to a subset of the first region. In some examples, the levels can comprise a same number of voxels, such that the first level covers a large, low resolution region, while the second level covers a smaller, higher resolution region, though more levels are contemplated. Data represented in the voxel spaces can be processed at higher resolution where available and at a lower resolution where a data density is lower and combined in an intelligent manner. Voxel spaces can be updated based on movement of the sensor providing the data.

Abstract: A method, system and computer readable medium for performing a cognitive search operation comprising: receiving training data, the training data comprising information based upon user interaction with cognitive attributes; performing a machine learning operation on the training data; generating a cognitive profile based upon the information generated by performing the machine learning operation; and, performing a cognitive search operation on a corpus of content based upon the cognitive profile, the cognitive search operation returning cognitive results specific to the cognitive profile of the user.

Abstract: Implementations are related to providing image selection suggestions. In some implementations, a method includes receiving first user input indicative of selection of one or more first images in an image library and determining one or more first image characteristics of the one or more first images. The method further includes identifying one or more second images in the image library. Each image of the one or more second images is associated with at least one second image characteristic that matches at least one of the one or more first image characteristics. The method further includes causing a user interface to be displayed. The user interface includes the one or more second images and enables selection of the one or more second images by a user.

Abstract: Operational metrics of a distributed collection of servers in a cloud environment are analyzed by a service to intelligently machine learn which operational metric is highly correlated to incidents or failures in the cloud environment. To do so, metric values of the operational metrics are analyzed over time by the service to check whether the operation metrics exceed a particular metric threshold. If so, the service also checks whether such spikes in the operation metric above the metric thresholds occurred during known cloud incidents. Statistics are calculated reflecting the number of times the operational metrics spiked during times of cloud incidents and spiked during times without cloud incidents. Correlation scores based on these statistics are calculated and used to select the correlated operational metrics that are most correlated to cloud failures.

Abstract: Disclosed is an intelligent recommendation system for identifying and/or providing personalized one or more independent applications and/or healthcare related media content (e.g., multimedia content and applications involved in healthcare or the treatment of various health conditions of a user) to a plurality of user devices and/or client devices.

Abstract: An information processing apparatus includes an acquisition unit that acquires a degree of user's repeated use of items available in a service used by the user from a use history of the service; and a notification unit that notifies the user about an item in descending order of a degree of matching with the user among the items available in the service by using the degree of matching of each of the items with the user that is obtained from features of the user indicative of item use tendency in the service reflecting the degree of user's repeated use acquired by the acquisition unit and features of the each of the items indicative of characteristics of the each of the items.

Abstract: Systems and methods are provided herein for identifying a playlist of highlights to use for refreshing a user on a plot related to a media asset the user has requested to access based on how long it has been since the user last saw related programming. The media guidance application may receive a request from a user to access a media asset and may determine whether the user previously consumed a related media asset to the media asset. The media guidance application may determine whether a period of time between receiving the request and a time when the user previously consumed the related media asset exceeds a threshold period of time. If the period of time does not exceed the threshold, the media guidance application may play back a predefined playlist of highlights, and if it exceeds the threshold, the media guidance application may play back a customized playlist of highlights.

Abstract: A method for rendering context based information on a user interface includes receiving a user request to extract the context based information from a database. The database includes a plurality of documents and the request includes at least one search criteria required to determine a context of the user request. The method includes generating a list of documents corresponding to the context of the user request and rendering on a viewing portion of the user interface the list of documents corresponding to the context of the user request.