Abstract: Implementations include providing a database system that a plurality of tenant systems interact with, providing a shared database schema and a plurality of tenant database schemas, the shared database schema including a shared table, and each tenant database schema being assigned to a respective tenant and including a view into the shared table, which includes a tenant specification field, and a row visibility field, the tenant specification field indicating a tenant, to which a respective row is assigned, and the row visibility field indicating visibility of a respective row to respective tenants.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. A write command is received for writing a selected data segment to a physical storage location. A determination is made as to whether the write command includes an indicator including at least one of a bit and a flag, the indicator designating that the selected data segment must not be subject to a deduplication operation. An indicator is configured by providing a system call with an extended attribute indicating that the selected data segment must be written to physical memory notwithstanding the selected data segment matching data written to the physical memory earlier in time.

Abstract: A system is described that, after executing a parameterless search query to identify results that are determined to be relevant to a user of a device, determines a respective target property, for each of the results, that indicates whether a result is associated with audio content, visual content, audio and visual content, haptic content, or textual content. The system also determines one or more dynamic properties, of the device, that indicate one or more of a network connection strength, connection status to an audio output device, battery level, or connection status to a multimedia streaming device. Based on the one or more dynamic properties of the computing device and the respective target property of each of the results, the system determines a dynamic ranking of the results and transmits the results and the dynamic ranking to the device.

Abstract: Exemplary embodiments relate to techniques for determining social networking or messaging user affinity and engagement coefficients (e.g., a measure of the connectedness between two people in a network). The described techniques are particularly well-suited to cases in which only limited information is available, such as when a new user joins a network and only the user's contacts list is available. The available information may be used to determine a group of existing users to which the new user is connected. Some embodiments relate to calculating scores among these existing users in order to infer an affinity for the new user to the existing users. Other embodiments involve calculating bilateral scores that reflect a degree of mutual affinity between two users.

Abstract: A distributed storage and replication system includes a MDC module, multiple IO routing modules, and multiple OSD nodes. The MDC module is adapted to configure at least two partition, the IO routing module is adapted to route an IO request to an OSD node, and the OSD node is adapted to execute storage of data corresponding to the IO request. The MDC is configured to determine a faulty OSD node, update a partition view of a partition group that includes a partition on the faulty OSD node, and send an updating notification to a primary OSD node in the updated partition view. The primary OSD node is adapted to process replication of the data corresponding to the IO request. According to embodiments of the present disclosure, processing performance, fault tolerance, and availability of consistency replication are improved.

Abstract: The methods and systems for providing real-time business intelligence using national language queries facilitate a user to search within a data warehouse using a natural language question. Such business intelligence platform may receive a natural language based question, extract one or more key words from the natural language based question, determine a first dependency graph of the one or more key words based on a relationship among the one or more key words, determine a second dependency graph of the one or more key words based on previously stored search indices, merge the first and the second dependency graphs to generate an integrated dependency graph, and generate a formatted search string based on the integrated dependency graph.

Abstract: Methods, devices and systems to make compressed backup copies of in-use compressed database indices are described. In general, an “oldest” time at which index pages in working memory had been updated is identified. Compressed index pages may be directly copied without the need to bring them into working memory or uncompressing them. The identified “oldest” time is then associated with the compressed backup copy. In some embodiments, an entire compressed backup copy may be associated with a single point in time (e.g., the identified “oldest” time). In other embodiments, a compressed backup copy may be associated with multiple points in time (e.g., one time for each portion of the compressed index that is being backed-up). Compressed indices copied in accordance with the invention may be used during restore operations to reconstruct database indices using the identified “oldest” time and database log files.

Abstract: A distributed computing application is described that provides a highly elastic and multi-tenant platform for Hadoop applications and other workloads running in a virtualized environment. Deployments of a distributed computing application, such as Hadoop, may be executed concurrently with a distributed database application, such as HBase, using a shared instance of a distributed filesystem, or in other cases, multiple instances of the distributed filesystem. Computing resources allocated to region server nodes executing as VMs may be isolated from compute VMs of the distributed computing application, as well as from data nodes executing as VMs of the distributed filesystem.

Abstract: Exemplary embodiments relate to techniques for determining social networking or messaging user affinity and engagement coefficients (e.g., a measure of the connectedness between two people in a network). The described techniques are particularly well-suited to cases in which only limited information is available, such as when a new user joins a network and only the user's contacts list is available. The available information may be used to determine a group of existing users to which the new user is connected. Some embodiments relate to calculating scores among these existing users in order to infer an affinity for the new user to the existing users. Other embodiments involve calculating bilateral scores that reflect a degree of mutual affinity between two users.

Abstract: A method of providing updates from a social network to a desktop application is provided. An update is created in an application and if the application has permission, it creates an entry in a recent activity queue. The queue is then subject to analysis to reduce the number of entries in the queue. Subscribers that have permission to receive updates from the publisher and the publishing application then receive updates from the publisher.

