Abstract: A system and a computer-implemented method for ranking tabular data entities by likelihood of comprising answers for (natural language) queries, based on multimodal descriptions of the tabular data entities, comprising separate representations, which represent different aspects of the tabular data entities. The ranking is based on joint representations, generated from the query representation and separate representations of the tabular data entities' aspects, using gated multimodal units. The computer-implemented method may be used for applications such as web searches, data aggregation, and research tasks.

Abstract: Discovering environment objects for information management in a networked environment. Information management provides services such as data protection, backup, retention, compliance, etc., by classifying the objects and/or infrastructure of an entity according to its value to the entity. Information management begins by discovering the data in a network and by discovering the servers and services operating in a network. The servers and services are discovered using adapters that can collect information regarding the environment objects. Objects can be discovered using cascaded discovery, where the information collected by one adapter is used to drive the collection of additional information by other adapters. This information can then by used by information management systems to assign or orchestrate various services.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: for each respective record in a plurality of records, assigning the respective record: (1) to a first database cluster on a first database server; or (2) to a second database cluster on a second database server; receiving a search request from a requester; executing the search request in the first database cluster to retrieve a first set of results; when the first set of results is greater than a threshold number of results, presenting the first set of results to the requester; and when the first set of results is less than the minimum number of results: executing the search request in the second database cluster to create a second set of results; and presenting the second set of results to the requester, wherein: the threshold number of results is configured such that a probability that the first set of results is great

Abstract: Computerized systems and methods for facilitating coordination for multiple individuals are provided. Search parameters are received and a plurality of individuals that satisfy the search parameter(s) is determined and provided. A user is able to select multiple individuals at the same time to coordinate from within the plurality of individuals. Once selected, a process for each of the selected individuals is launched. A plurality of scheduling options, based on an activity or event input, is provided. The plurality of scheduling options includes a time for each individual selected to be scheduled/processed. Once a scheduling option is selected, times within the selected scheduling option are locked such that (1) no other user can access the selected times and (2) processes for each of the multiple selected individuals may be completed in the same application without the need for opening separate processes for each process.

Abstract: In accordance with one embodiment, the present invention provides the ability to embed and edit rich content into a browser document. Embedded objects are not backed by installed desktop applications. Instead, in one embodiment, the embedded objects are Asynchronous Javascript and XML (AJAX) components that adhere to a set of design patterns, which are embedded within editable HTML documents. For example, a user composing an email message can embed a spreadsheet into the email in accordance with an embodiment of the present invention. The spreadsheet is implemented, in one embodiment, as an AJAX component adhering to the Ajax Linking and Embedding (ALE) design pattern. Since it is an ALE component, the embedded object is fetched across the network so that it may be instantiated and used regardless of the user's location. The user can edit, manipulate, and save the embedded object while remaining in the context of the container document.

Abstract: Embodiments for managing an electronic document by one or more processors are described. An entry for a first of a plurality of fillable fields of an electronic document is received. A recommended entry for at least a second of the plurality of fillable fields is determined based on at least one data source associated with a user. A signal representative of the determined recommended entry for the at least a second of the plurality of fillable fields is generated.

Abstract: A method of storing register data elements to interleave with data elements of a different register, a processor thereof, and a system thereof, wherein each non-consecutive data elements of a register is retrieved to be stored to interleave with each non-consecutive data elements of a different register upon an executive of an interleaving store instruction, wherein a mask instruction directing a lane of a storage space in which the non-consecutive data elements are stored is executed in conjunction with the interleaving store instruction, and wherein a processor of a second type is configured to emulate a processor of a first type to store the non-consecutive data elements the same as non-consecutive data elements stored in the first type processor.

