Abstract: In one embodiment, a new file creation cache is reserved on a fast storage device that is part of a composite storage device that also includes a slow storage device; the composite storage device is treated as a single logical volume (or a plurality of logical volumes) by a file system which maintains a mapping table that is used to determine whether the write operation is for a new file. If the write operation is for a new file, the file system attempts to write the new file to the fast storage device. If the write operation is not for a new file, the mapping table specifies which device is used for the write operation.

Abstract: In an embodiment, for any structural change that is made to a relational database, a corresponding change is also made to the multidimensional database. In an embodiment, the system determines that a particular structure is not implemented on the multidimensional database system. Based on metadata that defines the structure that is supposed to exist in the multidimensional database, the appropriate structure is created.

Abstract: An illustrative method for providing a job to an information management system may include monitoring, by a command processing device such as a command processing tool operating on one or more computing devices, operation of a series of commands communicated to at least one information management system via a communication link. The command processing device may determine a status associated with one or more commands of the series of commands based on the operation of the command in the information management system. The command processing device may be configured for controlling a rate at which the series of commands is communicated to the information management system based, at least in part, on the status of one or more of the commands.

Abstract: Techniques are described for building, managing, and enforcing nested quota trees in a filesystem of a data storage system using internal filesystem structures. Such integrated, server-based, nested quota trees avoid the management overhead, communication delays, and slowed processing of proxy-based solutions and are thus more efficient and optimal.

Abstract: A system for providing a search service application is disclosed and includes an application builder component that provides a search model for a first object of a plurality of objects. The search model is based at least on an end-user input field corresponding to a first attribute of the first object and a search result output field corresponding to a second attribute of the first object. The search model is also associated with a backend data store that supports a storage structure that stores information relating to the first object. The system also includes a deployment engine that automatically configures a search engine system associated with the backend data store to generate new search indexes based on the search model, and to place a portion of indexed data into a first partition and to place another portion of indexed data into at least another partition based on the search model.

Abstract: Systems, methods, and software program products discussed herein can create a backup or replica of a master. A method can include receiving, at a backup server, a serialized stream of data representative of changes to a first file of a computer and sorting the received stream of data and storing the sorted data in a memory. The method can include sending an acknowledgment to the computer indicating that the stream of data was received, writing all the sorted data to a single second file, and merging, on the backup server, the written data with data representative of a backup of data on the computer in response to writing all the sorted data to the single second file.

Abstract: The capability to perform data backup and restore within a distributed database system environment is provided. The embodiments includes initiating a backup operation of a database distributed across a plurality of nodes, and coordinating synchronization of the backup operation within and among the plurality of nodes for parallel, local data dumping with transactional consistency to a single point in time.

Abstract: Execution of code in a multitenant runtime environment. A request to execute code corresponding to a tenant identifier (ID) is received in a multitenant environment. The multitenant database stores data for multiple client entities each identified by a tenant ID having one of one or more users associated with the tenant ID. Users of each of multiple client entities can only access data identified by a tenant ID associated with the respective client entity. The multitenant database is a hosted database provided by an entity separate from the client entities, and provides on-demand database service to the client entities. Source code corresponding to the code to be executed is retrieved from a multitenant database. The retrieved source code is compiled. The compiled code is executed in the multitenant runtime environment. The memory used by the compiled code is freed in response to completion of the execution of the compiled code.

Abstract: The disclosed embodiments disclose techniques for managing consistency for a file in a distributed filesystem. Two or more cloud controllers collectively manage distributed filesystem data that is stored in the cloud storage systems; the cloud controllers ensure data consistency for the stored data, and each cloud controller caches portions of the distributed filesystem. During operation, a cloud controller receives from a client a request to access the file. The cloud controller determines a level of consistency that is associated with the file, and then uses this level of consistency to determine whether to communicate with a peer cloud controller when handling the request.

Abstract: A data driven parallel sorting method includes distributing input data records to n partitions one by one in a circular manner. Each partition corresponds to a parallel sorting process with an allocated memory chunk sized to store m data records. The method also includes sorting, in parallel, current data records in respective memory chunks in respective partitions. The method also includes in response to distribution of data records of ?m/n? rounds, circularly controlling one of the n partitions, and writing data records that have been sorted in the memory chunk of the partition into a mass storage as an ordered data chunk, and emptying the memory chunk. The method also includes in response to all data records being distributed, writing data chunks that have been sorted in respective memory chunks into the mass storage, and performing a merge sort on all ordered data chunks in the mass storage.

