Abstract: Apparatus and methods structured with respect to a data bus having a number of data lines and a number of shield lines can be implemented in a variety of applications. Such apparatus and methods can include driver and receiver circuits that operate to generate and/or decode a data bit inversion signal associated with data propagated on data lines of the data bus. The driver and receiver circuits may be arranged to operate on a two bit basis to interface with the data bus having data lines grouped with respect to the two bits with shield lines for the respective two bit data lines.

Abstract: An inter-processor synchronization method using point-to-point links, comprises the steps of defining a point-to-point synchronization channel between a source processor and a target processor; executing in the source processor a wait command expecting a notification associated with the synchronization channel, wherein the wait command is designed to stop the source processor until the notification is received; executing in the target processor a notification command designed to transmit through the point-to-point link the notification expected by the source processor; executing in the target processor a wait command expecting a notification associated with the synchronization channel, wherein the wait command is designed to stop the target processor until the notification is received; and executing in the source processor a notification command designed to transmit through the point-to-point link the notification expected by the target processor.

Abstract: A device includes a general-purpose input/output node, a serial identifier register, and serial identifier reassignment circuitry. The serial identifier register stores a serial identifier associated with the device. The serial identifier reassignment circuitry is coupled to the general-purpose input/output node and the serial identifier register. The serial identifier reassignment circuitry sets a bit of the serial identifier based on a steady-state voltage on the general-purpose input/output node. By setting a bit of the serial identifier based on a steady-state voltage on the general-purpose input/output node, the serial identifier may be easily changed using a pull-up or pull-down resistor external to the device.

Abstract: Systems and methods for providing audio streams over peripheral component interconnect (PCI) express (PCIE) links are disclosed. In particular, exemplary aspects of the present disclosure are used to calculate an uplink timing requirement and adjust a margin time before a modem encodes audio data so that the encoding is done before data is transmitted to an external network. Further aspects of the present disclosure allow a first integrated circuit (IC) to synchronize its clock with that of the modem.

Abstract: Techniques are described for managing execution of programs. In some situations, program execution is managed for multiple users using excess program execution capacity of one or more computing systems. In some such situations, excess or otherwise unused program execution capacity may be made available to execute programs on a temporary basis, such that the programs executing using the excess program execution capacity may be terminated at any time if other preferred use for the excess program execution capacity arises. The excess program execution capacity may in some situations be provided in conjunction with other dedicated program execution capacity that is allocated to particular users, such as to use unused dedicated capacity of some users as excess capacity for other users. In some situations, the techniques are used in conjunction with a fee-based program execution service that executes multiple programs on behalf of multiple users of the service.

Abstract: Techniques are disclosed for enabling collaborative work on a media content among collaborators through a cloud-based environment. An example method comprises receiving the media content; extracting a plurality of text-based data based on the media content; and indexing the plurality of text-based data so as to enable one or more actions to be performed on the media content using the plurality of text-based data. In some embodiments, the media content comprises an audio component, and the method further comprises transcribing the audio component of the media content so that the plurality of text-based data comprises a transcript of the media content. In some embodiments, the actions include a text-based search or a semantics-based search. Among other benefits, some embodiments provided herein enable indexing media content for text-based searches and/or metadata extraction to effectively manage multimedia files in a cloud-based storage/service environment.

Abstract: Embodiments are provided herein for component composition of a disaggregated computing system. A plurality of general purpose links connecting a computing element to other hardware elements are provided within the disaggregated computing system. Each of the plurality of general purpose links comprise a point-to-point connection to at least one of the other hardware elements such that the plurality of general purpose links conform to a configuration used by the other hardware elements regardless of a type of data being transferred through the plurality of general purpose links.

Abstract: A vector processor includes a coefficient memory and a processor. The processor has an Instruction Set Architecture (ISA), which includes an instruction that approximates a mathematical function by a polynomial. The processor is configured to approximate the mathematical function over an argument, by reading one or more coefficients of the polynomial from the coefficient memory and evaluating the polynomial at the argument using the coefficients.