Abstract: Systems and methods are disclosed that allow for indexing, processing, or both of information from physical media or electronic media, which may be received from a plurality of sources. In embodiments, a document file may be matched using pattern matching methods and may include comparisons with a comparison reference database to improve or accelerate the indexing process. In embodiments, information may be presented to a user as potential matches thereby improving manual indexing processes. In embodiments, one or more additional actions may occur as part of the processing, including without limitation, association additional data with a document file, making observations from the document file, notifying individuals, creating composite messages, and billing events. In an embodiment, data from a document file may be associated with a key word, key phrase, or word frequency value that enables adaptive learning so that unindexed data may be automatically indexed based on user interaction history.

Abstract: Disclosed methods and systems describe an analytics server that generates an inter-related nodal data structure. The analytics server receives an electronic template having a set of input fields, the electronic template identifying at least a portion of data stored within a database and its corresponding domain data table and a display attribute, the electronic template further identifying a database storing the data; retrieves the data from the database; parses the data into a set of unique domain data tables having a first criterion and a set of unique dimension tables having a second criterion; generates a nodal network comprising a set of nodes where each node represents at least a portion of the retrieved data, each node having metadata comprising a unique identifier corresponding to a unique domain table and a unique dimension table corresponding to data associated with each node; links one or more nodes based their respective metadata.

Abstract: Various implementations of the invention create storage containers in a data storage system. A computing processor receives a new data record to be stored in a data storage container which is configured to store a fixed number of stored data records. The computing processor determines whether a number of the plurality of stored data records in the data storage container is within a certain threshold of the fixed number of stored data records for the data storage container. For data storage containers residing in a sequential data space, when the number of records is within the certain threshold, the computing processor opens a new data storage container, stores the new data record in the new data storage container, and closes the data storage container to new data records.

Abstract: User data from users/consumers is transformed into machine learning training data including historical offer attribute model training data, historical offer performance model training data, and user attribute model training data associated with two or more users/consumers, and, in some cases, millions, tens of millions, or hundreds of millions or more, users/consumers. The machine learning training data is then used to train one or more offer/attribute matching models in an offline training environment. A given current user's data and current offer data are then provided as input data to the offer/attribute matching models in an online runtime/execution environment to identify current offers predicted to have a threshold level of user interest. Recommendation data representing these offers is then provided to the user and the current user's actions with respect to the recommended offers is monitored and used as online training data.

Abstract: The present disclosure relates to a hardware-software communication system for sensor signal monitoring in process automation technology. The hardware-software communication system comprises at least one client, a system layer, and an application layer. The client and the system layer are communicatively connected and configured to communicate with one another. The system layer and the application layer are interconnected and are configured to communicate with one another independently of the client. The system layer is implemented as a server.

Abstract: A system, method and apparatus for choosing a digital processing platform that is optimal for a specified type of application and satisfies a set of user-specified constraints is provided. In operation, all known parameters on all available processing platforms in a database are stored, providing this information to a computer software application run by the user by querying the database, and then allowing a remote user to specify the constraints, in terms of hardware and system software, to eliminate those entries that would not satisfy the constraints in a step-by-step filtering process. The user then chooses a set of application programs to run on the platforms that were not eliminated. The runtime performance parameters/characteristics—e.g. computational throughput, I/O bandwidth, environmental parameters, etc. are measured to select the optimal solution. The system and method also allows for a regression test to ensure consistency between test software processes running on discrete platforms.

Abstract: Various embodiments include a system that can comprise one or more processing modules; and one or more non-transitory memory storage modules storing computing instructions configured to run on the one or more processing modules and perform acts of: determining a popularity factor for each record in a plurality of records using historical data that can comprise previous search data for each record in the plurality of records; assigning each record in the plurality of records to a first database cluster H on a first database server when the popularity factor for the record in the plurality of records is greater than a threshold value or to a second database cluster L on a second database server when the popularity factor for the record in the plurality of records is less than the threshold value, wherein the first database cluster H has a greater processing power than the second database cluster L; receiving a search request from a requester; executing the search in the first database cluster H to retrieve a fi