Abstract: Disclosed herein are system, method, and computer program product embodiments for generating join histograms. An embodiment operates by a computer implemented method that includes determining, by at least one processor, a first interval associated with a first histogram of a first data structure and a first estimate frequency associated with the first interval. The method further includes determining, by the at least one processor, a second interval associated with a second histogram of a second data structure and a second estimate frequency associated with the second interval. The method further includes determining, by the at least one processor, a join interval based on the first and second intervals by calculating an intersection of the first and second intervals. The method further includes calculating, by the at least one processor, a join estimate frequency based on the first and second estimate frequencies.

Abstract: The present disclosure relates to processing write requests across a plurality of data sources. According to one embodiment, an example method includes determining a navigable path of nodes accessed to satisfy a write request in a graph projection of an application programming interface (API). An API service generates a plurality of subqueries, each subqueries being associated with a node in the navigable path. While traversing the navigable path to execute the write request, the API service identifies one or more nodes in the navigable path sharing an association with a data repository associated with the current node and upon which execution of a write operation associated with the current node depends. The API service coalesces a set of subqueries associated with the current node and the identified one or more nodes into a single subquery and executes the single subquery.

Abstract: Systems and methods are disclosed for enriching a knowledge base for search queries. According to certain embodiments, images are assigned annotations that identify entities contained in the images. An object entity is selected among the entities based on the annotations and at least one attribute entity is determined using annotated images containing the object entity. A relationship between the object entity and the at least one attribute entity is inferred and stored in the knowledge base. In some embodiments, confidence may be calculated for the entities. The confidence scores may be aggregated across a plurality of images to identify an object entity.

Abstract: The embodiments herein provide a method and process for storing and provisioning system catalogue(s) of metadata object relationships, from diverse and disparate physical data elements. The method comprises the steps of creating a logical enterprise data warehouse by assembling a plurality of nanomart storage structures; visually mashing up a plurality of interconnected data elements from the plurality of nanomart storage structures to produce a business analytics; and generating a neural metadata framework for providing a mathematical model to abstract and catalogue the plurality of data elements from the plurality of nanomart storage structures.

Abstract: Methods, systems, and computer-readable media for implementing augmenting storage functionality using composition are disclosed. A logical data store is determined based at least in part on storage requirements specified by a user. The logical data store comprises a composition of a plurality of storage adapters for a plurality of physical data stores including a first storage adapter for a first physical data store and a second storage adapter for a second physical data store. The first storage adapter and the second storage adapter are associated with different storage characteristics. A plurality of storage requests for the logical data store are received. Individual ones of the storage requests are routed to the first physical data store using the first storage adapter. Individual ones of the storage requests are routed to the second physical data store using the second storage adapter.

Abstract: The present application discloses methods for storing data, methods for querying data, and apparatus thereof. A method for storing data may include receiving a data record to be stored. When the data record includes a timestamp, a numerical value generated at a time point identified by the timestamp, and a first combination of identification-field values that can identify the numerical value, the method may also include obtaining a target numerical value and a target time satisfying user query needs, and a second combination of identification-field values as a query condition by the preprocessing of the data record based on the user query needs. The method may further include storing a storage identity representing the second combination of identification-field values, the target time, and the target numerical value into a second information table correspondingly.

Abstract: In an example embodiment, a tri-state variable associated with a table in a database indicates whether the table is automatically sorted at runtime or left unsorted. The value of the tri-state variable also indicates whether code associated with the table assumes the table will be sorted at runtime. In a situation where two parties have code that utilize the table, when the first ensures its code to no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting enforced to automatic sorting recommended. In this state the table will still be automatically sorted at runtime. When the second ensures its code no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting recommended to no automatic sort at which time the table is left unsorted.

Abstract: In an example embodiment, a solution is provided that synchronizes data from a lower-dimensionality projection of a high-dimensionality database with another high-dimensionality database in a manner that recreates information lost during the projection process as well as generates new high-dimensionality information from the lower dimensionality project. This allows, for example, for project team information, which was never contained in a database storing hierarchical reporting structure information, to be automatically generated, as well as for logical team information, which was originally contained in the database storing hierarchical reporting structure information but was lost during the projection process, to be recreated.

Abstract: Embodiments include an improved database logging system where transactions are allocated to multiple different partitions of a database log file and log records for transactions are written to different partitions of a database log. Each partition can store log records for a separate transaction in a separate log cache memory. Writing log records to a page of the database log can be prevented until previous log records modifying that same page have been written to disk. A sequential timestamp that is unique across the plurality of partitions may be assigned to the log records for this purpose, and a log record containing a modification to a page can be flushed after previous modifications to the page have been written to disk. Restore operations can then be performed by copying the log records of the multiple partitions into a priority data structure and ordered into a merged list based on timestamp.

Abstract: Embodiments of the present disclosure are directed to a method for processing computer readable electronic files in an investigation in a computer system including a processor coupled to a display and an electronic storage device coupled to the processor. The method includes the processor accessing the electronic files and related data from a data source. The accessed files and related data are culled by the processor based on predetermined filter criteria. The processor stores the remaining files and related data in a third-party data repository and maps a set of electronic files and related data stored in the third-party data repository into a predetermined database schema. The mapped files and related data are analyzed by the processor, which applies a status decision on them. The analyzed electronic files and related data are submitted to a third-party e-discovery processing application based on the applied status decision.