Abstract: Aspects of the subject technology relate to archiving user generated content. A data storage device of a computer system is scanned for media files, and directories of the data storage device containing media files found during the scan are added to an upload directory list. For each directory in the upload directory list, respective identifiers for the media files contained in the directory are determined and sent to a server. Confirmation is received from the server of whether the sent identifiers match identifiers for media files already stored by the server. The media files having identifiers confirmed as not matching identifiers for media files already stored by the server are uploaded.

Abstract: In an approach for generating a file, a computer provides a selection window associated with a second file, wherein the selection window is at least partially transparent and at least partially overlays an opened first file. The computer identifies content within the opened first file that is overlaid by the provided selection window associated with the second file. The computer transfers a copy of the identified content within the opened first file that is overlaid by the provided selection window associated with the second file, wherein the opened first file does not incorporate changes that are made within the second file.

Abstract: An apparatus in one embodiment comprises a storage system having at least first and second storage tiers each comprising a plurality of storage devices. The first storage tier implements a file system having a user visible name space and a corresponding hidden data store. The second storage tier implements a cloud-based object store. The storage system is configured to controllably relocate files from the hidden data store of the file system of the first storage tier to the cloud-based object store of the second storage tier. In conjunction with the relocation of a given one of the files, the given file is replaced in the hidden data store with a corresponding stub providing user access via the user visible name space to an object comprising the given file in the cloud-based object store of the second storage tier. The controllable relocation is illustratively performed in accordance with one or more configured policies.

Abstract: A computer-implemented method according to one embodiment includes identifying an event associated with a high speed storage tier of a data storage system, determining a policy rule that is triggered in response to the event, and implementing one or more data management actions associated with the high speed storage tier according to the policy rule.

Abstract: Techniques for filesystem durable write operations to cloud object storage are described. In one embodiment, a method includes receiving at least one of a read operation or a write operation from a filesystem layer. The read operation identifies content stored in a distributed content object storage layer that is to be retrieved and the write operation identifies content that is to be stored to the distributed content object storage layer. The method includes converting the read operation into a get operation or the write operation into a put operation. The method further includes storing an index that maps the read or write operation to the get or put operation and includes an association between the content identified by the filesystem layer to objects in the distributed content object storage layer. The method includes sending the get or put operation to the distributed content object storage layer for the identified content.

Abstract: Systems and methods described herein facilitate the search and presentation of historical data for wireless network usage and provide a mechanism for high-redundancy, low-latency record retrieval of data from large data sets. Network devices divide data for a historical data store into separate record type groups, store metadata for each record type in an application database, partition each record type group by date in a historical record database that is different from the application database, and form, within each date partition, buckets of common hash values of a key parameter from each record. When a user performs a query, the network devices generate a record-specific query form based on the record type metadata to obtain lookup parameters; generate a search hash value using a key parameter from the lookup parameters; and generate a query expression based on the record type, lookup parameters, and the search hash value.

Abstract: Attaching a content file in a composition stream of a content file within a content authoring application is provided. When using a content authoring application to author a content file, aspects provide for enabling a user to enter a particular trigger input corresponding to an inline command for attaching a content file item to the content file being created or edited. In response to receiving an indication of the trigger input, an inline content attachment system listens for a subsequent text string input, which when received, is handled as search criteria for content file items that satisfy the search criteria. The system searches one or more data sources for content file items that satisfy the search criteria, and provides a scrollable list displaying search results. Upon selection of a content file item result from the list, the selected content file item is attached to the content file being authored.

Abstract: Apparatus, methods, and computer program products that can anonymously share digital files are disclosed. Various embodiments of an apparatus include a processor of an information handling device and memory that stores code executable by the processor. The code can cause the processor to match a first client to one or more digital files provided by a second client based on a content signature in each of the one or more digital files and notify the first client of a match. The first client can be anonymous to the second client and/or the second client maybe anonymous to the first client. A method and program product can also perform the functions of the apparatus.

