Abstract: An operation on a row of a table of a database is initiated. Thereafter, a multi-version concurrency control (MVCC) object is accessed to identify blocks associated with the row position of the row using bitwise operations. Subsequently, a row state block computed based on the row position of the row is accessed to determine a row state for the row. At least one other block is accessed, based in part on the row state, to obtain at least one timestamp from the computed offset based on the row. Next, the at least one timestamp is stored or retrieved. Related apparatus, systems, techniques and articles are also described.

Abstract: In one respect, there is provided a distributed database system. The distributed database system can include a plurality of nodes and a plurality of optimizers. A first optimizer of the plurality of optimizers can be configured to: receive, from a client, a command; generate, based at least in part on global metadata cached by the first optimizer, an execution plan for fulfilling the command that includes one or more tasks to be performed by at least a first node of the plurality of nodes; determine that at least one task of the one or more tasks are not successfully performed by the first node; and in response to determining that at least one task of the one or more tasks are not successfully performed by the first node, updating the cached global metadata at the first optimizer.

Abstract: The method can include receiving the first stream of tuples to be processed by the stream operator hosted by one or more computer processors, the stream operator having at least one input port and a condition input port. The method can also include receiving, at runtime, a customized condition at the condition input port of the stream operator. The method can also include monitoring a first group of one or more tuples from the first stream of tuples at a first window of the stream operator. The method can also include determining whether the first group of one or more tuples at the first window fulfills the customized condition. The method can also include deleting, in response to the first group of one or more tuples fulfilling the customized condition, the first group of one or more tuples.

Abstract: Improved database consistency and consistency checking may be provided by cross-referenced split data storage for irregular fields using auxiliary pointers. A fixed-size memory slot may be allocated to a database table in a database system, where the fixed-size memory slot has an address. A variable-size memory slot may be allocated to the database table, where the variable-size memory slot has a different address. For an irregular field in the database table, one or more properties of the irregular field may be stored in the fixed-size memory slot. The one or more properties may include a first pointer which may have the address of the variable-size memory slot. For the irregular field in the database table, at least a portion of data of the irregular field and a second pointer, which may have the address of the fixed-size memory slot, may be stored in the variable-size memory slot.

Abstract: A computing platform executing an application may receive a response to a request for opening a network port for utilization by the application from a computing platform distinct from the computing platform executing the application. The computing platform executing the application may determine whether to open the network port for utilization by the application based on the response to the request. In some embodiments, the application may invoke at least one call to an application program interface (API) of an operating system (OS) running on the computing platform executing the application, and the request may be generated responsive to the at least one call to the API of the OS.

Abstract: A method for resolving conflicts related to states of multiple iSCSI sessions between an iSCSI initiator and an iSCSI target, the method may include: comparing between (a) iSCSI initiator information that is indicative of states of the multiple iSCSI sessions as viewed by the iSCSI initiator, and (b) iSCSI target information that is indicative of the states of the multiple iSCSI sessions as viewed by the iSCSI target; wherein the comparing is preceded by utilizing a non-iSCSI connection for gathering at least one of the iSCSI initiator information and the iSCSI target information; and participating in a resolution of a conflict related to a given iSCSI session out of the multiple iSCSI sessions when the comparing shows that a state of the given iSCSI session as indicated in the iSCSI initiator information conflicts with the state of the given iSCSI session as indicated in the iSCSI target information.

Abstract: Disclosed herein are system, method, and computer program product embodiments for synchronizing an unsynchronized distributed database system. An embodiment operates by locking, by a second node, partitions in the second node based on first information received from, a first node responsive to execution of partition utility based on a first query received by the first node. Blocking, by the second node, a second query to a data portion of the partitions in the second node based on the first information. Locking, by the second node, second node object metadata based on second information received from the first node. Receiving, by the second node, changes to first node object metadata and applying the changes to the second node object metadata. Unlocking, by the second node, the partitions in the second node and the second node object metadata while unblocking the second query.

