| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 707716000 | Based on access path | 49 |
| 20100094862 | AUTOMATED QUERY PATH REPORTING IN DISTRIBUTED DATABASES - A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract. | 04-15-2010 |
| 20100106713 | METHOD FOR PERFORMING EFFICIENT SIMILARITY SEARCH - The present invention provides systems and methods for performing efficient k-NN approximate similarity search on a database of objects. The invention is based on the definition of an index data structure that enables to have fast searches and very good scalability with respect to the database size. Such index makes efficient use of both the main and secondary memory of the computer, taking advantage of the specific properties of both kinds of memories. | 04-29-2010 |
| 20100191719 | QUERY OPTIMIZATION IN A MULTI-TENANT DATABASE SYSTEM - The present invention provides techniques for managing a multi-tenant database system. In one embodiment the method includes providing access to data stored in a multi-tenant data structure that is implemented by storing data for multiple tenants on a pool of computer servers defining the multi-tenant data structure that having a plurality of data columns and one or more index columns. The one or more index columns define a first data field for a first tenant of the multi-tenant data structure and a second data field for a second tenant of the multi-tenant data structure. The first field indicates a first data type and the second field indicates a second data type, wherein the second data type is different than the first data type. Once created, records having data values in the first and second fields are stored to a single column in the data structure. The single column includes data values having different data types for different tenants in the multi-tenant data structure. Operations are monitored so that one or more requests to access the multi-tenant data structure among are distributing the pool of computer servers to maintain load balancing among the servers of the pool. | 07-29-2010 |
| 20100223254 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZING A MULTI-TENANT DATABASE SYSTEM - More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag. | 09-02-2010 |
| 20100223255 | OPTIMIZATION ENGINE IN A MULTI-TENANT DATABASE SYSTEM - More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag. | 09-02-2010 |
| 20100281015 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR MANAGING A MULTI-TENANT DATABASE SYSTEM - More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag. | 11-04-2010 |
| 20100281016 | MULTI-TENANT DATABASE SYSTEM - More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag. | 11-04-2010 |
| 20100312762 | Multi-Core Scheduling for Parallel Queries - An operator manager may be configured to determine a number of available cores and to assign the cores among a plurality of operators of a query, the operators including a running set of operators through which a plurality of query paths exist. The operator manager may include a status monitor configured to determine the number of available cores and to determine the running set of operators, a critical path selector configured to determine a critical path of the query from among the query paths and the running set of operators, and a workload manager configured to assign a first core of the available cores to a running operator of the running set and of the critical path, and to thereafter receive a new critical path from the critical path selector and to assign a second core of the available cores to the running operator of the new critical path. | 12-09-2010 |
| 20110047143 | XML QUERY OPTIMIZATION WITH ORDER ANALYSIS OF XML SCHEMA - Techniques for determining whether an XML query may be written are provided. In one scenario, an XML query includes an expandable path, which is a path expression that includes a wildcard character (*) or a descendant axis (//). An XML schema is used to generate multiple expanded paths (each of which is a simple path expression) from the expandable path. The XML schema is used to compare each expanded path to another expanded path and to determine whether the nodes identified by the respective expanded paths are guaranteed to occur in a particular order in XML documents that conform to the XML schema. In another scenario, an XML query includes an order operator that takes two paths as input. Similarly, an XML schema is used to compare the two paths and to determine whether the nodes identified by the two paths are guaranteed to occur in a particular order in XML documents that conform to the XML schema. | 02-24-2011 |
| 20110072005 | Nearest-Neighbor Geographic Search - Disclosed herein is a method and apparatus for use in searching a geographic database to retrieve geographic objects one cell from a neighborhood of cells at a time. A cell neighborhood can be defined using a grid of cells and an initial, or center, point. A first neighborhood is identified based on its proximity to the initial search point, and corresponds to a first geographic area defined using the initial point and a distance from the initial search point in a number of directions. In a case that more than one cell neighborhood is used, each subsequent cell neighborhood is defined so that it excludes cells belonging to a previously-searched cell neighborhood. A subsequent neighborhood corresponds to a geographic area that is a distance from the initial point greater than the distance associated with a previously-searched neighborhood. | 03-24-2011 |
| 20110099160 | SYSTEM AND METHOD FOR EXECUTING QUERIES - There is provided a computer-implemented method of executing a query plan against a database. An exemplary method comprises accessing a first subset of rows of a database table using a direct access method. The query plan may comprise the direct access method. The exemplary method also comprises determining a processing cost of accessing the first subset of rows. The exemplary method further comprises modifying the direct access method in response to determining that the processing cost exceeds a specified threshold. Additionally, the exemplary method comprises accessing a second subset of rows of the database table using the modified direct access method. | 04-28-2011 |
| 20110125729 | ANALYZING XML DATA - Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification. | 05-26-2011 |
| 20110246450 | Method and system for acceleration of pathway detection and ranking within an information technology database - Methods, systems and computer-readable medium are provided for replicating the data fields used by relational join operations in transient or persistent data structures with explicit support for named relationships that may have 1:1, 1:many, many:1 or many:many cardinality. An algorithm is applied to predetermine the optional search path for finding relationships between any two rows of any of one or more tables, including relationships defined between other tables. The schema of a target relational database, either derived or input, is converted into an object-oriented schema that explicitly defines relationships between columns in the tables of the relational database and represents the tables as object classes. The schema is analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute the specific types of query listed above and incrementally populates instances of the transient or persistent structures. | 10-06-2011 |
| 20110295839 | OPTIMIZING QUERIES IN A MULTI-TENANT DATABASE SYSTEM ENVIRONMENT - In a method, system, and computer-readable medium having instructions for optimizing a query in a database system, a database statistic is generated for a number of related records for one or more entities for at least one tenant and a related record is a record with a relationship to a shared record in a database table for an entity from the one or more entities, a first cost is calculated for accessing the number of related records for at least one tenant, a second cost is calculated for accessing a number of related records accessible to a user, a comparison of the first cost to the second cost is performed to determine a data access path for retrieving accessible related records, and the data access path for retrieving accessible related records is determined based upon the comparison. | 12-01-2011 |
| 20120124030 | Methods and Systems For Pathing Analysis - Methods, systems and computer program products for pathing analysis are provided. The method includes receiving at a server, a query comprising one or more nodes. The method further includes identifying one or more prior queries, wherein the one or more prior queries comprise at least one of the one or more nodes. The method accesses metadata associated with the one or more prior queries. The method then selects based on the metadata, one or more data partitions for further processing. Next, the method causes one or more computers to identify one or more paths in the selected data partitions, wherein the one or more paths comprise at least the one or more nodes. Finally, the method presents the identified paths as an output to the query. | 05-17-2012 |
| 20120130985 | PEER TO PEER SEARCH ROUTING ALGORITHM - Technologies are generally described for a peer to peer search routing algorithm and system. In one example, a node in a peer to peer network includes a processor. In some examples, the processor may be configured to receive information regarding a topology of the peer to peer network and generate a first search routing algorithm for the peer to peer network based on the topology. In some examples, the processor may be configured to generate a second search routing algorithm for the peer to peer network based on a search characteristic and the topology. In some examples, the second search routing algorithm is distinct from the first search routing algorithm. In some examples, the processor may be configured to receive a request to search the peer to peer network. In some examples, the processor may be configured to search the peer to peer network using the second search routing algorithm. | 05-24-2012 |
| 20120158697 | MATCHING VARIOUS COMBINATIONS OF XPATH URIS TO THE SAME XML NODE - Embodiments of the present invention address deficiencies of the art in respect to subscribing and updating nodes within XML documents and provide a novel and non-obvious method, system and computer program product for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs). In one embodiment of the invention, a method for matching various combinations of XML Path Language (XPATH) Uniform Resource Identifiers (URIs) that includes receiving a XPATH expression for a node in an XML document, retrieving the node identified by the XPATH expression, determining if a template exists for the identified node, where the template resides in a database of a document management system, comparing the template expression to the XPATH expression and determining if the expressions match. The method can further include modifying the XPATH expression to account for a dominant attribute required by the template when the XPATH expression does not match the template expression and returning the modified XPATH expression. | 06-21-2012 |
| 20120173513 | ALLOCATION OF TENANTS TO DATABASE SERVICES - The claimed subject matter provides a system and method for automatic allocation of tenants to database services. An exemplary method comprises determining a query plan based on a workload for each tenant. A distance metric is created based on the query plan for each tenant, and tenants are clustered based on the distance metric into a predetermined number of clusters which is equal to the predetermined number of databases. | 07-05-2012 |
| 20120254153 | SHORTEST PATH DETERMINATION IN DATABASES - Hub based labeling is used, in databases, to determine a shortest path between two locations. Every point has a set of hubs: this is the label (along with the distance from the point to all those hubs). The hubs are determined that intersect the two labels. This information is used to find the shortest distance. A hub based labeling technique uses, in a database, a preprocessing stage and a query stage. Finding the hubs is performed in the preprocessing stage, and finding the intersecting hubs is performed in the query stage using relational database operators, such as SQL queries. During preprocessing, a forward label and a reverse label are defined for each vertex. The labels are generated using contraction hierarchies that may be guided by shortest path covers. A query, such as an SQL query, is processed using the labels to determine the shortest path. | 10-04-2012 |
| 20120259836 | Analyzing XML Data - Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification. | 10-11-2012 |
| 20120259837 | Analyzing XML Data - Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification. | 10-11-2012 |
| 20120303609 | AUTOMATED QUERY PATH REPORTING IN DISTRIBUTED DATABASES - A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract. | 11-29-2012 |
| 20120310920 | COMPUTER PROGRAM PRODUCTS AND METHODS FOR QUERY COLLECTION OPTIMIZATION - Computer program products and methods for query collection optimization and executing a query collection against one or more electronic documents are disclosed. According to one embodiment, a method of executing a query collection having a plurality of full term queries against an electronic document includes receiving the query collection, determining common terms, and searching the electronic document for the common terms in accordance with a frequency that the common terms appear in the query collection. The method further includes, for each common term found in the electronic document, searching the electronic document for full term queries that include the common term that was found in the electronic document. The method further includes, for each common term not found in the electronic document, preventing a search of the electronic document for the full term queries that include the common term that was not found in the electronic document. | 12-06-2012 |
| 20130046752 | OPTIMIZATION ENGINE IN A MULTI-TENANT DATABASE SYSTEM - More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag. | 02-21-2013 |
| 20130103671 | Processing Search Queries In A Network Of Interconnected Nodes - A search query to provide a search result may be received, which identifies source and target nodes and an application for generating the search result. The application accesses a data structure holding landmark nodes, which store a shortest path tree in the form of a set of parent links. Each parent link can identify an adjacent vertex node in a shortest path between each node in the data structure and the landmark node. The location of the source node and the target node in the shortest path trees may be identified to the landmark node. For each landmark node, using the identified locations of the target node and source node, a measure of distance between the source node and the target may be generated. The landmark node with the shortest distance may be determined. A search result related to the shortest path tree of that landmark node may be provided. | 04-25-2013 |
| 20130132369 | BATCHED SHORTEST PATH COMPUTATION - A batched shortest path problem, such as a one-to-many problem, is solved on a graph by using a preprocessing phase, a target selection phase, and then, in a query phase, computing the distances from a given source in the graph with a linear sweep over all the vertices. Contraction hierarchies may be used in the preprocessing phase and in the query phase. Optimizations may include reordering the vertices in advance to exploit locality and using parallelism. | 05-23-2013 |
| 20130138630 | ESTIMATION OF A FILTER FACTOR USED FOR ACCESS PATH OPTIMIZATION IN A DATABASE - A computer program product and method for estimating a filter factor for access path optimization in a database are provided. The method includes extracting from a statement segment for database query a relation condition which defines the relationship between a variable and a first table. The method includes obtaining first statistics information according to the relation condition and the statistics information of the first table. The method includes extracting from the statement segment a filter condition which defines the relationship between the variable and a second table. The method includes obtaining second statistics information according to the filter condition and the statistics information of the second table, and according to the first statistics information and the second statistics information, estimating the filter factor of the filter condition. The method and computer program product according to the embodiments of the disclosure may more accurately estimate filter factor of the filter condition. | 05-30-2013 |
| 20130151503 | OPTIMALLY RANKED NEAREST NEIGHBOR FUZZY FULL TEXT SEARCH - A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error. | 06-13-2013 |
| 20130159283 | INTERMEDIATE RESULT SET CACHING FOR A DATABASE SYSTEM - A method for storing intermediate result sets in a database is provided. An access plan for a single query for accessing data stored in the database system is received. An intermediate result set is generated during execution of the access plan. A value of an intermediate result set rating of the intermediate result set is determined during execution of the access plan at runtime of the query for determining if the intermediate result set, generated during the execution of the access plan, is to be stored. Based on determining that the value of the intermediate result set rating meets a predefined criterion, the determined intermediate result set is stored for a longer period of time than the runtime of the query as a stored intermediate result set. | 06-20-2013 |
| 20130191369 | QUERY OPTIMIZATION IN A PARALLEL COMPUTER SYSTEM TO REDUCE NETWORK TRAFFIC - A database query optimizer optimizes a query that uses multiple networks. The query optimizer optimizes a query to reduce network traffic on a network or node that is overloaded or above an established parameter in a node/network attribute table. The query optimization to reduce network traffic may result in a sub-optimal query in other respects such as execution time. The result is a query optimizer that rewrites or optimizes a query to execute on multiple nodes or networks to reduce traffic on a network or node according to the loading characteristics and assigned attributes of a node or network. | 07-25-2013 |
| 20130204861 | METHOD AND APPARATUS FOR FACILITATING FINDING A NEAREST NEIGHBOR IN A DATABASE - A method and apparatus for facilitating finding a nearest neighbor in a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving information indicative of a query point and information indicative of a node in the database tree; determining, by use of a processor, a lower-bound estimate based on the node and the query point, wherein the lower-bound estimate corresponds to a distance from the query point to the node; determining, by use of the processor, a temporary result corresponding to a distance to a nearest neighbor based on at least one child node of the node, the query point, and the lower-bound estimate; pruning one or more of the plurality of nodes based on the lower-bound estimate and a pruning bound; and returning a result indicative of a nearest neighbor of the query point. | 08-08-2013 |
| 20130262435 | ADAPTIVE QUERY EXECUTION PLAN ENHANCEMENT - An adaptive query execution plan enhancement is provided by: selecting a sample of literal sets from an execution history of a query statement; determining a plurality of access paths by applying each literal set in the sample to the query statement; for each given access path of the plurality of access paths, determining a total execution cost by applying each literal set in the sample to the given access path; and selecting a preferred access path from the plurality of access paths based on the total execution costs for each given access path. A plurality of preferred access paths for a plurality of query statements in an application workload is collected and may be presented as a query execution plan enhancement recommendation to users. | 10-03-2013 |
| 20130290296 | NESTING LEVEL - A system, method, and non-transitory computer readable medium are provided to access a graph comprising a plurality of nodes and at least one edge. Each node is associated with at least one database operation. Computer code is constructed that corresponds to the graph in accordance with a nesting level. The nesting level represents a degree of temporary storage to be allocated for intermediate output produced by the at least one database operation. | 10-31-2013 |
| 20130325842 | COMPUTER-READABLE STORAGE MEDIUM STORING UPDATE PROGRAM, UPDATE METHOD, AND UPDATE DEVICE - A computer-readable storage medium storing an update program that causes a computer to execute a process includes: acquiring an automaton performing matching of data in an input stream hierarchized by tags to a keyword in a query, the automaton in which an initial state, a start state indicating a start tag symbol, an end state indicating an end tag symbol, a transition between the initial state and the start state, a transition between the initial state and the end state, and a transition from the initial state to the initial state are defined; generating a path identifying the position of a start tag based on a hierarchy in the input stream when the start tag is read from the input stream; judging whether or not the generated path meets a condition corresponding to the keyword in the query; generating, when the generated path is judged to meet a condition. | 12-05-2013 |
| 20140108378 | TECHNIQUE FOR FACTORING UNCERTAINTY INTO COST-BASED QUERY OPTIMIZATION - A technique for factoring uncertainty into cost-based query optimization includes: determining the degree of uncertainty involved in the cost estimates for the query, determining the degree of sensitivity the query has to that uncertainty, and determining if there is an access path that performs well across the range of possible conditions that could occur at execution time, reducing the risk of performance spikes and performance volatility. If such an access path exists, select that access path; if not, perform parametric query optimization or query re-optimization. | 04-17-2014 |
| 20140214797 | TECHNIQUE FOR FACTORING UNCERTAINTY INTO COST-BASED QUERY OPTIMIZATION - A technique for factoring uncertainty into cost-based query optimization includes: determining the degree of uncertainty involved in the cost estimates for the query, determining the degree of sensitivity the query has to that uncertainty, and determining if there is an access path that performs well across the range of possible conditions that could occur at execution time, reducing the risk of performance spikes and performance volatility. If such an access path exists, select that access path; if not, perform parametric query optimization or query re-optimization. | 07-31-2014 |
| 20140258265 | PERSISTING AND RETRIEVING ARBITRARY SLICES OF NESTED STRUCTURES USING A COLUMN-ORIENTED DATA STORE - Methods and arrangements for storing and retrieving nested structures. A nested structure is obtained. There are created slices containing arbitrary sub-structures of the nested structure. The content of slices is stored in one or more columns of a column-oriented data store. At least one access plan for accessing slices in the data store is developed, to be used when a projection query is received. The access plan is executed to construct a nested structure that answers the projection query. Other variants and embodiments are broadly contemplated herein. | 09-11-2014 |
| 20140280027 | FLOW-DIRECTED COLLABORATIVE COMMUNICATION - Resolving a query received from a first node in a network includes accepting, by a second node in the network, ownership of the query from the first node, receiving, at the second node, an identification of a third node in the network, wherein the identification is received from a user of the second node and the user of the second node believes that a user of the third node has information necessary to resolve at least part of the query, and transferring, by the second node, ownership of the at least part of the query to the third node, wherein the accepting, the receiving, and the transferring dynamically generates a data structure that traces a propagation of the query, and the data structure is accessible to an origin of the query. | 09-18-2014 |
| 20150074083 | SQL ENHANCEMENTS SIMPLIFYING DATABASE QUERYING - Disclosed are techniques employed alone or in combination, to further enhance a database language and improve conciseness and comprehensiveness of query statements in application code. Embodiments may build upon an initial extension of database language to accommodate concepts of entity-relationship models (ERMs). That initial extension may include entities with structured types, and named associations. One technique modifies SQL to allow the SELECT command to specify element path expressions based upon a relationship (e.g. named associations between ERM elements). Another technique modifies SQL to introduce filter expressions suffixed to associations within path expressions, thus improving adherence to the principle of locality within query statements. Yet another technique allows a shorthand to “factor out” association path prefixes, thereby avoiding lengthy lists of path expressions in order to read several elements from the same nested structure or a same target entity behind a single association. Other techniques simplifying database querying are also disclosed. | 03-12-2015 |
| 20150074084 | METHOD AND SYSTEM FOR PERFORMING QUERY PROCESSING IN A KEY-VALUE STORE - A method and system for processing a query on a key-value store, including receiving a query, determining a data path in a cube based on dimensions of the received query, traversing the data path using a data path iterator from a root to blocks in the key-value store, allocating a query slice, determining rows and columns in the query slice using the data path, reading the blocks traversed by the data path iterator from a storage area, merging each of the blocks into a result cell of the query slice, and outputting the query slice. | 03-12-2015 |
| 20150310063 | PROCESSING QUERIES USING HYBRID ACCESS PATHS - Embodiments of techniques related to optimizing and processing queries are disclosed. In one embodiment, a query to access data of one or more databases is received, and a hybrid access path for accessing the data is generated. Generating the hybrid access path may include determining a plurality of candidate access paths and respective path cost values and selecting, based on the respective path cost values, two or more candidate access paths from the plurality of candidate access paths. Generating the hybrid access path may include generating, based on the two or more candidate access paths, the hybrid access path, the hybrid access path including at least one decision point and a set of options. The at least one decision point of the hybrid access path may indicate a difference between two or more candidate sequences of operations of candidate access paths from the two or more candidate access paths. | 10-29-2015 |
| 20150310066 | PROCESSING QUERIES USING HYBRID ACCESS PATHS - Embodiments of techniques related to optimizing and processing queries are disclosed. In one embodiment, a query to access data of one or more databases is received, and a hybrid access path for accessing the data is generated. Generating the hybrid access path may include determining a plurality of candidate access paths and respective path cost values and selecting, based on the respective path cost values, two or more candidate access paths from the plurality of candidate access paths. Generating the hybrid access path may include generating, based on the two or more candidate access paths, the hybrid access path, the hybrid access path including at least one decision point and a set of options. The at least one decision point of the hybrid access path may indicate a difference between two or more candidate sequences of operations of candidate access paths from the two or more candidate access paths. | 10-29-2015 |
| 20150317322 | ONTOLOGY-BASED DATA ACCESS MONITORING - Technologies are generally described for methods and systems effective to monitor a data access activity. In some examples, a method may include receiving, by a processor, a destination concept. The processor may identify a set of concepts, which may include the destination concept and at least one related concept associated with the destination concept, in an ontology. The processor may generate a planned path, which may define a first data access order associated with access of at least one of the related concepts and the destination concept, using the set of concepts. The processor may generate a browsing path which may define a second data access order associated with the data access activity. The processor may compare the planned path with the browsing path. The processor may determine a deviation based on the comparison of the planned path and the browsing path. The processor may monitor the data access activity using the deviation. | 11-05-2015 |
| 20150347623 | XPATH EVALUATION IN AN XML REPOSITORY - XPath evaluation in an XML data repository includes parsing an input XPath query using a simple path file to generate an execution tree about the XPath query, where the simple path file includes an XML file that is generated based on the hierarchical architecture of a plurality of XML files in the data repository, and the names of the nodes in the generated XML file are generated by recording the tag information of respective nodes in the plurality of XML files in the data repository. Execution of an execution tree for the data repository generates a final evaluation result. | 12-03-2015 |
| 20160110414 | INFORMATION SEARCHING APPARATUS AND CONTROL METHOD THEREOF - Provided herein is an information searching apparatus and a control method thereof, the apparatus including a communicator configured to perform data communication with a user terminal apparatus; a cache memory configured to temporarily store search result information in response to a search command; and a controller configured to obtain search result information in response to an expected search command, that is a search command for which a user's search is expected from a plurality of pre-stored source data using information received from an external server, and to temporarily store the obtained search result information in the cache memory; wherein the controller, in response to receiving search request information regarding a search command from the user terminal apparatus, obtains search result information in response to the search command from the cache memory, and controls the communicator to transmit the obtained search result information to the user terminal apparatus, thereby being capable of quickly providing the search result in response to the user's search command. | 04-21-2016 |
| 20160125030 | SYSTEM, METHOD AND RECORDING MEDIUM - A system includes a primary control device configured to control access to a first database and a secondary control device which is a standby device of the primary control device and is configured to control access to a second database. The secondary control device is configured to: receive first access prescribing information which prescribes processing for accessing the first database, and an inquiry statement to the first database from the primary control device; store the received first access prescribing information as a second access prescribing information and the inquiry statement in a first memory of the secondary control device; and erase the second access prescribing information, which is stored in the first memory and is used for the secondary control device to access the second database, when a notification of releasing a connection is received from the primary control device, the connection being used for accessing the first database. | 05-05-2016 |
| 20160132555 | MERGING DATA ANALYSIS PATHS - Merging analysis paths is provided. A first analysis path and a second analysis path are identified, wherein each analysis path identifies one or more data resources of an information space. A match is determined between a first data resource of the one or more data resources identified by the first analysis path and a second data resource of the one or more data resources identified by the second analysis path. A third analysis path that is based, at least in part, on the first analysis path and the second analysis path is generated. | 05-12-2016 |
| 20160171046 | GENERATION OF MAPPING DEFINITIONS FOR CONTENT MANAGEMENT SYSTEM | 06-16-2016 |
| 20190146958 | PROCESSING PATH DETERMINATION | 05-16-2019 |