Abstract: A space allocator in a file management system maintains and uses one or more offsets and a stored value of the largest space skipped on previous scans to increase the efficiency of scans for available space in a file system space map. When the space allocator determines a current allocation request is greater than the largest space skipped in the previous scan, a last allocated offset can be used to begin scanning to reduce the portion of the map to scan in order to find available space. When the space allocator determines the current allocation request is less than or equal to the largest space skipped in the previous scan, a first available offset can be used to begin scanning for an appropriate unused space.

Abstract: In a distributed object-based storage system that includes a plurality of object storage devices and one or more clients that access distributed, object-based files from the object storage devices, each of the files being comprised of a plurality of object components residing on different object storage device, systems and methods that use pointers stored as object attributes for file analysis and monitoring.

Abstract: Embodiments related to a system and method managing the implementation, execution, data collection, and data analysis of a structured collection procedure running on a portable, hand-held collection device are disclosed. The collection device performing the structured collection procedure has program instructions that when executed by a processor causes the processor to initiate automatically a schedule of events of the structured collection procedure upon one or more entry criterions being met at some unknown time, store in memory patient data collected in accordance to the schedule of events, end automatically the structured collection procedure upon one or more exit criterions being met at some unknown time, and mark/indicate the structured collection procedure as completed if no exception occurred during performance of an event in the schedule of events.

Abstract: In accordance with an embodiment, described herein is a system and method for row buffering in a database environment. A transparency engine can be provided between client applications and a database, and can operate as a proxy engine for the database and as a session abstraction layer for the client applications, to enable the client applications to utilize database features provided by the connection pool without code changes to the client applications. The transparency engine can maintain a plurality of local row buffers to store rows fetched from a database. The local buffers can be filled by rows pre-fetched from the database. When a client application requests rows from the database, the transparency engine can first check whether the rows exist in a local buffer. If the rows are present in the local buffer, the transparency engine sends the rows to the requesting client application, without going to the database.

Abstract: A method and apparatus for data conversion in a run-time execution environment are provided. In the method and apparatus, a data request specifying a second schema for requested data is received. A data portion is retrieved from a data store, whereby the retrieved data has a first schema. On a condition that the first schema and the second schema are determined to be different, the data portion is converted to the second schema to produce a converted data portion, whereby the conversion is performed based at least in part on data conversion information. The converted data portion is then provided to the run-time execution environment for use in a run-time execution of the computer program.

Abstract: According to an example of the present disclosure, a system and a computer-implemented method of linking data in one or more databases are disclosed. The method includes selecting at least one domain based on a user input, where the domain is indicative of a class of data elements. Further, the method includes generating a plurality of uniform identifiers, based on the at least one domain and the one or more databases, where each of the plurality of uniform identifiers corresponds to an instance of the at least one domain. The method further includes correlating the plurality of uniform identifiers to link the instances corresponding to the plurality of uniform identifiers for linking the data stored in one or more databases.

Abstract: In one embodiment, a method includes identifying one or more place-entity nodes in a heterogeneous graph, wherein the heterogenous graph comprises place-entity nodes, user nodes, and n-gram nodes, and wherein each place-entity node corresponds to a place-entity associated with a particular geographic location, assigning, for each identified place-entity node, an initial quality-score for the place-entity node, and calculating, for each identified place-entity node, a final quality-score for the identified place-entity node, wherein each final quality-score is calculated by iteratively propagating the initial quality-scores corresponding to the identified place-entity nodes, respectively, through the place-entity nodes, n-gram nodes, and user nodes of the heterogeneous graph until the quality-scores associated with the place-entity nodes, n-gram nodes, and user nodes reach convergence.

Abstract: Some aspects disclosed herein are directed to, for example, a system and method of detecting database application incompatibilities. Systems and methods described herein may format traces, collect data, store the data, and/or provide one or more user interface which allows an end user to quickly and easily identify affected statements, such as structured query language (SQL) statements, for remediation action(s).

Abstract: A method and system for automatically determining a processing path is provided. The method includes generating an input criteria associated with performing a hardware apparatus implemented process. Metadata describing the input criteria is generated and stored. Weighting factors associated with the metadata are generated and a specialized hardware apparatus executing the hardware apparatus implemented process is enabled. Measurement characteristics associated with conditions resulting from the specialized hardware apparatus executing the hardware apparatus implemented process are retrieved from a plurality of hardware sensors. A resource database catalog for hardware based data processing resources is queried and an optimization process for determining an optimized processing path for processing the metadata with respect to the resource database hardware based data and the measurement characteristics is executed.

