Abstract: Large amounts of data resulting from periodic sampling and capture of data corresponding to variable operational parameters of one or more systems, such as a plurality of vehicles, and stored in a large number of rows of data corresponding to the number of captured samples are summarized in an analytically meaningful way by simply counting the instances of particular values of the operational parameters of interest in the form of a histogram and stored as a single row of data. The reduction in number of rows of data allows acceleration of processing of later queries by a factor of one thousand (assuming an average trip length of ten minutes) or more.

Abstract: In one implementation, an apparatus includes a plurality of data access object (DAO) interfaces to facilitate interactions with a plurality of heterogeneous data sources, in which each of the plurality of DAO interfaces is to facilitate interaction with a different type of data source. The apparatus also includes a controller to receive an interaction request, to determine a data source of the plurality of data sources that is to service the interaction request, to select the DAO interface associated with the determined data source, and to implement the selected DAO interface to delegate communication of the interaction request for servicing of the interaction request by the determined data source.

Abstract: Aspects of the subject matter described herein relate to geographic visualization of data. In aspects, data is obtained from a data store. Geographical data within the data is identified. The geographical data is provided to a mapping service that returns mapping data that includes locations corresponding to the geographical data. From the mapping data, a map is drawn that shows graphical elements for tuples of the data.

Abstract: There is provided with an EXI decoder, including: a grammar store storing a first set of type grammars and a second set of type grammars, the first set of type grammars being type grammars generated according to an EXI specification from a basic schema of an XML and the second set of type grammars being type grammars that, among a set of type grammars generated according to the EXI specification from an extension schema of XML, type grammars common to the first set of type grammars are excluded; a stream input unit to receive an EXI stream; and a parser unit decoding the EXI stream, when the EXI stream is compatible with the basic schema, based on the first set of type grammars, and, when the EXI stream is compatible with the extension schema, based on the second set of type grammars and the common type grammars.

Abstract: Methods and apparatuses are provided for storing graph data within a column-oriented data store. Graph data including vertex data describing one or more vertices in the graph and edge data describing one or more edges within the graph may be received. One or more vertex rows within the column-oriented data store may be assigned, whereby each vertex row of the one or more vertex rows is assigned to one vertex of the one or more vertices. One or more edge rows within the column-oriented data store may also be assigned, whereby each edge row of the one or more edge rows is assigned to one edge of the one or more edges. At least one vertex row and at least one edge row may be populated based on the graph data.

Abstract: Described herein are approaches for computing correlated aggregates. An aspect provides for receiving a stream of data elements at a device, each data element having at least one numerical attribute; maintaining in memory plurality of tree structures comprising a plurality of separate nodes for summarizing numerical attributes of the data elements with respect to a predicate value of a correlated aggregation query, said maintaining comprising: creating the plurality of tree structures in which each node implements one of: a probabilistic counter and a sketch, wherein said probabilistic counter and said sketch each act to estimate aggregated data element numerical attributes to form a summary of said numerical attributes; and responsive to a correlated aggregation query specifying said predicate value, using said plurality of tree structures as a summary of said data element numerical attributes to compute a response to said correlated aggregate query.

Abstract: A method includes executing an instruction at a processor, where executing the instruction includes comparing a data value of a plurality of data values to a first element stored at a first location of a storage device. When the data value satisfies a condition with respect to the first element, the method includes moving the first element to a second location of the storage device and inserting the data value into the first location of the storage device.

Abstract: Computer implemented software uses multi-dimension analysis to identify performance issues, locate the root cause(s) of performance problems, and may also serve other purposes such as workload management, capacity planning In especially preferred embodiments, there can be three, four or even more dimensions being analyzed. Useful dimensions are contemplated to include database call, execution path, process status, target, and application that generates database calls. In the specific world of Oracle databases, the database call is a SQL statement, the execute path is a SQL plan, the process status is an event, the target is a database object or a database file, and the application that generates database calls is a session, or user, or service, or module, or machine. Primary and secondary attributes of dimensions can be used to facilitate analysis. GUIs can advantageously present data in matrix format that facilitates dimension picking.