Abstract: Provided are a system and method for generating a database scheme for storing different types of data structures. In one example, the method includes receiving a first data object having a first data structure and a second data object having a second data structure that is different than the first data structure, generating a database scheme based on the first data structure and the second data structure, wherein the generated database scheme retains information about a structure of the first data structure and a structure of the second data structure, and storing the first data object and the second data object, in a database, according to the generated database scheme. According to various aspects, by at least partially retaining the original structure of the data objects, further searching and processing may be performed on different types of data objects stored in a relational database.

Abstract: Software, firmware, and systems are described herein that permit an organization to dock previously-utilized, limited-feature data management modules with a full-featured data management system. By docking limited-feature data management modules to a full-featured data management system, metadata and data from the various limited-feature data management modules can be integrated and utilized more efficiently and effectively. Moreover, additional data management features can be provided to users after a more seamless transition.

Abstract: Described herein are systems and methods for replicating an original sequential data volume to a copied sequential data volume. The two sequential data volumes comprise corresponding data blocks with associated write session identifiers. The write session identifiers may correspond to an applicable write operation. When the original sequential data volume is modified, the copied sequential data volume may also be modified for consistency. The write session identifiers of the two data volumes may be sequentially compared to find a mismatch at a modified data block. The data blocks of the copied sequential data volume are replaced, beginning with the modified data block. Instead of replicating the entire original sequential data volume, the modified data block and any subsequent data blocks are replicated in the copied sequential data volume.

Abstract: The present invention relates to a digital broadcasting system for transmitting/receiving a digital broadcasting signal and a method of processing data. In one aspect of the present invention provides a method of processing data, the method including receiving a broadcasting signal in which mobile service data and main service data are multiplexed, demodulating the received broadcasting signal, obtaining an identifier indicating that data frame of the broadcasting signal includes service guide information, decoding and storing the service guide information from the data frame; and outputting a service included in the mobile service data according to the decoded service guide information.

Abstract: In some implementations, a computing device can generate and present suggestions for filling in various data input fields presented by a graphical user interface of a host application running on the computing device. For example, when a user selects a data input field presented by the graphical user interface, the host application can cause an operating system (OS) process external to the host application on the computing device to search various hardware, software, configuration, communication, and/or event sources to obtain user information associated with the user and relevant to the input field type identifier. The user information can be presented by the OS process as suggestions on the graphical user interface without providing the user information to the host application. When the user selects a presented suggestion, the OS process can provide the user selected suggestion to the host application as input to the user selected data input field.

Abstract: A centralized server, such as in a cloud environment, is provided generally connected to a plurality of clients that independently maintain data that is also maintained in the centralized server. The centralized server possessing an authoritative Bloom filter series comprising at least a plurality of Bloom filters each with successive Bloom filter entries that periodically provide and update a copy of the authoritative Bloom filter series at each of the clients. Each client checks to see if a data file is present locally by searching for a corresponding Bloom filter entry in the copy of the Bloom filter series before seeking the data file in the centralized server.

Abstract: An aspect of auto-completion of text entered by a user includes configurable data collection components that collect from software applications text data and metadata representing an initial state of each of the applications and text data and metadata representing changes to the state of one or more of the applications. A central text matching component receives and stores the text data and metadata. A sending component sends text entered by the user in a text-entry field and any metadata associated with it to the central text matching component. A comparison component compares the entered text and associated metadata to the stored text data and metadata and locates matching text strings. A weighted ordering component ranks the matching text strings using the metadata and its configuration settings. A completion component completes the entered text at the text-entry field based on a selection of one of the located matching text strings.

Abstract: Providing dynamic instrumentation using domain-specific monitoring-language-to-kernel-bytecode compilation is disclosed. An instrumentation program file is converted by a compilation engine into multiple bytecode sections. A load and execute engine identifies which sections can be executed in kernel space and which can be executed in user space. The sections to be executed in kernel space are then loaded into a kernel space bytecode interpreter for execution, while the sections to be executed in user space are concurrently executed by a user space bytecode interpreter of the load and execute engine. In some examples, the load and execute engine may provide global variables that are accessible by both the kernel space and the user space, and that facilitate data exchange between the kernel space bytecode interpreter and the user space bytecode interpreter.