Abstract: A blockchain may include various transactions which are identified and which require processing. The order of processing such transactions may be optimized by examining content of the transactions. One example operation may include one or more of identifying blockchain transactions, designating each of the blockchain transactions as an independent transaction type or a dependent transaction type, and determining an order to process the blockchain transactions based on the independent transaction type or the dependent transaction type.

Abstract: Archiving data in a relational database management system through a process in which an invisible index is created for each primary index of a data. When an input is received to initiate block copy of data to be archived; the data tables are locked and the identified blocks of data form the data table are block copied to an archive table. The invisible index is updated to correspond to the data table which had data archived. The primary index is then swapped with the invisible index and the data tables are unlocked. Data blocks from the main table which were copied into the archival table is deleted along with the old primary index.

Abstract: Methods and apparatuses for determining set-membership using Single Instruction Multiple Data (“SIMD”) architecture are presented herein. Specifically, methods and apparatuses are discussed for determining, in parallel, whether multiple values in a first set of values are members of a second set of values. Many of the methods and systems discussed herein are applied to determining whether one or more rows in a dictionary-encoded column of a database table satisfy one or more conditions based on the dictionary-encoded column. However, the methods and systems discussed herein may apply to many applications executed on a SIMD processor using set-membership tests.

Abstract: Techniques related to a database performance tuning framework are disclosed. The techniques include a system for improving performance of a database query, the system configured to generate one or more query execution time statistics relating to a database query operation performed by a database in response to a received query, store the query execution time statistics, determine the database query operation is slow based on the stored query execution time statistics, generate one or more database statistics based on the contents of the database, generate a suggested index using one or more of the generated database statistics, create the suggested index, determine another one or more query execution time statistics for the database query operation after creating the suggested index, and retain the suggested index based on a comparison of the stored query execution time statistics and the another query execution time statistics.

Abstract: Systems, methods, and computer-readable media for storing data in a data storage system using a child table. In some examples, a trickle update to first data in a parent table is received at a data storage system storing the first data in the parent table. A child table storing second data can be created in persistent memory for the parent table. Subsequently the trickle update can be stored in the child table as part of the second data stored in the child table. The second data including the trickle update stored in the child table can be used to satisfy, at least in part, one or more data queries for the parent table using the child table.

Abstract: A memory stores a first cache and a second cache. A processor copies a first portion of data from a first table stored in a database into a second table, performs statistical analysis on the first portion, and stores the results into the second table. The processor further determines that a second portion of data from the first table will be overwritten, copies the second portion into a third table, performs statistical analysis on the second portion and stores the results into the third table. The processor further determines that a probability that a user will access a third portion of the first table is greater than a threshold and copies the third portion into the first cache. The processor further determines a fourth portion of the first table that the user accesses at a frequency greater than a set frequency and copies the fourth portion into the second cache.

Abstract: A computing system may include a database disposed within a remote network management platform that manages a managed network, and server device(s) associated with the platform and configured to: transmit, to a third-party computing system, a request for general information identifying computing resources of the third-party computing system assigned to the managed network; receive, from the third-party computing system, a response indicating resource names and types of the resources that were identified; based on the response, determine that a first resource is of a first type, and responsively store, in the database, a first representation that has just data fields containing the general information from the response that identifies the first resource; and based on the response, determine that a second resource is of a second type, and responsively store, in the database, a second representation that has data fields arranged to contain specific information about the second resource.

Abstract: Disclosed are examples of systems, apparatus, methods, and computer program products for processing offline updates to records of a database system. In some implementations, a first update to a record is processed, and the record is modified according to a first action and first data of the first update. A second update to the record from a device with an offline status is processed. It can be determined that the second update and the first update are associated with a same portion of the record. It can be determined that the second timestamp is prior to the first timestamp. A notification can be provided to the device. The record can be modified according to a second action and second data of the second update.