Abstract: There is provided an information processing device including a metadata reception portion that receives metadata that is attached to content data and transmitted, a metadata analysis portion that analyzes the metadata received by the metadata reception portion, and a content data storage portion that determines a storage method of the content data based on a result of the analysis by the metadata analysis portion. Based on the analysis by the metadata analysis portion, the content data storage portion changes a directory structure when storing the content data, in accordance with a content of a predetermined element of the metadata received by the metadata reception portion.

Abstract: The present disclosure provides a method and an apparatus for storing data classification structure. Based on an initial classification structure tree, a reorganized classification structure tree that stores data classifications structure differently from that of the initial classification structure is generated. As the reorganized classification structure tree is flexible, when maintaining data and searching data by using the search engine, the present techniques may quickly find the desired data, thereby reducing the heavy burden of the search engine under the conventional techniques to conduct data search and high pressure of conducting data maintenance and data search. Further, the present techniques may not only reduce the burden of the search engine, but also relieve the pressure for maintaining data and searching data.

Abstract: Data mapping alternatives for creating a visual representation of a set of data are presented. A set of data is identified for analysis. The identified set of data and properties associated with the identified set of data are analyzed. Based on the analysis, data mapping alternatives for the identified set of data are determined. The determined data mapping alternatives for the identified set of data are ranked. The determined data mapping alternatives are presented in an order according to the ranking of the determined data mapping alternatives.

Abstract: Systems and methods for supporting metadata for work items stored in a web-based content management system with collaboration environment are disclosed. Users uploading work items to a folder are not required to provide metadata for the work items. Collaborators of the folder can provide metadata to work items within the folder.

Abstract: Some embodiments include a method for searching a hierarchical database structure of a database management system. In some embodiments, the method comprises detecting text input in a database search field, wherein the text input defines a search for data in the hierarchical database structure, wherein the hierarchical database structure includes items, and wherein the items include one or more of actions to be performed on data in the hierarchical database structure, indexes for looking up data in the hierarchical database structure, and database schemas defining databases in the hierarchical database structure. The method can also comprise selecting items in the hierarchical database structure based on the text input; presenting selectable options, wherein the selectable options are associated with the items in the hierarchical database structure; detecting selection of one of the selectable options, and presenting data associated with the one of the items.

Abstract: A concurrent graph DBMS allows for representation of graph data structures in memory, using familiar Java object navigation, while at the same time providing atomicity, consistently, and transaction isolation properties of a DBMS, including concurrent access and modification of the data structure from multiple application threads. The concurrent graph DBMS serves as a “traffic cop” between application threads to prevent them from seeing unfinished and inconsistent changes made by other threads, and atomicity of changes. The concurrent graph DBMS provides automatic detection of deadlocks and correct rollback of a thread's incomplete transaction when exceptions or deadlocks occur. The concurrent graph DBMS may be generated from a schema description specifying objects and relationships between objects, for the concurrent graph DBMS.

Abstract: A form is received and loaded. It is determined if a schema structure definition defines one or more choice elements for data of the form. A data structure is created for the data, the data structure includes both a schema structure valid component and a non-validated component. When a user selects one of the choice elements, a first set of zero or more data elements corresponding to the selected choice element are loaded into the schema structure valid component of the data structure. The previous set of zero or more data elements and values associated with the previous set of data elements are then stored in the non-validated component of the data structure.

Abstract: Embodiments of the invention relate to correlating schema mappings. In one embodiment, a set of schema mappings over a source schema and a target schema are received. Each of the schema mappings is decomposed into a basic schema mapping. A first set and second set of relations re determined for the source schema and the target schema, respectively. Each relation in the first set of relations is paired to at least one relation in the second set of relations. The pairing forms multiple relation pairs between the first set and second of relations in the form of (T, T?), where T is a source portion of a relation pair and T? is a target portion of the relation pair. A set of basic schema mappings is identified that matches the relation pair. Each basic schema mapping is merged into a single schema mapping.

