Abstract: An apparatus to facilitate thread scheduling is disclosed. The apparatus includes logic to store barrier usage data based on a magnitude of barrier messages in an application kernel and a scheduler to schedule execution of threads across a plurality of multiprocessors based on the barrier usage data.

Abstract: Embodiments include a search and match computing system configured to: access, from a third party computing system, a query regarding at least one entity; determine if the query is a structured query or an unstructured query; process the query with at least one of an application programming interface configured to receive structured queries or a second application programming interface receive unstructured queries; initiate a search and match application configured to execute queries on at least one of: a relational data scheme or a non-relational data scheme; receive search results from the at least one of: the relational data scheme or the non-relational data scheme; and process the received search results to generate an output data packet for access by the third party computing system.

Abstract: In a datacenter setting, a summary of differences and similarities between two or more states of the same or similar systems are predicted. Initially, a Long Short-Term Memory (LSTM) neural network is trained with to predict a summary describing the state change between at least two states of the datacenter. Given a set of training data (at least two datacenter states that are annotated with a state change description), the LSTM neural network learns which similarities and differences between the datacenter states correspond to the annotations. Accordingly, given a set of test data comprising at least two states of a datacenter represented by context graphs that indicate a plurality of relationships among a plurality of nodes corresponding to components of a datacenter, the LSTM neural network is able to determine a state change description that summarizes the differences and similarities between the at least two states of the datacenter.

Abstract: A temporary state service protocol is utilized by clients to temporarily store and access data within rows of a database between different requests made by end users. Each client creates and manages one or more items for storing data in rows of the database independently from other clients. An Application Programming Interface (API) is used to create and interact with the data that is temporarily stored in items within rows of the database. Different clients may share data within a single item and the data may persist beyond a session ending. Different rows of the database may be related such that a procedure affecting one of the rows affects its related rows.

Abstract: A method for storing data caveats for databases is described. The method includes storing at least one record in at least one content table in a database. The method includes storing at least one data caveat having a relationship to the content table in at least one record in a caveat table. A data caveat has a relationship to the content table when the data caveat applies to: a record in the content table or the content table in entirety. The method also includes storing, in a memory device, an indication of the relationship. Articles of manufacture are also described.

Abstract: A method for storing data caveats for databases is described. The method includes storing at least one record in at least one content table in a database. The method includes storing at least one data caveat having a relationship to the content table in at least one record in a caveat table. A data caveat has a relationship to the content table when the data caveat applies to: a record in the content table or the content table in entirety. The method also includes storing, in a memory device, an indication of the relationship. Articles of manufacture are also described.

Abstract: A cloud computing service stores customer data on a server that is located outside of a network security system of the customer. The cloud computing service automatically monitors the customer data to identify one or more access events that originate from a resource within the cloud computing service. For each access event, the service identifies a resource and a data set. The resource may include an identifier associated with a human operator or a software application that performed the access event, and the data set may include customer data that the resource accessed during the access event. The service may create a report of each access event and the information corresponding to the data set for each access event, and it may cause the report to be transmitted to the customer.

Abstract: A method, system, and computer program product for of processing database queries using the resource description framework (RDF) language through a gateway service. The method commences by receiving a database query (e.g., an SQL query) from an application, the query being in a first query language format, then converting the query into a SPARQL query format and submitting the converted query to a SPARQL endpoint. The SPARQL endpoint processes the SPARQL query (e.g., by accessing an RDF repository), and sends back the query results. A gateway service (e.g., a SPARQL gateway) then receives the SPARQL query results from the SPARQL endpoint and transforms the SPARQL query results into a format corresponding to the first query language format so the initiating application can process it natively. Several performance features are disclosed, including a method for achieving a quality of service level by concurrently submitting multiple SPARQL queries with different LIMIT clauses.