Abstract: Embodiments disclosed herein generate visual summaries of data and improve the same using cognitive feedback. In one embodiment, a data visualization application determines properties associated with data or portion(s) thereof, and then generates and combines visualizations of the determined properties into visual data summaries. Examples of visualizations that may be generated include box plots, histograms, graphs, charts, and word clouds. Examples of visual summaries that combine such visualizations include videos, animated GIF (Graphics Interchanged Format) files, powerpoints, PDF (Portable Document Format) files, and web pages. Subsequent to generating visual summaries, the data visualization application may monitor user interactions with those visual summaries and update the same by rebuilding the visual summaries based on the user interactions.

Abstract: A blockchain gateway device and associated method of use for reconciling and insuring the consistency of integrated blockchain networks and legacy database-based systems. The blockchain gateway device and associated blockchain scheme harmonizes and reconciles the data elements from multiple independent blockchain databases.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for improving recommendation to users in data intelligence systems. In one aspect, a method includes the actions of receiving a current observation describing an interaction of a user with a data intelligence system; identifying a current user interest based on the current observation, wherein past observations of the user with the data intelligence system are clustered to form user interests in a Markov model; using the Markov model and based on the current user interest, determining a next user interest from the user interests; extracting a one past observation from the determined next user interest based on a selection criterion and a threshold, wherein the selection criterion is based on how closely the at least one past observation matches the current observation; and sending a recommendation to the user based on the past observation.

Abstract: A Codex human knowledge encyclopedia including a webpage database residing in the Codex and stored in non-volatile digital memory, a master index and a partial master index for each element of the Codex, an optimizer receiving from a computing device interactive input, and executing software instructions to transform input based on rules of grammar and semantics into a search pattern and personalizing the search pattern by adding Global Positioning System (GPS) coordinates from the computing device. Mapping the search pattern to an element stored in the Codex and upon identifying the search pattern, obtaining the optimal dataset from the Codex bypassing all calculations since optimal dataset is readily available, picking and arranging, in an order from highest to lowest, from the optimal dataset, the top responses as output based on personalized usage pattern of behavior, and displaying the output to the user.

Abstract: A computing resource service provider deploys resources to process input data sets on an ongoing basis and provide requestors with queryable data structures generated from the input data sets over determined, rolling periods of time. In one embodiment, the input data sets are processed using one or more nearest neighbor search algorithms, and the outputs therefrom are represented in data structures which are rotated as newer data structures are subsequently generated. The disclosed systems and techniques improve resource utilization, processing efficiency, query latency, and result consistency relative to known controls for large and/or complex data processing tasks, such as those employed in machine learning techniques.

Abstract: In an approach for semantically translating data. Aspects of an embodiment of the present invention include an approach for semantically translating data, wherein the approach includes a processor selecting a first node. A processor identifies a parent node of the first node. A processor determines that a value of the first node is unknown. A processor responsive to determining that the value of the first node is unknown, annotates the first node to indicate that the first node is at least partially unknown. A processor identifies a common table expression of the first node. A processor determines that the common table expression of the first node matches, within a predetermined threshold, a common table expression of the second node. A processor merges information from the common table expression of the second node with the common table expression of the first node.

Abstract: Described are methods, systems and computer readable media for simulated replay of data using a computer system.

Abstract: Methods that can parallel search a partitioned data set extended (PSDE) indexes are provided. One method includes managing a set of quick indexes in a memory device in which the set of quick indexes include references to storage locations for a subset of members of a PDSE stored in a set of long-term storage devices. The method further includes receiving a request to determine a storage location of a member of the PDSE and, in response to the request, searching the set of quick indexes to determine the storage location. Systems and computer program products for performing the above method are also provided.

Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes, receiving a query from a client, based on the received query, analyzing a catalog for location information, based on the analysis, determining a first storage system, an associated first file system and an associated first protocol, using the associated first protocol to communicate with the first storage system, and performing at least a portion of the query on the first storage system.