Abstract: A method to provide an interface for launching applications is described. The method includes receiving information indicative of a record stored in an electronic device application. The method also includes determining whether the record is associated with a software application command. In response to determining that the record is associated with a software application command, the software application command is activated. Apparatus and computer readable media are also described.

Abstract: A form is received and loaded. It is determined if a schema structure definition defines one or more choice elements for data of the form. A data structure is created for the data. The data structure includes both a schema structure valid component and a non-validated component. When a user selects one of the choice elements, a first set of zero or more data elements corresponding to the selected choice element are loaded into the schema structure valid component of the data structure. The previous set of zero or more data elements and values associated with the previous set of data elements are then stored in the non-validated component of the data structure.

Abstract: Methods, systems, and computer program products are provided for managing resources. A request is received for a plurality of resources from a requester. A ticket is generated for the request that indicates the resources. For each resource, a resource provider for the resource is queried to determine whether the resource can be acquired. The ticket is queued if any of the resources cannot be acquired. The ticket is granted if all of the resources can be acquired.

Abstract: Systems and methods for scheduling requests to access data may adjust the priority of such requests based on the presence of de-duplicated data blocks within the requested set of data blocks. A data de-duplication process operating on a storage device may build a de-duplication data map that stores information about the presence and location of de-duplicated data blocks on the storage drive. An I/O scheduler that manages the access requests can employ the de-duplicated data map to identify and quantify any de-duplicated data blocks within an access request. The I/O scheduler can then adjust the priority of the access request, based at least in part, on whether de-duplicated data blocks provide a large enough sequence of data blocks to reduce the likelihood that servicing the request, even if causing a head seek operation, will not reduce the overall global throughput of the storage system.

Abstract: Method for generating an alternate logical database structure of a hierarchical database by a computing device, includes: determining a target level of a physical hierarchical database structure corresponding to a root level of a logical hierarchical database structure; accessing a current level of the physical hierarchical database structure equal to the target level; decrementing the current level by the computing device; accessing the decremented current level of the physical hierarchical database structure; and in response to determining that the decremented current level is a root level of the physical hierarchical database structure, repositioning the current level to the target level. In response to determining that the decremented current level is not the root level of the physical hierarchical database structure, repeating the decrementing of the current level and the accessing of the decremented current level of the physical hierarchical database structure by the computing device.

Abstract: Apparatus, methods, and other embodiments associated with providing front end intelligence for monitoring back end state are described. One example method includes controlling a first entity to request that a second entity perform a multi-state stateful operation (e.g., file create). The method includes receiving notice from the second entity that the stateful operation has attained a first state (e.g., partial file create complete) and, upon receiving the notice, maintaining, at the first entity, information (e.g., sequence number, metadata) associated with the stateful operation. The method also includes, upon receiving notice that the second entity lost state before the stateful operation attained a second state, selectively providing to the second entity a portion of the information maintained at the first entity, and upon receiving notice from the second entity that the stateful operation has attained the second state, terminating maintaining the information associated with the stateful operation.

Abstract: A distributed topology system may include a distributed topology engine configured to run on a server device and define a topology consisting of one or more building blocks. Each building block may represent one or more tasks pertaining to an application. The system may also include a distributed topology application configured to run on a client device and automatically execute one or more of the building blocks. A distributed topology database may be used to store the topology.

Abstract: A method for receiving a declarative specification including a plurality of stages. Each stage specifies an atomic operation, a data input to the atomic operation, and a data output from the atomic operation. The data input is characterized by a data type. Links between at least two of the stages are generated to create a data integration workflow. The data integration workflow is compiled to generate computer code for execution on a parallel processing platform. The computer code configured to perform at least one of data preparation and data analysis.