Abstract: A computing platform identifies one or more characteristics of a user accessing application software or a software service via a user interface and a field to be filled or completed in the user interface of the application software or a software service. The computing platform further determines and presents, at one or more automatic fill or completion modules that are stored at least partially in memory and function in tandem with one or more computer processors in the computing platform, a list of one or more completion candidates in the user interface of the application software or a software service at least by performing one or more incremental searches based in part or in whole upon the one or more characteristics. The field is then populated with a completion candidate from the list of one or more completion candidates.

Abstract: Some implementations are directed to generating a personal database entry for a user based on free-form natural language input formulated by the user via one or more user interface input devices of a computing device of the user. The generated personal database entry may include one or more terms of the natural language input and descriptive metadata determined based on one or more terms of the natural language input and/or based on contextual features associated with receiving the natural language input. Some implementations are directed to generating, based on one or more personal database entries of a user, output that is responsive to further free-form natural language input of the user. For example, one or more entries that are responsive to further natural language input of the user can be identified based on matching content of those entries to one or more search parameters determined based on the further input.

Abstract: A method for managing a document search index. The method includes obtaining indexing terms for documents in a document repository to generate search index fragments, storing the search index fragments in a document search index, and constructing a hierarchical structure from a first set of stored search index fragments. The selected first set of search index fragments is arranged by size, in the hierarchical structure. The method further includes selecting, based on a minimal size, a second set of stored search index fragments from the hierarchical structure, merging the second set of stored search index fragments to obtain a larger search index fragment, storing the larger search index fragment in the document search index, and serving at least one search request using the larger search index fragment.

Abstract: In storing data, common data within a plurality of documents is identified. A data object is created separate from the plurality of documents and the identified common data is stored in the data object. The identified common data is replaced within the plurality of documents with an identifier referencing the data object. In at least some embodiments, the identifier is a native datatype construct.

Abstract: In storing data, common data within a plurality of documents is identified. A data object is created separate from the plurality of documents and the identified common data is stored in the data object. The identified common data is replaced within the plurality of documents with an identifier referencing the data object. In at least some embodiments, the identifier is a native datatype construct.

Abstract: A method and system for performing numeric searches related to biometric information, the method comprising generating a main search key representing biometric features of an item to be searched, partitioning the main search key into at least two sub-keys, each sub-key comprising a predetermined number of bits, obtaining a set of index tables each comprising a plurality of key values, each key value being associated with a corresponding index value, wherein the number of index tables in the set is equal to the number of sub-keys within the main search key, identifying, in a first one of said set of index tables, at least one key value matching a first sub-key of the main search key, obtaining, for each identified key value, a corresponding index value pointing to a limited portion of key values in a next index table, identifying, in said limited portion of said next index table, at least one key value matching a next sub-key of the main search key repeating the steps of obtaining index values and searching a

Abstract: Files, e.g., disk-image files can be teleported from a source node of a network to a target node in that a copy of file can be assembled at least in part using file parts found on the target node. Source hashes can be generated based on segments of the source file. The source hashes can be sent by the source node and received by the target node. The target node compares each source hash with target hashes of segments of files on the target node. When a comparison results in a match, the file copy can include a copy of the matching target segment or include a reference to the matching segment. For higher performance, fingerprints of the source hash and the target hashes can be compared, with hash comparisons being performed in the event of a fingerprint match. The target fingerprints can be arranged in a cuckoo filter or other probabilistic filter.