Abstract: One embodiment provides a storage device. The storage device includes a storage I/O (input/output) logic and a storage device controller. The storage I/O logic is to couple the storage device to a host device, the storage I/O logic to receive a sort-merge command the host device. The a storage device controller is to identify a level N SSTable (sorted string table) file, a corresponding level N index file, a first level N+1 SSTable file and a corresponding first level N+1 index file, in response to the sort-merge command to be received from the host device. The storage device controller is further to perform a sort-merge of the level N SSTable file and the first level N+1 SSTable file to produce a first level N+1 output SSTable file and a first level N+1 output SSTable index file. The level N SSTable file includes at least one level N key-value (KV) pair. The level N+1 SSTable file includes at least one level N+1 key-value (KV) pair.

Abstract: An index key generating device includes: a data acquiring unit which acquires a plurality of attribute values of a plurality of attributes for indexing; a definition acquiring unit which acquires index definition information indicating, for each of the attributes for indexing, an arrangement of bits of the attribute in an index key; and a bit processing unit which generates an index key by arranging, on a bit-by-bit basis, the plurality of attribute values acquired by the data acquiring unit, on the basis of the index definition information acquired by the definition acquiring unit.

Abstract: Embodiments of a system and method are described for generating and distributing programming to mobile devices over a network. Devices are provided with Players specific to each device and Applications that are device independent. Embodiments include a full-featured WYSIWYG authoring environment, including the ability to bind web components to objects.

Abstract: A storage system includes N nodes (N is an integer, equal to or larger than 2) coupled to at least one data processing system. A plurality of tenant spaces, based on the N nodes, contain Y1 tenant spaces (Y1 is an integer, equal to or larger than 2 and equal to or smaller than N) for a first tenant. The Y1 tenant spaces are based on Y1 node groups in the N nodes. Each of the Y1 node groups contains Q1 or more nodes (Q1 is an integer, equal to or larger than 1). For the first tenant, the storage system provides, to each of the Y1 tenant spaces, data units multiplexed Y1 times. From a first load-source tenant space from among the Y1 tenant spaces, the storage system loads a first data unit group containing one or more data units to a first load-destination data processing system.

Abstract: An update to a partitioning column for a partitioned table in a database can be performed by handling rows for which the update will not require moving to a different partition separately (e.g. “locally”) for each partition followed by re-inserting those rows that will require moving to a different partition and deleting them from the original partition. The re-inserted rows are directed to a correct partition by application of the partitioning criteria for the table. Methods, articles, and systems are described.

Abstract: In general, one aspect of the subject matter described can be embodied in a method that includes, obtaining a plurality of search results responsive to an initial search query, the search results including a first search result that identifies a first resource; determining, using a document-to-query-to-document model, that the first resource is relevant to a first suggested query different from the initial search query; generating a presentation of the search results responsive to the initial search query; and providing the presentation of the search results in response to the initial search query. Each search result in the presentation includes a link to a respective resource, wherein the first search result in the presentation includes a link that, upon a selection by a user, can cause the first suggested query to be submitted to a search engine.

Abstract: In order to manage stale data on a network of computer systems, a file harvester agent may be configured with a list of stale data files to be deleted. The file harvester agent may be deployed to the computer systems of a network. When executed in a computer system, the file harvester agent searches the file system of the computer system to locate any files or data indicated in the file list. Any located data files are deleted. Once the agent has finished processing the file list on a computer system, the agent can copy or replicate itself to other computer systems of the network in accordance with a pre-configured itinerary.

Abstract: Methods and systems are provided for presenting a user with a recommendation intent query in response to the user indicating that he or she recommends content. The recommendation intent query allows a user to designate (e.g., select, indicate, identify, choose, etc.) one or more components, subjects, characteristics, properties, etc., of the content to which the user's recommendation should be attributed. Therefore, the user's intent with regard to the recommendation can be determined, and a more detailed social annotation about the recommendation can be provided to other users in a social network. The recommendation intent query is in the form of a user interface containing a list of components, subjects, and characteristics of the recommended content, one or more of which may be designated by the user as being the intended target(s) of his or her recommendation.