Abstract: Presented are systems and methods for creating a set of signatures including acquiring a data set and converting the data set into a plurality of data matrices. The system determines a prime number and determines a plurality of primitive roots to the prime number. The system calculates a template matrix using a first and second primitive root, of the plurality of primitive roots, and selects a data matrix property of interest. The system calculates a first hash function for each of the data matrices to create a first signature for each data matrix such that a main set of signatures is formed, wherein the first hash function is calculated using said property of interest, the prime number, and the template matrix. The system generates a main set of signatures based on the first hash functions, wherein the main set of signatures comprises a first signature for each data matrix.

Abstract: The distributed computing backup and recovery (DCBR) system and method provide backup and recovery for distributed computing models (e.g., NoSQL). The DCBR system extends the protections from server node-level failure and introduces persistence in time so that the evolving data set may be stored and recovered to a past point in time. The DCBR system, instead of performing backup and recovery for an entire dataset, may be configured to apply to a subset of data. Instead of keeping or recovering snapshots of the entire dataset which requires the entire cluster, the DCBR system identifies the particular nodes and/or archive files where the dataset resides so that backup or recovery may be done with a much smaller number of nodes.

Abstract: A multi-dimensional perfect hash table construction technique is based on which the well-known AC automaton, and can be implemented by very compact perfect hash tables. The technique may place transitions, each from a source state to a destination state, of an automaton into a hash table to generate a perfect hash table by: (a) dividing the transitions into multiple independent sets according to their respective source states; (b) ordering the sets of transitions based on the number of transitions belonging to the set, thereby defining an order of the sets from largest to smallest; and (c) constructing a perfect hash table by, for each of the sets of transitions, in the order from largest to smallest, hashing the transitions of the set into the hashing table to generate a perfect hashing table.

Abstract: Techniques are disclosed for retrieving database data records using a request having a substitute clause. The substitute clause replaces a value stored in a predefined column with a new value while selecting the values of the plurality of columns in a projection list. In one embodiment, the database request may utilize a pre-defined syntax for a SELECT statement that supports a substitute clause having a form of: substitute(<col name>, <expression>).

Abstract: Systems and methods generating schemas that represent multiple data sources are provided herein. According to some embodiments, methods may include determining a schema for each of the multiple data sources via a computing device communicatively couplable with each of the multiple data sources, each of the multiple data sources including one or more data structures that define how data is stored in the data source, generating a negotiated schema by comparing the schemas of the multiple data sources to one another and interrelating data points of the multiple data sources based upon the schemas, interrelating the negotiated schema with the schema for each of the multiple data sources based upon the interrelation of the data points, and storing the negotiated schema in a storage media by way of the computing device.

Abstract: Information migration systems and methods are presented. In one embodiment, a cloud information migration method comprises: performing a migration interpretation process, including interpreting migration initiation information; performing a migration information retrieval process to automatically retrieve information in a first configuration from a first cloud vendor in accordance with the migration initiation information; performing a migration information configuration process, including automatically converting the retrieved information in a first configuration to information in a second configuration, wherein the second configuration is compatible with a second cloud vendor; and performing a migration information forwarding process to automatically forward the information in a second configuration to the second cloud vendor in accordance with the migration initiation information.

Abstract: A system and method for patent mapping are provided. The system comprises a database of patent sets and a database of patents, each patent stored in the database of patents associated with one or more patent sets stored in the database of patent sets; and one or more modules to perform a portion of one or more of the following: receive input identifying a set of keyword source claims associated with a first patent set; automatically extract at least one keyword from the source claims; receive or formulate a search query associated with the first patent set, the search query including the at least one keyword; search the entire first patent set as a function of the search query; generate search results, the search results including one or more patent claims associated with the search query; and map the one or more patent claims to a patent concept.