Abstract: A system for storing a file system can include writing a file system to a memory device, the file system including a plurality of files, a subset engine to determine a subset of the plurality of files, a marking engine to mark each file of the plurality of files that is not included in the subset as a not-for-use sector, a crosslinking engine to crosslink duplicate files of the subset, a compression engine to compress a directory structure and a file allocation table (FAT) associated with the subset; and a storing engine to store the compressed directory structure and FAT in the file system.

Abstract: A disclosed computer-implemented method for tokenizing user-annotated names may include (1) identifying an example set of user-annotated names, (2) creating a custom dictionary that includes known keywords by (a) extracting a set of known keywords from the example set of user-annotated names and (b) assigning a frequency score to each known keyword in the set of known keywords based on the respective frequency of each known keyword within the example set, and (3) enabling the computing device to tokenize an additional user-annotated name of arbitrary structure by performing a semantic analysis including (a) assigning, using the custom dictionary, a frequency score to a substring of the additional user-annotated name based on the substring matching the known keyword and (b) splitting the additional user-annotated name into tokens according to a permutation of substrings that received a top combined frequency score. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Systems, apparatuses, and methods for converting computer program source code from a first high level language to a functionally equivalent second high level language different from the first high level language. Source code in a first high level language that includes implicitly created temporary objects is analyzed. Source code in the second high level programming language is generated that is functionally equivalent to the source code in the first high level programming language. The second high level language does not support temporary objects. For temporary objects identified in the first high level source language, source code is generated to explicitly create and track a corresponding object within a similar scope. In addition, source code is generated to destroy the explicitly created object at a time that generally corresponds to destruction of the temporary object in the original source language.

Abstract: A governance, risk management, and compliance (GRC) computer system is provided that includes at least one processor, a user input device, and a storage system that stores meta-model. The meta-model includes at least one process element, a plurality of dynamic risk elements, and a plurality of dynamic control elements. The risk meta-model is loaded from the storage system. Input is accepted from the user input device for creating a new dynamic risk model based on the loaded extended risk meta-model. At least one process element is added to the new dynamic risk model based on user provided input and the extended risk meta-model. A first dynamic risk element is added from the plurality of dynamic risk elements based on user provided input. A risk type of the first dynamic risk element is determined based on user provided input.

Abstract: The disclosure describes systems and methods of limiting access to data that is commonly held, such as by a data cooperative. Certain embodiments involve providing a filter system that receives a record with user device identifiers, and uses the received record to create or modify a filter that is associated with a participant system. The filter system creates a filter key based on a device identifier from the record and assigns the filter key to the associated filter. The filter is applied to a data source including one or more stored device identifiers, and a determination is made whether the stored device identifiers are linked to the filter key. In some embodiments, determining a link is based on characteristics of the stored device identifiers, or on user indications (e.g., “opt-out” preferences), or both. The linked device identifiers are provided to the participant system.

Abstract: Confirming enforcement of business rules specified in a data access tier of a multi-tier enterprise application. In an embodiment, a testing tool programmatically identifies the attributes in the data access tier that are accessible from a set of higher/interface tiers and provides the identified attributes to a user using a suitable interface. The user then specifies a set of test cases based on the provided attributes, with each test case including data elements associated with respective attributes and an expected result if the data elements are sought to be stored in the respective attributes of a data storage. The testing tool determines a validation result of operation of business rules against the combination of data elements and respective attributes. The testing tool then indicates that the business rules are enforced as desired, if the validation result is the same as the expected result.

Abstract: A method for predicting whether a party will purchase a product. The method includes accessing data wherein the data is obtained from a plurality of computing environments of a plurality of parties, analyzing the data; and predicting whether one of the plurality of parties will purchase a product based on the analyzed data.