Abstract: Large scale high performance file proxy caching sites may be configured to coalesce many client write operations into one very large assemblage of modified file data. At some point the caching site will flush all modified file data downstream towards the origin file server. In some instances the amount of modified data being flushed may be more than can be transferred in a single network request. When multiple network requests are required, the consistency guarantee provided by many filesystems requires that the file either be updated with the data contained in all of the network requests or not be modified at all. In addition, once the first flush request is processed no other file read or write requests can be serviced until the last flush request has been processed. This document discloses methods for performing atomic multi-request flush operations within a large geographically distributed filesystem environment.

Abstract: Disclosed herein are system, method, and computer program product embodiments for utilizing a transaction control block for providing reader-writer access to transaction commit status. An embodiment operates by receiving a row read request and determining that the row is versioned. The system determines that a first timestamp information for a row destroy transaction associated with the row exists in a transaction control block and retrieves the first timestamp information from the transaction control block.

Abstract: The present invention provides a distributed processing system for a graph query language and a distributed processing method for a query language thereof. The distributed processing system for a graph query language according to the present invention includes: a client configured to receive the graph query language; a server configured to receive the graph query language from the client, transmit information for query processing for the graph query language to a plurality of dispersively disposed data processing apparatuses, and integrate results of the query processings received from the data processing apparatuses to transmit the integrated results to the client; and the plurality of data processing apparatuses configured to receive the information for the query processing from the server to determine whether the query processing may be performed, and transmit the results of the query processings to the server.

Abstract: A device configured to emulate an image input adapter for a correlithm object processing system that includes a sensor engine. The sensor engine is configured to receive an image formed by an array of pixels, to determine dimensions for the array of pixels, and to define a plurality of masks. The size of each mask is less than the dimensions of the array of pixels. Each mask at least partially overlaps with at least one other mask. The sensor engine is configured to overlay the plurality of masks with the image. Overlaying the masks with the image partitions the image into a plurality of sub-arrays of pixels. The sensor engine is configured to determine a correlithm object for each pixel in the sub-array of pixels, to serialize the correlithm objects for the sub-array of pixels to form an aggregated correlithm object, and to output the aggregated correlithm object.

Abstract: A record within a destination virtual file is generated on a destination node of a distributed data storage system. The record comprises a link directed to a source virtual file stored on a source node. The source virtual file is mapped to a chain of linked pages stored in a page buffer of the distributed data storage system. A request is later received at the destination node to access data defined by the destination virtual file. Data is provided, in response to the request, from the source virtual file stored on the source node using the link. Related apparatus, systems, techniques and articles are also described.

Abstract: Techniques are described for materializing computations in memory. In an embodiment, responsive to a database server instance receiving a query, the database server instance identifies a set of computations for evaluation during execution of the query. Responsive to identifying the set of computations, the database server instance evaluates at least one computation in the set of computations to obtain a first set of computation results for a first computation in the set of computations. After evaluating the at least one computation, the database server instance stores, within an in-memory unit, the first set of computation results. The database server also stores mapping data that maps a set of metadata values associated with the first computation to the first set of computation results.

Abstract: An object-based data storage system includes a memory and a processor for executing machine executable instructions configured for implementing logical containers for data objects each having a global identifier. The containers are configured for storing metadata including a first parameterization value descriptive of a number of storage nodes and a second parameterization value descriptive of a classification of the data objects. The machine executable instructions are further configured for implementing a first object storage ring for addressing storage locations across the multiple storage nodes using a surjective function.

Abstract: Tuple attribute locking is implemented in a stream computing environment to selectively inhibit access to one or more attributes of tuples by stream operators.