Abstract: Event based metadata synthesis is provided. In some embodiments, event based metadata synthesis includes determining time and location information for a first digital asset (e.g.

Abstract: A system and associated method for manipulating a Siebel database (SDB) with a Structured Query Language (SQL) statement utilizes a SQL-eScript parser, which uses a business component (BC) on a Siebel data model of the SDB, which has data elements corresponding to the data elements of the SQL statement to be performed against the SDB. In the SDB, data of the SDB is stored in relational database tables, accesses to the SDB must utilize a BC which describes and references a part of the Siebel data model. The SQL-eScript parser enables users to access the SDB by use of the SQL statement by interpreting the SQL statement and automatically identifying and utilizing a BC on the Siebel data model having all data elements of the SQL statement and performing eScript BC methods corresponding to operations of the SQL statement in updating the SDB.

Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.

Abstract: Methods and systems are disclosed for naming methodologies for a hierarchical system. In one embodiment, a computer implemented method of organizing instance names in a hierarchical system includes receiving a description of a hierarchical system that includes plurality of instances arranged in different branches in a plurality of hierarchical levels in a physical data structure, creating an instance name data structure configured to describe the corresponding instances in the hierarchical system, where the instance name data structure comprises a map of indexes and a corresponding array of offsets configured to access naming information in a subsequent level, and associating names of instances in the hierarchical system to a corresponding set of unique integers which are arranged in a sequential manner.

Abstract: In token compression, a column value is represented by a encoded token. During early predicate evaluation, the result that a decoded token in a column does not satisfy a predicate condition in a predicate conjunction is recorded in a cache as a “FALSE”. Such a result not only means that when the column contains that token that the predicate condition is not satisfied, but also that a predicate conjunction containing the predicate condition is not satisfied. When performing early predicate evaluation on a subsequent row on a token in a column, the conjunction result cache is referred to. If the cache records a FALSE for that token in that column, then it is known the predicate conjunction cannot be satisfied by the decoded token.

Abstract: A data augmentation machine may form all or part of a data augmentation system that is configured to augment data. The data augmentation machine may be configured (e.g., by one or more software modules) to access data (e.g., by crawling one or more public or private networks), extract metadata based on the data (e.g., from the data and its source), create a link to additional data (e.g., based on the extracted metadata), and augment the extracted metadata (e.g., by storing augmented metadata with the extracted metadata). Such augmented metadata may be presented (e.g., within a user interface), published publicly (e.g., on a webpage), published privately (e.g., in a report available only to premium subscribers of a data augmentation service), or any suitable combination thereof.

Abstract: Provided are techniques for generating a relational query. Information is collected from a query specification and a model for an On-Line Analytical Processing (OLAP) query having at least a first expression and a second expression. The collected information is used to generate a relational query to retrieve report data to be used to satisfy the first expression and the second expression.

Abstract: Relational database modeling and triggers are employed and coordinated to maintain and manage tunable parameters and characteristics of a Workload Optimized System. The database model is initialized with pre-defined values as per definition of Workload Optimized Systems, which models the optimal configuration of the workload-optimized system, capturing various performance configurations, security and other related system and software configuration. The values present the optimal values for the entire solution. A daemon is run to monitor for changes in the tunable configuration settings, which also updates the current values of the configuration parameters on the RDBMS. SQL Triggers are implemented on the database to identify cases where corrective actions are required to the configuration parameters.

Abstract: A system and method is provided for determining an available space in one or more data blocks. A physical data storage area associated with one or more portions of a database may be determined. An available space in each data block of one or more data blocks in the physical data storage area may be determined. A number of new data rows that can be added to each data block may also be determined.

Abstract: A method for providing a data binding abstraction. The method includes serving an interactive document via a digital data communications network using a server. The method includes generating, with intelligence in the document, a data binding request to resolve a data value placeholder that has no static data location or source reference. With a data binding web service, the method includes generating a data dictionary request that includes a placeholder identifier. The method includes using the data binding web service to process a data dictionary response which includes placeholder content for the placeholder to determine a source of the data value. The method includes the data binding web service accessing the determined data source to obtain the data value and providing the interactive document with a response including the placeholder identifier and the resolved placeholder data value. The interactive document then replaces the placeholders with the returned data value.

Abstract: A system for transparent navigation of relational data models is provided. The system may include a request detector, a relationship detector, and an address evaluator. The request detector may be configured to receive a request for a node in the data schema. The relationship detector may be configured to determine that the request includes information associated with the relationship aspect. The address evaluator may be configured to resolve the information associated with the relationship aspect into the requested node.

Abstract: Various embodiments of systems and methods for executing a customized business process in a business process framework are described herein. A user selection of a solution type corresponding to a business process is received from a user interface. In response to the user selection, a query is executed to retrieve application types and corresponding sub-application types from a business logic stored in a database. Configurable attributes are generated based upon the application types and the corresponding sub-application types. Based upon the application types, the sub-application types and the configurable attributes, the business process is customized to create a customized business process. Based upon a configuration information, a user input to the customized business process is captured from the user interface. The user input is validated by comparing the user input with the business logic. The customized business process that is validated is further executed in the business process framework.

Abstract: Diverse drawings, documents, files and notes in different formats describing buildings in their finished and installed state are electronically aggregated into sets of as-built drawings for convenient and rapid future access.

Abstract: A method for effective data storing allowing reducing storage requirements and speeding up various storage operations by reducing storage of redundant data is disclosed. The method includes receiving new informational objects (such as computer files) for storage and breaking down the new informational objects into multiple data objects. Each data object is analyzed to determine whether an identical data object already exists in a database. If an identical data object already exists in the database, the new data object is not stored. If, on the other hand, an identical data object does not exist in the database already, the new data object is stored. Furthermore, for each informational object to be stored, relational links are generated which associate the data objects and their storage locations with the informational object such that the informational object can be easily recreated when required.

Abstract: In one embodiment, a computer-implemented method comprises receiving a query in a controller. A data store stores data in a relational database. The database comprises a plurality of fields and a plurality of data elements. Each field is associated with a portion of the data elements. The database is arranged as at least one table, and the query identifies data of an object to be stored in a data set. The method further comprises determining, by the controller, whether the relational database includes a field associated with a class of the object; and if the relational database does not include a field associated with the class of the object, adding a column to the relational database, the added column having a field corresponding to the class. The method further comprises adding the data of the object to the relational database.

Abstract: In managing a relational database, a relational manager sets a foreign key lookup value to an unavailable state in a source table row containing each of a foreign key value and the foreign key lookup value in a source table in a relational database, wherein the foreign key value references a primary key value in a referenced row in a separate destination table in the relational database. The relational manager, responsive to looking up, for the foreign key value, in a data structure separate from the source table, a location of the referenced row in the relational database, when the foreign key lookup value is set to the unavailable state, updating the foreign key lookup value with the location, wherein the foreign key lookup value in the source table is looked up for identifying the location of the referenced row for subsequent retrievals of the referenced row for the foreign key value.

Abstract: According to a present invention embodiment, a system determines a relationship between source and target database tables, and includes a computer system including at least one processor. Potential pivot keys of the target database table are determined, and maps are created for each potential pivot key between the database tables based on distinct values. Transformations for each map are generated that enable target data to be produced from source data. The transformations for each potential pivot key are analyzed and the potential pivot key with the transformations that generate the greatest amount of matching data is selected as the resulting pivot key. The database table columns corresponding to the resulting pivot key are determined to be associated by the relationship. Embodiments of the present invention further include a method and computer program product for determining a relationship between source and target database tables in substantially the same manner described above.

Abstract: A system and method for improved processing of an SQL query made against a relational database is disclosed. In one example embodiment, the method includes parsing the SQL query, received against the relational database, to obtain each operator and associated one or more operands and sequence of execution of the operators. Further, it is determined whether all needed closure-friendly operators exist. Furthermore, any available closure-friendly operators are obtained from a pattern repository if all needed closure-friendly operators do not exist. In addition, remaining or all non-available closure-friendly operators are dynamically generated. Moreover, the available closure-friendly operators and the dynamically generated closure-friendly operators are grouped into one or more patterns and impact of each pattern on a queried relational database and a database schema is classified. Also, the SQL query is executed using the one or more patterns based on sequence of the execution of the operators.

Abstract: Techniques for processing relational data with a user-defined function (UDF) are provided. Relational input data being requested by the UDF, from within a relational database system, is intercepted and normalized. The UDF is called with the normalized input data and as the UDF produces output data in response to the normalized input data that output data is captured and normalized. In an embodiment, the normalized output data is used to dynamically update a data model within the relational database for the input data.

Abstract: The subject disclosure is directed towards providing data for augmenting an entity-attribute-related task. Pre-processing is preformed on entity-attribute tables extracted from the web, e.g., to provide indexes that are accessible to find data that completes augmentation tasks. The indexes are based on both direct mappings and indirect mappings between tables. Example augmentation tasks include queries for augmented data based on an attribute name or examples, or finding synonyms for augmentation. An online query is efficiently processed by accessing the indexes to return augmented data related to the task.

Abstract: A knowledge base system is provided which includes a relations table which includes slots for a predicate identifier and first and second arguments of a respective relation. Each predicate identifier encodes a key for a respective entry in a predicate table. The predicate identifier also encodes argument types for the two arguments in the respective row of the relations table. Some of the argument types are associated with respective linked tables. This allows one of the arguments in a row of the relations table to serve as a key to an entry in the respective linked table on the condition that the predicate identifier for that row encodes the associated argument type.

Abstract: Methods and apparatus to identify users of handheld computing devices are disclosed. An example method includes generating, via a logic circuit, a first handling pattern indicative of a manner in which a handheld computing device is moved while the handheld computing device is presenting media; and storing the first handling pattern and corresponding user identification information in a database, handling patterns stored in the database to identify users of the handheld computing device.

Abstract: Embodiments of apparatus, systems and methods facilitate knowledge dissemination and promote knowledge acquisition, in part, by automatically presenting elements of an interlinked knowledge base to optimize learning efficiency. In some embodiments, content associated with a plurality of linked subject items in a knowledge base is disseminated to a user based on rankings determined using a priority value associated with candidate subject items. The candidacy is determined and the priority value is computed based on, at least in part, user-specific understanding values corresponding to the candidate subject items; user-specific understanding values of at least one of a plurality of basic subject items linked to the candidate subject items, and user-specific understanding values of at least one of plurality of advanced subject items linked to the candidate subject items. Content associated with the plurality of candidate subject items may be displayed to the user in order of rank based upon user interest.

Abstract: Methods and apparatus are provided for completing schedule information. A device displays keyword information corresponding to at least one piece of character information, and at least one piece of recommended schedule information selected from a plurality of domains and having a correlation with the keyword information, in response to inputting the at least one piece of character information. Schedule information is automatically completed according to at least a selection of a piece of recommended schedule information from the displayed at least one piece of recommended schedule information.

Abstract: Exemplary embodiments involve a processor receiving a function call formatted to interact with a relational database. The function call references an object in the relational database by referencing at least one table of the relational database and at least one column of the at least one table. The processor transforms the function call into a transformed function call formatted for interacting with a hierarchical data structure. The hierarchical data structure comprises a plurality of nodes, wherein each node has a single parent node. The processor applies the transformed function call to one or more nodes of the hierarchical data structure.

Abstract: Techniques are disclosed for generating statistical views in a database system. In one embodiment, a request is received to execute a database workload. One or more constraints pertaining to executing the database workload is retrieved. The database workload is evaluated to generate multiple statistical view candidates. The statistical view candidates are refined based on the one or more constraints. One or more statistical views are then generated based on the refined statistical view candidates.

Abstract: A system and associated method for manipulating a Siebel database (SDB) with a Structured Query Language (SQL) statement utilizes a SQL-eScript parser, which uses a business component (BC) on a Siebel data model of the SDB, which has data elements corresponding to the data elements of the SQL statement to be performed against the SDB. In the SDB, data of the SDB is stored in relational database tables, accesses to the SDB must utilize a BC which describes and references a part of the Siebel data model. The SQL-eScript parser enables users to access the SDB by use of the SQL statement by interpreting the SQL statement and automatically identifying and utilizing a BC on the Siebel data model having all data elements of the SQL statement and performing eScript BC methods corresponding to operations of the SQL statement in updating the SDB.

Abstract: A sequence of events may be planned by drawing on knowledge of existing sequences of events, and combining those events in accordance with a set of constraints. In one example, the sequences of events are events in a social agenda, such as dinner, drinks, movie, etc. Actual social agendas that users have carried out are monitored (with the users' permission), and these events are stored in a database. A sequence of events may be referred to as an existing path. Using the database, a system can respond to a query such as “plan an evening in Seattle,” or “plan an evening in that includes a movie” by querying the database to determine what sequences have already happened, and either retrieving an existing sequence or synthesizing a new one from existing sequences.

Abstract: A method includes identifying interrelated files stored on one or more storage devices for each topic grouping. The interrelated files correspond to a particular topic grouping and are determined based on metadata associated with the interrelated files. A relative importance for each of the interrelated files within each topic grouping is determined. The relative importance indicates an importance of each of the interrelated files in a corresponding topic grouping relative to the other files in the corresponding topic grouping based on metadata associated with the interrelated files. A montage of visual representations of the interrelated files for each topic grouping is displayed using a visual indication of the relative importance.

Abstract: A database server receives a data request from a client. In response to the data request, the database server selects, from a database, actual data that satisfies criteria specified by the data request. The database server retrieves the selected actual data from the database. Also in response to the data request, the database server redacts the retrieved data in real time without modifying the actual data contained within the database. This may be accomplished by the prior insertion of masking operators into a top SELECT clause of a query representation generated during semantic analysis. The database server returns the redacted data to the client as a reply to the data request.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying one or more rows in a relational database that have each been modified since a first point in time, wherein each of the rows is associated with a respective table in the relational database; for each of the identified rows, updating a respective file in an external representation of the table associated with the row to reflect the modification to the row wherein the respective file is not stored in the database; and creating a first version of the relational database in a version control system using the external representation including one or more of the updated files, wherein the first version of the database comprises one or more files in the version control system.

Abstract: System and methods are provided. In one embodiment, a system includes a master data archiver configured to store a data related to a turbomachine system and a first data collector service system configured to collect the data from the master data archiver. The system also includes a second data collector service system communicatively coupled to the first data collector system and configured to pull or to push the data from the first data collector system and a first data archiver configured to receive at least some of the data from the second data collector system. The system further includes an asset model database storing a plurality of turbomachine tags, wherein the turbomachine tags are configured to categorize the data and a data access system (DAS) configured to provide data access to the first data archiver, the asset model database, or a combination thereof.

Abstract: Disclosed are an apparatus and method of retrieving a plurality of data memory containers from a database. One example method of operation may include displaying the plurality of data memory containers on a graphical user interface, receiving a selection of one or more of the data memory containers, and displaying a moving array of the plurality of data objects included in the selected one or more data memory containers. The objects may be images or other user defined data files that are distributed to a virtual house application.

Abstract: An automated event viewing method for storing data for a process automation system. The method includes assigning a plurality of collected process data values from a physical process to a stream, and writing the stream on non-transitory machine readable storage to obtain a stored data stream having an original sampling rate.

Abstract: Reference data is defined declaratively and deployed imperatively to both new and existing databases. By designating a reference data set as open or closed, reference data can be overwritten or spared. Reference data can be included in schema comparison. Reference data defined in scripts can be validated against corresponding table definitions and non-compliant values can be reported.

Abstract: A method of managing models in a network includes receiving at a model manager a model of a controlled system in a first format from a first system and storing the model in a second format in the model manager. Storing includes several steps that allow for the transformation of the model into a different, version-free format so that the network can adapt to changes in the first format.

Abstract: Embodiments of the invention relate to a multi-level database compression technique to compress table data objects stored in pages. A compact dictionary structure is encoded that represents frequent values of data at any level of granularity. More than one level of compression is provided, wherein input to a finer level of granularity is an output of a coarser level of granularity. Based upon the encoded dictionary structure, a compression technique is applied to a stored page to compress each row on the page. Similarly, a de-compression technique may be applied to decompress the compressed data, utilizing the same dictionary structures at each level of granularity.

Abstract: Techniques for constructing query operations associated with a report specification are described. The query operations may include a mixture of multidimensional operations and relational operations. The application of the query operations are sequenced with the computing device to reduce or eliminate certain complexities and ambiguities during generation of reports, thereby providing an improved experience for user. For example, any multidimensional rollup operation may be applied to the multidimensional representation of the data within a first timeframe and that any aggregation operation and second level filtering are applied within a second timeframe subsequent to the first timeframe. A report may be output based on a resultant data set produced by application of the query operation in accordance with the sequencing.

Abstract: An enterprise business intelligence system includes a data access service. In one example, a method comprises receiving, with a data access service, a query and a report specification from an application, wherein the data access service is positioned between the application and a data source; creating a run tree that comprises a sequence of executable decoration nodes; executing the query on the data source, thereby providing a query result set comprising query results drawn from the data source that are responsive to the query; and executing the sequence of decoration nodes on the query result set. The decoration nodes modify the query result set, thereby producing a decorated result set based on the query result set and the decoration nodes. Producing the decorated result set comprises associating members or values in the query results with corresponding positions or calculated members in the report specification.

Abstract: Identifying parameter and name/value pair separators within two or more strings of data. The identifying is performed by selecting at least one name/value pair separator candidate from the two or more strings of data, and filtering the at least one name/value pair separator candidate using one or more rules, thereby removing any of the name/value pair separator candidates that do not conform to any of the one or more rules. The identifying additionally includes selecting at least one parameter separator candidate from the two or more strings of data, and filtering the at least one parameter separator candidate using one or more rules, thereby removing any of the at least one parameter separator candidates that do not conform to any of the one or more rules. The result is a set of tuples that includes a name/value separator candidate, and a parameter separator candidate.

Abstract: Receiving from each of a plurality of low level monitor models an outbound event comprising information associated with a respective data source. The information received in each of the outbound events can be collected to a global monitoring context in which the information is automatically aggregated. Via a global cube associated with the global monitoring context, the information can be presented in a report. At least one new outbound event can be received. The new outbound event can include updated information associated with at least one of the data sources. Responsive to receiving the new outbound event, the information presented the report can be updated in real time to reflect the updated information.

Abstract: Techniques are described for creating a first data abstraction model for a first database. Embodiments analyze the first database to determine a first set of structural characteristics, and analyze a second database to determine a second set of structural characteristics. The analyzed second database is associated with a second data abstraction model. The first set of structural characteristics is compared with the second set of structural characteristics to identify one or more similarities between the two sets of structural characteristics. Embodiments then create the first data abstraction model for the first database, based on the identified similarities and the second data abstraction model.