Abstract: The present disclosure discloses an information input method in a 3D immersive environment, comprising: displaying a virtual keyboard in the 3D immersive environment; selecting a key position on the virtual keyboard and determining the selected key position; and sending a confirmation instruction to the selected key position, and inputting information corresponding to the selected key position into an information input box to thereby complete information input for one time. Displaying the virtual keyboard to the user in the 3D immersive environment and receiving the user's selection and confirmation instruction of the key position on the virtual keyboard solves the problem that the user, wearing the virtual reality headset device, cannot see actual key positions of a keyboard in reality and cannot input information and enables the user to conveniently and quickly input information by typewriting in the virtual environment.

Abstract: A system and method for facilitating displaying data in a table via a web-based data grid. The example method includes rendering a first table and then rendering a second table via a layer overlaid on the first table. The second table replicates a user selected portion of the first table. In a specific embodiment, the example method further includes providing a first user option to horizontally scroll the first table. One or more columns of the second table remain static in response to horizontal scrolling of the first table. A second user option enables vertical scrolling of the first table. Vertical scrolling of the first table causes concurrent vertical scrolling of the second table. A third user option enables repositioning of the second table relative to the first table. The first table and overlaid second table, called the frozen section, may be implemented via client-side scripting.

Abstract: A system and method for mitigating overhead for accessing metadata for a cache in a hybrid memory module are disclosed. The method includes: providing a hybrid memory module including a DRAM cache, a flash memory, and an SRAM for storing a metadata cache; obtaining a host address including a DRAM cache tag and a DRAM cache index; and obtaining a metadata address from the DRAM cache index, wherein the metadata address includes a metadata cache tag and a metadata cache index. The method further includes determining a metadata cache hit based on a presence of a matching metadata cache entry in the metadata cache stored in the SRAM; in a case of a metadata cache hit, obtaining a cached copy of data included in the DRAM cache and skipping access to metadata included in the DRAM cache; and returning the data obtained from the DRAM cache to a host computer. The SRAM may further store a Bloom filter, and a potential DRAM cache hit may be determined based on a result of a Bloom filter test.

Abstract: A computer program product for searching a repository of binary uninterpretted data, according to one embodiment, includes a computer readable storage medium having program instructions executable by a computer to cause the computer to perform a method comprising: analyzing, by the computer, segments of each of the repository and input data to determine a repository segment that is similar to an input segment, the analyzing including searching an index of representation values of the repository data for matching representation values of the input in a time independent of a size of the repository and linear in a size of the input data; and analyzing, by the computer, the similar repository segment with respect to the input segment to determine their common data sections while utilizing at least some of the matching representation values for data alignment, in a time linear in a size of the input segment.

Abstract: A managed container may be configured to manage enterprise applications, manage enterprise information stored on a device, manage a protected storage area used by the managed container to store and reference the enterprise applications during execution, and manage a database storing enterprise rules related to management of the enterprise applications and the enterprise information. The managed container may communicate with an application gateway server to control download and update of the enterprise applications, the enterprise information, and the enterprise rules. The application gateway server may be coupled to a backend enterprise application. At least one of the enterprise applications may be configured to execute in conjunction with the backend enterprise application according to at least one of the enterprise rules, and is configured to, according to another one of the enterprise rules, manage the enterprise information associated with the backend enterprise application.

Abstract: Each data stream in a backup job is individually tracked by data agent(s) and media agent(s) in its path, generating performance data packets in-process and merging them into the processed data stream. The data stream thus incrementally accumulates performance data packets from any number of successive backup processes. The in-process tracking also captures hierarchical relationships among backup processes and in-process subtending tasks, so that the resulting performance report can depict parent and child operations. The hierarchical relationships are embedded into the performance data packets and may be analyzed by parsing the data stream. The media agent transfers the data packets belonging to the secondary copy to secondary storage. The media agent analyzes the performance data packets in the data stream and generates a performance report, which covers the data stream from source to destination, based on the accumulated information carried by the performance data packets.

Abstract: A method and apparatus for accessing an enterprise resource planning system via a mobile device is described. In one embodiment, the method includes parsing data from a host application access application into at least one object in an application-specific format, converting the data into an intermediate format that is compatible with a mobile device and communicating the converted data to the mobile device.