Abstract: A database includes a plurality of partitions with respective partition dates. A query is received for data from a view of the database, the query containing a filtering parameter for retrieval of the data. A definition of the view is analyzed to determine a table of the database that contributes to the view and an aging object associated with the table. A restriction rule associated with the aging object is identified, for example, based on an annotation in the definition of the view. A restriction date for the aging object is determined based on the restriction rule. A partition, from the plurality of partitions, is selected based on the partition date of the partition being equal to or later than the restriction date. The queried data is retrieved from the selected partition according to the filtering parameter and a response to the query is generated based on the retrieved data.

Abstract: A method for searching data on multiple domains includes transmitting a search query to an enterprise domain; receiving, from the enterprise domain, enterprise content matching the search query; receiving, from the enterprise domain, a search query normalized for searching a social site domain, the normalized search query being the search query in a format recognizable by the social site domain; transmitting the normalized search query to the social site domain; and receiving, from the social site domain, social site content matching the normalized search query.

Abstract: An optimized skiplist iterator technique for RCU-protected skiplists. A skiplist iterator operation may attempt to validate a cached pointer hint that references a skiplist element of an RCU-protected skiplist, the skiplist element having an associated first key. If the pointer hint is validated, the pointer hint may be dereferenced to access the skiplist element. A pointer in the skiplist element may be dereferenced to advance to a next skiplist element of the RCU-protected skiplist, the next skiplist element having an associated second key that is larger than the first key. If the pointer hint is not validated, a value-based skiplist iterator operation may be performed that includes traversing the RCU-protected skiplist using the first key to find the next skiplist element having the second key. A new pointer hint that references the next skiplist element may be cached for use in a next invocation of the skiplist iterator operation.

Abstract: A computing device for facilitating transactions between one or more remote devices, the device comprising a processing module arranged to interact with the one or more remote devices via a communications network and a database arranged to contain information regarding the state of one or more transaction channels in relation to an account, wherein the module is arranged to receive instructions via the communications network from the one or more remote devices and provide information regarding the state of the one or more transaction channels is disclosed.

Abstract: According to one embodiment, a data processing apparatus is applied to a data management system. The data processing apparatus is connected to a client terminal, a first storage medium and a second storage medium to be capable of communicating with the client terminal and the first and second storage mediums. The first storage medium stores a plurality of tables which are identified by table names and include a plurality of column names and columns corresponding to the column names, respectively. The second storage medium stores some data in the tables stored in the first storage medium and keys for use in reading out the data, in association with each other.

Abstract: A system and method for event-driven live migration of applications between two or more servers. Primary applications runs on primary hosts and one or more replicated instances of each primary application run on one or more backup hosts. Event driven live migration is provided through a combination of process replication, logging, barrier synchronization, reliable messaging and message playback. The event driven live migration is transparent to the application and requires no modification to the application, operating system, networking stack or libraries.

Abstract: An updater needing an expedited RCU grace period may initiate a leaf-to-root traversal of a funnel lock embodied as a hierarchical tree of nodes. For each accessed node, the updater may check an indicator to determine if another updater needing the same expedited grace period has visited the node. If true, the updater may add itself to a waitqueue of updaters waiting for the expedited RCU grace period. If false, the updater may set the indicator to indicate it has visited the node, and then continue to a next node. If the updater reaches the root node with no indication that any other updater needing the expedited RCU grace period has visited the nodes accessed by the updater, the updater may, while holding a mutex lock, start a new expedited RCU grace period and at the end thereof wake up other updaters waiting on the expedited RCU grace period.

Abstract: An example method for migrating communication data from a source server to a target server includes obtaining, using a computing device, a set of credentials to access the source server, and accessing the source server using the set of credentials. The method also includes requesting, automatically by the computing device, a directory structure associated with communication data from the source server, populating, by the computing device, the target server using the directory structure, requesting the communication data from the source server, and populating the target server with the communication data.