Abstract: A server computing device receives, from a client computing device, a request to perform an operation on an object. The server computing device identifies a file, that corresponds to the object, in a network attached storage file system in a local area network. The server computing device mounts, via the local area network, the network attached storage file system to perform the operation using the file that corresponds to the object. The computer device sends a response indicating performance of the operation to the client computing device.

Abstract: A server computing device receives, from a client computing device, a hypertext transfer protocol (HTTP) request to perform an operation on an object. The server computing device identifies a file, that corresponds to the object, in a network attached storage file system in a local area network. The server computing device mounts, via the local area network, the network attached storage file system to perform the operation using the file that corresponds to the object. The computer device sends a HTTP response indicating performance of the operation to the client computing device.

Abstract: Systems and methods are presented for auto-starting and auto-stopping databases in a cloud server environment. In some embodiments, a method includes accessing, by an initial server in a network-based system, a request to connect to a target database located in a target server of the network-based system. The method can include determining, by an administrative database residing in the initial server, a location of the target database residing in the target server, switching an execution context from no database in the target server to a copy of the administrative database in the target server, performing an auto-start procedure to auto-start the target database in the target server, switching the execution context from the administrative database in the target server to the target database in the target server, and transmitting a completion acknowledgement indicating the target server is connected to the target database.

Abstract: Techniques are disclosed for file system monitoring in a system which incrementally updates clients with what occurred in a cloud-enabled platform. In one embodiment, a method comprises, in response to an event which represents that a modification to an item has taken place on the cloud-based platform, identifying whether execution of the event is to violate any local file system rule. The method further comprises, if the execution of the event is to violate any local file system rule, buffering the event until a subsequent event arrives. The method further comprises identifying whether execution of an aggregate of the events is to violate any local file system rule.

Abstract: Electronic files are selectively assigned to a plurality of different indexing queues by one or more dynamic throughput threshold gates based on characteristics of the different indexing queues as well as the static file characteristics associated with each of the files. The files are then indexed. Upon detecting a change in a dynamic characteristic of one or more indexed files, the throughput threshold gate(s) are then modified to obtain, maintain or modify a desired throughput for one or more of the indexing queues.

Abstract: Computer-implemented methods and systems for replication of data between mirrored data sites are provided. An exemplary method may comprise receiving a data object at a mirrored data site, the mirrored data site including one or more data nodes. The data objects are replicated to the one or more data nodes internally. Then, a data object reference associated with the data object is generated. The reference referring to the data object is queued for transmission to all other mirrored data sites. The data object reference associated with the data object is transmitted to the other mirrored data sites. When the data object is received at each mirrored data site, it is replicated to one or more data nodes within the site. After transmitting the data object, the data object reference is discarded.

Abstract: To dynamically map nodes for locality and balance, computer implemented methods, systems, and computer readable media, in an embodiment, may compute histograms for nodes in a first partition. Histograms may be computed for nodes in a second partition. The second partition may be selected as a candidate partition for a set of nodes in the first partition based on the histograms for the nodes in the first partition. The first partition may be selected as a candidate partition for a set of nodes in the second partition based on the histograms for the nodes in the second partition. At least a portion of the set of nodes in the first partition may be mapped to the second partition and at least a portion of the set of nodes in the second partition may be mapped to the first partition based on load balancing.

Abstract: A computer system can generate a materialized query table (MQT) for data from a base table that has a plurality of rows and columns that each contain stored data. The computer system can receive a query to data stored in a row from the base table. The system can identify a column in the row and determine that data from a cell in the row and the column is above a threshold memory size. The system can generate, in response to determining that the data being above the threshold memory size, an MQT that includes data for the row and that includes a reference pointer that points to a location shared with another table.

Abstract: In an embodiment, a method comprises performing a first search based on a first text string; based on the first search, identifying one or more search results; after identifying the one or more search results, causing the one or more search results to be displayed; while the one or more search results are displayed: receiving input that changes the first text string to a modified text string; in response to receiving the input: performing a second search based, at least in part, on a portion of the modified text string, and determining that no search results are identified based on the second search; after determining that no search results are identified based on the second search, continuing to display the one or more search results; wherein the method is performed by one or more computing devices.

Abstract: Extension patterns are deployed to core deployment patterns stored in a first software repository. An event relating to registration of a component is detected. In response to detecting the event, a tool registry can be queried to identify one or more extension deployment patterns for use with one or more core deployment patterns. Based upon the query, one or more extension deployment components can be retrieved from a second software repository. The one or more extension deployment components can be deployed on top of one or more instances of the one or more core deployment patterns.