Abstract: Techniques are provided for generating a “dimensional zonemap” that allows a database server to avoid scanning disk blocks of a fact table based on filter predicates in a query that qualify one or more dimension tables. The zonemap divides the fact table into sets of contiguous disk blocks referred to as “zones”. For each zone, a minimum value and a maximum value for each of one or more “zoned” columns of the dimension tables is determined and maintained in the zonemap. For a query that contains a filter predicate on a zoned column, the predicate value can be compared to the minimum value and maximum value maintained for a zone for that zoned column to determine whether a scan of the disk blocks of the zone can be skipped.

Abstract: A method for recovery of missing or extra data using a bloom filter includes: storing a plurality of transaction messages, each including a transaction value; generating a bloom filter of the transaction messages, the bloom filter being generated using a number of hash rounds and with a size at least double the number of transaction messages; generating a recover message including the number of transaction messages, the number of hash rounds, the size, and the generated bloom filter; transmitting the recover message to a consensus node; receiving a response message from the consensus node, the response message including at least one additional transaction message; and inserting the at least one additional transaction message into the plurality of transaction messages.

Abstract: The present system uses quorum based aggregator failure detection in which a failed aggregator is detected and configured. Rather than repair and roll-up of all metrics for a period of time associated with the failed aggregator, only the specific metrics that were to be processed by the failed aggregator are repaired. Once the failed aggregator is identified, the time range for the downed aggregator and keys processed by the aggregator are identified. Keys for replica aggregators associated with the identified time ranges and key values are then pulled, provided to a batch processor, and processed. At cluster roll-up task completion, a time rollup task for cluster rollup is then started.

Abstract: Methods and systems are provided for optimizing data analysis. An example method for optimizing a computer for performing queries of a database can include determining a number of distinct members in a lowest hierarchy level of each hierarchy dimension and determining a unique hierarchy identifier for such distinct member; determining the hierarchy dimension with the fewest number of distinct members in its lowest level; ranking the hierarchy dimensions by the number of distinct members in the lowest level; generating a first hypergraph tree for the hierarchy dimension with the fewest number of distinct members in its lowest level; and generating an additional hypergraph tree for a hierarchy dimension having more than the fewest number of distinct members in its lowest level. Each hypergraph tree includes multiple nodes and each node corresponds to one of the unique hierarchy identifiers. The additional hypergraph tree includes fewer tiers than the first hypergraph tree.

Abstract: Technologies are described for performing proactive memory allocation (e.g., pre-allocation). Proactive memory allocation (e.g., proactive memory page allocation) can be provided for applications, such as database applications. For example, an application can be associated with a free memory pool (e.g., a free memory pool containing free memory pages). A dedicated thread of the application can monitor the free memory pool and perform proactive memory allocation when needed (e.g., when the amount of memory in the pool is low). For example, the dedicated thread can obtain new free memory from the operating system and add it to the pool.

Abstract: Software, firmware, and systems are described herein that permit an organization to dock previously-utilized, limited-feature data management modules with a full-featured data management system. By docking limited-feature data management modules to a full-featured data management system, metadata and data from the various limited-feature data management modules can be integrated and utilized more efficiently and effectively. Moreover, additional data management features can be provided to users after a more seamless transition.

Abstract: In an embodiment, a method is described for partitioning a data table into one or more partitions based on tenant specific partition strategies. In an embodiment, one or more tenant identifiers within a data store are identified. Each of the tenant identifiers identifies a unique tenant. The table of data is partitioned into partitions, and each partition is associated with a particular tenant identifier and comprises data associated with the particular tenant identifier. A particular partition from the partitions is partitioned into one or more sub partitions. A custom sub partition key is determined and associated, at least in part, with particular tenant identifier. In response to a data access query associated with the particular tenant identifier, a data storage unit is queried using the custom sub partition key stored in the metadata table.