Abstract: A lightweight always-on monitoring, collecting, diagnosing, and correcting utility operates in an enhanced storage manager that manages a data storage managements system. The always-on utility provides a comprehensive and pro-active approach, which is intended to reduce, if not altogether eliminate, the need for after-the-fact diagnostics. The always-on utility also enforces so-called best practices and other heuristics, which include pro-actively activating certain database settings that are not enabled by default; manipulating certain aspects of the database to improve performance; and reporting aspects that are outside best-practice parameters to the trouble report system so that system administrators and/or developers may intervene before a catastrophic failure occurs. In some cases, the best-practice parameters represent heuristics designed by the present inventors to improve the performance and general health of the management database.

Abstract: Cloud container resource binding and tasking using keys is generally described herein. An example device to bind and perform tasks using cloud-based resource may include a container to claim tasks to be performed and to select and bind to a resource based on capabilities of the resource and requirements of the tasks.

Abstract: A computer-implemented method for improving database management includes selecting one or more database records that are requested based on a query statement. The one or more database records may are read from a first database file. The one or more database records are copied from the first database file and stored to a memory. The one or more database records are deleted from the first database file at substantially the same time as the reading the one or more database records. The reading and the deleting occur through a single read and delete input/output (I/O) operation.

Abstract: A method, a processing device, and a computer program product are provided. A truncate table command for truncating all or a subset of one or more rows of a database table is received from a first transaction executing on a processing device. At least one read operation on the truncated database table is performed for at least one transaction concurrent with the first transaction, wherein the truncated rows are visible to the at least one concurrent transaction and invisible to subsequent transactions. Storage units that store the truncated rows are reclaimed in response to completion of the at least one concurrent transaction.

Abstract: Techniques are described for prefetching analytic results across multiple levels of a dimension in a multidimensional dataset. In some embodiments, an application layer sends a request to view a summary of a multidimensional dataset, where the request targets a first level of a particular dimension of the multidimensional dataset. In response to receiving the request, a pre-fetch range is determined. The pre-fetch range identifies how many levels to analyze along the particular dimension of the multidimensional dataset. At least one analytical operation is performed for the first level of the particular dimension and one or more levels that are within the pre-fetch range of the first level. A first analytic result for the first level is returned to the application layer. For each respective level of the one or more levels within the pre-fetch range, a respective analytic result is stored in a cache.

Abstract: A system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to perform steps of a method for processing a large file. The system may receive record data comprising a plurality of records having an identification value in a common field having a data format. The system may determine a plurality of focus values based on the data format and create a plurality of virtual processing units based on the plurality of focus values. Each of the plurality of virtual processing units may process a sub-group of the plurality of records that corresponds to the focus value associated with the respective virtual processing unit.

Abstract: A lightweight always-on monitoring, collecting, diagnosing, and correcting utility operates in an enhanced storage manager that manages a data storage managements system. The always-on utility provides a comprehensive and pro-active approach, which is intended to reduce, if not altogether eliminate, the need for after-the-fact diagnostics. The always-on utility also enforces so-called best practices and other heuristics, which include pro-actively activating certain database settings that are not enabled by default; manipulating certain aspects of the database to improve performance; and reporting aspects that are outside best-practice parameters to the trouble report system so that system administrators and/or developers may intervene before a catastrophic failure occurs. In some cases, the best-practice parameters represent heuristics designed by the present inventors to improve the performance and general health of the management database.

Abstract: A technique for enabling real-time CPU-bound in-kernel workloads to run infinite loops while keeping read-copy update (RCU) grace periods finite. In an embodiment, a per-CPU indicator may be set to indicate that a CPU running the CPU-bound in-kernel workload has not reported an RCU quiescent state within a defined time. A function may be invoked from within the workload that causes an RCU quiescent state to be reported on behalf of the CPU if the per-CPU indicator is set. If the RCU quiescent state is not reported within a longer defined time, the CPU may be rescheduled.