Abstract: Methods and systems for creating a compact tree node representation of an XML document. One implementation commences by allocating memory for storing an XML tree index data structure, then allocating another separate portion of memory to store a hash table. Then, traversing an XML document to process the traversed nodes as follows: (a) when the traversed node is an element node, then adding the element node to the XML tree index data structure (b) when the traversed node is a text node, then populating a text node index into the XML tree index data structure and copying the text node values to the hash table, and (c) when the traversed node is an attribute node, then populating an attribute node index into the XML tree index data structure. Such a structure supports fast index-based tree restructuring, and permits very large XML document to be accessed within tight memory size constraints.

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: At least one message flow file that stores a message flow is read by a processor. The message flow stored within the at least one message flow file is parsed. The message flow is organized within a memory as a message flow database structure. Entries within the message flow database structure represent nodes, connections, and properties used by the message flow. The message flow database structure is edited in response to receipt of a structured query language (SQL) statement that specifies a change to the message flow database structure.

Abstract: A computer apparatus and related method to reduce database congestion is provided. In one aspect, the computer apparatus and method may generate a new partition within a hierarchical data structure of interlinked nodes, if a distribution of key values stored in the hierarchical data structure is skewed in favor of a range of key values.

Abstract: A system and method for supporting self-expiring data content. In accordance with an embodiment, a data record can be associated with a future expiration date and/or time, which can be specified as either an absolute date or time, or a relative date or time. When the expiration date and/or time is reached, the data record and its associated data are automatically deleted from the system. Depending on the particular implementation, the deletion can be automatic or provide some form of confirmation or acknowledgement. In accordance with an embodiment, a user inputting the data can control the record's expiration date, such that data is only retained in the system for as long as the user reasonably expects the data to be useful to them. For example, in a mobile phone contacts implementation, a user can attach an expiration date to a particular contacts data record, and that record will only remain in their mobile phone for that desired period of time.

Abstract: An aspect of the disclosed technology is a general-purpose platform that may be used to provide resilient cloud services. Tasks may be written as procedures in general-purpose programming languages that directly manipulate resources via control interfaces. In one implementation, resource states, such as router configurations and virtual machine states, associated with a cloud customer that provides communications services, may be abstracted into tables in a relational or semi-structured database. State changes that have been written to the database tables are automatically propagated by the database to appropriate customer physical devices, such as network elements, thereby implementing various customer network operations.

Abstract: A full backup of a database is created at a first point in time. To restore the database to its state at a second point in time (after the full backup was created), a set of incremental backups, including the incremental backup that corresponds to the second point in time and incremental backups created between the first and second points in time, is used in reverse chronological order. For example, blocks in the full backup can be selectively overwritten with corresponding blocks from the incremental backups in reverse chronological order.

Abstract: A computer apparatus and related method to accelerate recursive queries is provided. In one aspect, a node located within a data structure may be accessed. The data structure may emulate a hierarchy of interlinked nodes. In another aspect, a series of bits may be generated that indicate a level of the node within the hierarchy and that outline a unique path of interlinked nodes toward the node.

Abstract: Methods, systems, and computer program products are provided to efficiently allocate extremely large storage spaces for use by dynamic hash tables. A contiguous storage space is designated from which dynamic hash tables can be created. These dynamic hash tables benefit from rapid allocation by being able to reserve many allocation units (each potentially comprising a large number of pages, e.g., 256 pages) within a short span of time, rather than resorting to reserving individual pages. The efficiency from allocation and the contiguous space significantly improves performance for databases in the 50 GB-100 GB size range.

Abstract: Methods for product data management and corresponding systems and computer-readable mediums. A method includes maintaining a data structure for a complex item. The data structure includes a root node representing the complex item, at least one assembly node associated with the root node, and a plurality of part nodes each associated with the assembly node. The method includes defining at least two absolute occurrences associated with the root node and corresponding to at least the root node and the assembly node. The method includes defining at least one managed occurrence that includes a plurality of the absolute occurrences. The method includes using the managed occurrence as a central control authority for the plurality of absolute occurrences.