Abstract: A method is provided for generating a classification model configured to select an optimal execution combination for query processing. The method includes providing training queries and different execution combinations for executing the training queries. Each different execution combination involves a respective different query engine and a respective different runtime. The method includes extracting, using Cost-Based Optimizers (CBOs), a set of feature vectors for each training query. The method includes merging the set of feature vectors for the each of the training queries into a respective merged feature vector to obtain a set of merged feature vectors. The method includes adding, to each of the merged feature vectors, a respective label indicative of the optimal execution combination based on actual respective execution times of the different execution combinations, to obtain a set of labels. The method includes training the classification model by learning the merged feature vectors with the labels.

Abstract: A computer-implemented method is provided for analysis of process data. The method comprises receiving an APE statement (Advanced Process Algebra Execution), wherein the APE statement defines a query of process instances from the storage means, and wherein the APE statement comprises at least one process operator, and executing the APE statement and reading the process instances according to the APE statement from the storage means, and providing the result of the query for further processing.

Abstract: A method and system provide an algebraic database management system (ADBMS) that maintains ADBMS type system. The type system includes an ADBMS type database (ATD) and provides a collection of rules that assign a type to constructs. The ATD is a catalog with each record holding typing information. An interpreter dynamically processes, at execution time, a query (that is syntactically modeled on relational algebra). The interpreter: determines inputs of the query; searches the ATD for a data type of each of the inputs, determines compatibility between each of data types of the inputs based on an operator of the query, determines a resultant of the query and a data type of the resultant (based on the operator of the query), and saves the resultant of the query by adding a new record in the catalog.

Abstract: Provided are techniques for supporting a join operation against multiple NoSQL databases. A search request with a field and a value for the field is received, wherein the search request is to be issued against a plurality of database divisions formed from NoSQL databases. A simple database search is performed against a structured index to generate a first result set. An extended database search is performed against a linear database division index to generate a second result set by: identifying a relationship for the field that identifies related fields and identifying documents for the field and the related fields using a linear database division index. The first result set and the second result set are merged to form a merged result set of documents. The documents from the merged result set are displayed in response to the search request.

Abstract: The method may include providing a plurality of synopsis techniques for determining a plurality of attribute value information indicative of the at least one attribute. The method may include determining a data characteristic describing the plurality of data rows of the current data block. The method may include selecting, based on the determined data characteristic, at least one synopsis technique of the provided plurality of synopsis techniques suitable for generating the plurality of attribute value information for the at least one attribute of the current data block. The method may include determining the plurality of attribute value information for the at least one attribute of the plurality of data rows of the current data block using the at least one selected synopsis technique. The method may include storing the determined plurality of attribute value information for the current data block to be used for query processing against the data table.

Abstract: The method may include providing a plurality of synopsis techniques for determining a plurality of attribute value information indicative of the at least one attribute. The method may include determining a data characteristic describing the plurality of data rows of the current data block. The method may include selecting, based on the determined data characteristic, at least one synopsis technique of the provided plurality of synopsis techniques suitable for generating the plurality of attribute value information for the at least one attribute of the current data block. The method may include determining the plurality of attribute value information for the at least one attribute of the plurality of data rows of the current data block using the at least one selected synopsis technique. The method may include storing the determined plurality of attribute value information for the current data block to be used for query processing against the data table.

Abstract: Systems and methods for optimizing query execution to improve query processing by a computer are provided. A query is analyzed and translated into a logical plan. A runtime query optimizer is applied to the logical plan to identify a physical plan including operators for execution. The logical plan is translated into the physical plan. Execution of the query is scheduled according to the physical plan.

Abstract: Systems and methods are provided for performing constraint driven database searching. At least one constraint is received for a search of one or more databases comprising one or more datasets, each comprising multiple entry fields. The one or more databases comprising the one or more datasets may be accessed and searched based on the constraint to identify one or more dataset entries that contain the at least one constraint in one of multiple entry fields. A visual representation of the identified dataset entries may be provided to the user as results of the constraint driven database search. Additional constraints may be accepted to further narrow the results of constraint driven database search. The results may be exported and made accessible for later retrieval and/or cached for use in subsequent searches.