Abstract: A technique for enabling real-time CPU-bound in-kernel workloads to run infinite loops while keeping read-copy update (RCU) grace periods finite. In an embodiment, a per-CPU indicator may be set to indicate that a CPU running the CPU-bound in-kernel workload has not reported an RCU quiescent state within a defined time. A function may be invoked from within the workload that causes an RCU quiescent state to be reported on behalf of the CPU if the per-CPU indicator is set. If the RCU quiescent state is not reported within a longer defined time, the CPU may be rescheduled.

Abstract: Systems and methods are presented for automatically selecting a data center that can communicate with a user computing system over a connection that provides reduced or minimal latency. In some cases, the system can select the data center based on the calculation of one or more latency factors that correlate, at least in part, to the latency of a communication channel between the data center and the user computing system. Further, the selected data center may be identified from a set of data centers that include one or more computing resources the user has identified as desiring to access.

Abstract: A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added.

Abstract: Described is a framework that manages a clustered, distributed NoSQL data store across multiple server nodes. The framework may include daemons running on every server node, providing auto-sharding and unified data service such that user data can be stored and retrieved consistently from any node. The framework may further provide capabilities such as automatic fail-over and dynamic capacity scaling.

Abstract: Techniques are herein described for loading a portion of a database object into volatile memory without blocking database manipulation language transactions. The techniques involve invalidating data items loaded from blocks affected by a transaction, referred to as a straddling transaction that started before the load time and committed after the load time. Identifying these straddling transactions involves reviewing one or more transaction lists associated with the set of data items loaded in memory. The transaction list may be read in reverse temporal order of commit to identify a transaction meeting the criteria of starting before the load start, not committing before the load time, and affecting a data item loaded in memory.

Abstract: A technique referred to as “data structure chronicles” is described that may be used to build strictly failure resilient persistent concurrent data structures. A “chronicle” maintains a persistent history of operations invoked on a persistent data structure that can be replayed to recover the current consistent state of the data structure after a failure. The chronicle technique may also enable composability of data structure operations with the enclosing application. In addition, the chronicle technique is non-blocking, a desirable progress condition for concurrent data structures. A lock free, non-blocking chronicle stack algorithm is described that may outperform a lock-based implementation in the presence of high contention. In addition, a lock free, non-blocking chronicle queue algorithm is described.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: The present disclosure involves a method of ingesting data in an enterprise server environment. A configuration file is accessed. The configuration file specifies a blueprint for constructing a data adaptor that includes a data adaptor source, a data adaptor sink, and a data adaptor channel coupled between the data adaptor source and the data adaptor sink. The data adaptor is constructed based on the configuration file. Via the data adaptor, data is retrieved from a first entity. Also via the data adaptor, the retrieved data is written to a second entity different from the first entity. The accessing, the constructing, the retrieving, and the writing are performed by one or more electronic processors.

Abstract: Briefly, embodiments disclosed herein relate to managing transactions in a distributed content transaction system.

Abstract: In one embodiment, a method includes determining a number of initial servers in a massively parallel processing (MPP) database cluster and determining an initial bucket configuration of the MPP database cluster, where the initial bucket configuration has a number of initial buckets. The method also includes adding a number of additional servers to the MPP database cluster to produce a number of updated servers, where the updated servers include the initial servers and the additional servers and creating an updated bucket configuration in accordance with the number of initial servers, the initial bucket configuration, and the number of additional servers, where the updated bucket configuration has a number of updated buckets. Additionally, the method includes redistributing data of the MPP cluster in accordance with the updated bucket configuration.

Abstract: A system that enables a user to configure alert actions based on search results generated by a query is disclosed. During operation, the system presents an alert user interface (UI) to a user, wherein the alert UI enables the user to configure one or more alert actions to be performed based on the search results. Next, the system receives alert configuration information from the user through the alert UI, wherein the alert configuration information includes tokens representing parameters associated with the query and the search results. Then, while generating an alert associated with the search results, the system performs a token substitution operation that substitutes tokens in the alert configuration information with corresponding parameters from the search results to generate a payload that is communicated to alert-generating functionality. This token substitution allows the parameters to be used by the alert-generating functionality while performing the one or more alert actions.