Abstract: Methods for product data management and corresponding systems and computer-readable mediums. A method includes maintaining a hierarchical data structure for a complex item. The data structure includes a root node representing the complex item, at least one assembly node associated with a the partition node, and a plurality of part nodes each associated with the assembly node. The method includes defining at least two occurrences associated with the root node and corresponding to at least the root node and assembly node. The method includes defining at least one partition node representing a partition of the complex item, the partition node representing an organizational division of the occurrences of the associated with the root node that can be referenced in queries and navigation. The method includes associating at least two of the plurality of occurrences with the at least one partition node.

Abstract: Web workflow service information may include implementations, contracts, addresses, bindings, and other information that is sprinkled throughout source files, configuration files, and other locations. A service explorer extracts service information, and visualizes service information in a form that supports navigation, thereby helping developers understand and use workflow service information. A workflow service structure underlying the visualization is constructed with the extracted service information. A hierarchical node visualization of the service structure is displayed in a service explorer GUI. A developer navigates by expanding/contracting nodes, searching nodes, selecting nodes, and running tools with node-specific information, e.g., for testing, tracing, publication, workflow design, and so on. The visualization is automatically updated after service configuration changes.

Abstract: A portable communication device for extracting a user interest comprises a term vector generation unit for generating, based on types of text data stored in the portable communication device, a term vector representing each text data, a subject classification tree storage unit for storing a subject classification tree, which is a tree structure in which multiple nodes, each including at least one training data and representing a subject, are connected to one another, and a similarity calculation unit for calculating a similarity between the term vector and the training data for each node in the subject classification tree. The similarity calculation unit extracts a node name representing the user interest from the subject classification tree based on the similarity.

Abstract: A system, method and data structure for processing a sequential set of data. A set of data is processed such the repetitive sequences of data are represented by a value and an offset of the last array element in the sequence. The resulting compressed array facilitates binary searching of data element values, modification of data element values, and/or addition/deletion of data array elements without requiring a regeneration of the array.

Abstract: Technology is disclosed for providing contact management services. Contact information (e.g., phone numbers, addresses, email addresses, etc.) are collected from multiple, different sources (e.g., a mobile phone, a web server, a social media web site, SMS, an App, etc.) Contact information can also be entered in a free-form format and parsed into structured data that is associated with a contact card. A contact card stores the contact information and the source of the information. Contact cards can be aggregated into a merged contact card that includes information from the multiple, different sources, without loosing the original information. The merged contact card can be disaggregated into its constituent contact cards and used to create other contact cards. A user can associate one or more of their contact cards with a group. The group is optionally notified when the users changes its contact information.

Abstract: A Java-MATLAB bridge is provided for enabling utilization of MATLAB® functionality in an enterprise environment. The Java-MATLAB bridge includes a Java® wrapper and a MATLAB wrapper. The MATLAB wrapper is coupled to the Java wrapper and the Java wrapper provides an entry point for invoking the MATLAB functionality in the enterprise environment.

Abstract: Evaluating an item based on user reputation information is disclosed. Sharing event data is received. A graph is materialized from the received sharing event data. User reputation scores are determined based at least in part on the graph. A score is assigned to the item based at least in part on the user reputation scores of users associated with the item.

Abstract: A processing system that implements physical integration, virtual integration, and stream integration by defining meta-information correlating a physical model on an information source side and a logical model on a user-side and by selectively executing push-type information integration of returning to the user-side, an integration result according to information input from the information source side and pull-type information integration of returning to the user-side, an integration result according a query from the user-side.

Abstract: Providing data to a computer software application by intercepting a request made by a computer software application to retrieve a first data set from a first data storage location, accessing a record, defined in advance of the request, that includes a reference to the first data set and a reference to a second data set, retrieving the first data set from a data storage location other than the first data storage location, and retrieving the second data set from a data storage location other than the first data storage location in advance of a request by the computer software application to access the second data set at the first data storage location.