| Entries |
| Document | Title | Date |
|---|
| 20100100553 | METHOD AND APPARATUS FOR RANKED JOIN INDICES - A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors. | 04-22-2010 |
| 20100114905 | Method, System, and Product for Managing Spatial Data in a Database - A method, spatial data system, and computer program product for managing spatial data stored in a database by indexing spatial object identifiers associated with spatial objects of varying dimensions using a spatial index for each spatial object identifier comprised of one or more index coordinate variables that define a single point spatially related to the spatial object and one or more index dimension variables that define a bounding shape based on the spatial object's size. The spatial data system is configured to allow querying of the database to determine spatial object identifiers, and associated spatial objects, within a search area by identifying spatial indexes that define bounding shapes intersecting the search area and producing the results on a user interface. | 05-06-2010 |
| 20100205182 | METHODS AND DEVICES FOR MAPPING DATA FILES - A method of mapping interconnections between a plurality, of data files, such as files of the world wide web. The method comprises a step of, for a first file, in a display area displaying a first region. Then, according to a first distance scale, displaying one or more second regions, which respectively represent one or more second files logically related to the first file, for example by hyperlinks. The second regions are spatially related in, a display to the first region. In (n−1) further steps, i=2, . . . , n, the method displays according to an i-th distance scale smaller than the (i−1)-th distance scale one or more (i+l)-th regions. Each of these (i+l)-th regions respectively represent one or more (i+l)-th files which are logically related to the i-th file, and they are spatially related on a display to the i-th region representing that i-th file. | 08-12-2010 |
| 20100318520 | SYSTEM AND METHOD FOR PROCESSING COMMENTARY THAT IS RELATED TO CONTENT - A system and method for processing commentary that is related to content is provided. In an illustrative embodiment, the system and method involves receiving commentary that is related to content and which is generated after generation of the content, and generating data associating the commentary with the content by at least one of spatially linking the commentary to the content or temporally linking the commentary to the content. | 12-16-2010 |
| 20100318521 | METHOD AND/OR SYSTEM FOR TAGGING TREES - Embodiments of methods and/or systems for tagging trees are disclosed. | 12-16-2010 |
| 20110055220 | GREENHOUSE GAS GRID AND TRACKING SYSTEM - A method and computer system for reporting on a target greenhouse gas within a geographical boundary of an offset project by compiling policy parameters for the target greenhouse gas and generating a science plan for monitoring the target greenhouse gas for the target geographical boundary of the offset project, based upon the compiled policy parameters. An allometric model for the target greenhouse gas within the geographical boundary of the offset project is generated based upon the science plan of the target greenhouse gas for the geographic boundary, and a report for the target greenhouse gas within the target geographical boundary of the offset project is generated based upon the allometric model. | 03-03-2011 |
| 20110145256 | VIDEO PROCESSING SYSTEM PROVIDING OVERLAY OF SELECTED GEOSPATIALLY-TAGGED METADATA RELATING TO A GEOLOCATION OUTSIDE VIEWABLE AREA AND RELATED METHODS - A video processing system may include a display, at least one geospatial database, and a video processor. The video processor may cooperate with the display and the at least one geospatial database and be configured to display a georeferenced video feed on the display and defining a viewable area, and to overlay selected geospatially-tagged metadata onto the viewable area and relating to a geolocation outside the viewable area. | 06-16-2011 |
| 20110145257 | VIDEO PROCESSING SYSTEM GENERATING CORRECTED GEOSPATIAL METADATA FOR A PLURALITY OF GEOREFERENCED VIDEO FEEDS AND RELATED METHODS - A video processing system may include a video ingest module for receiving a plurality of georeferenced video feeds each including a sequence of video frames and initial geospatial metadata associated therewith, and each georeferenced video feed having a respective different geospatial accuracy level associated therewith. The system may further include a video processor coupled to the video ingest module and configured to perform image registration among the plurality of georeferenced video feeds, and generate corrected geospatial metadata for at least one of the georeferenced video feeds based upon the initial geospatial metadata, the image registration and the different geospatial accuracy levels. | 06-16-2011 |
| 20110161328 | SPATIAL DATA CARTRIDGE FOR EVENT PROCESSING SYSTEMS - Techniques for extending the capabilities of an event processing system to support the processing of spatial data. In one set of embodiments, this extensibility can be provided via a plug-in extension component referred to herein as a spatial data cartridge. The spatial data cartridge can enable the event processing system to support spatial data types (e.g., point, polygon, etc.) and various operations related to such data types (e.g., proximity determinations, overlap determinations, etc.). The spatial data cartridge can also define an indexing scheme that can be integrated with the capabilities of the event processing system to support the indexing of spatial data. Using the spatial data cartridge, the event processing system can operate on spatial data even if spatial data formats are not natively supported by the system. | 06-30-2011 |
| 20110191350 | METHOD AND SYSTEM FOR CONCENTRATION DETECTION - A method and system for concentration detection. The method for concentration detection comprises the steps of extracting temporal features from brain signals; classifying the extracted temporal features using a classifier to give a score x | 08-04-2011 |
| 20110208745 | MOBILE AUTONOMOUS UPDATING OF GIS MAPS - An apparatus for mobile autonomous updating of GIS maps is provided, comprising an autonomous mobile data collecting platform with a map identifying one or more GIS features. The platform has at least one data collecting sensor for collecting data for at least one of the GIS features and patrols at least a portion of a region included in the map while updating its GIS position as it patrols. The autonomous mobile data collecting platform applies the at least one data collecting sensor during patrolling to collect data for at least one of the GIS features and updates the GIS map to reflect differential data collected for at least one GIS feature. | 08-25-2011 |
| 20110219009 | METHOD OF GENERATING AN ELEVATION DATABASE - A method of generating an elevation database for selected geographic regions, the method comprising: receiving a location database, a rule database, and an input elevation database, each location in the location database being located within a selected geographic region; constructing, for each location in the location database and using rules from the rule database, a bounding region enclosing a continuous geographic region; applying elevation data from the input elevation database to each bounding region; and compressing the elevation data in each bounding region to provide compressed elevation data; wherein, upon decompressing the compressed elevation data, each point in each bounding region represents a level of elevation at that point in the associated selected geographic region. | 09-08-2011 |
| 20110246478 | NAVIGATION SYSTEM WITH INDEXED TERM SEARCHING AND METHOD OF OPERATION THEREOF - A method of operation of a navigation system includes: preconstructing an inverted term index having a nested spatial index of at least one location; providing a search term and a search range for searching the inverted term index; locating the search term in the inverted term index and having the nested spatial index bounded by the search range; and retrieving a location record linked to the nested spatial index and associated with the search term and the search range for displaying on a device. | 10-06-2011 |
| 20110246479 | Creating Indexes for Databases - An index is created for a database by selecting at least one column of a database table as a basis to create the index, generating at least one index of a tree structure according to the at least one column, where a pointer stored in a leaf node of the at least one index is null. In an example embodiment, a value to a pointer is stored in a leaf node according to an intermediate result in response to the intermediate result being generated, where the pointer stored in the leaf node points to a data page storing the intermediate result. The created index can be reused and the intermediate result can be effectively used, such that the efficiency of database operation is improved. | 10-06-2011 |
| 20110264667 | COLUMN-ORIENTED STORAGE IN A ROW-ORIENTED DATABASE MANAGEMENT SYSTEM - Systems, methods, and computer-readable storage media are provided for column-oriented storage in a row-oriented database management system. Data may be provided in one or more columns, each datum associated with a position within a column. A list may be created of one or more records per column, each record including a plurality of values stored in an order of position within the column and a first positional indicator. An index may be created to access a value stored in a record, wherein the index includes an index parameter derived from each record in the list and the index parameters are ordered in accordance with an order of records in the list. | 10-27-2011 |
| 20110307492 | MULTI-REGION CLUSTER REPRESENTATION OF TABLES OF CONTENTS FOR A VOLUME - A method and a system are provided for generating a multi-region cluster of tables of contents for a volume (e.g., album, a movie, a CD, a DVD, and/or a Blu-ray Disc). A multi-region cluster may be used to identify a volume efficiently despite natural variations found in different tables of contents for a volume. A multi-region cluster provides an effective representation of at least two tables of contents, preferably multiple tables of contents. A multi-region cluster is preferably substantially less data than the sum of all the tables of contents from user devices. The condensed data of a multi-region cluster allows data associated with the volume to be analyzed (e.g., searched, organized and/or located) in a substantially faster and more accurate manner. During a search process, the use of multi-region clusters tends to reduce the number of false positives. A false positive means the system incorrectly matches a table of contents to a volume (e.g., album, a movie, a CD, a DVD, and/or a Blu-ray Disc). | 12-15-2011 |
| 20110314027 | INDEX BUILDING, QUERYING METHOD, DEVICE, AND SYSTEM FOR DISTRIBUTED COLUMNAR DATABASE - An index building, querying method, device and system for distributed columnar database are provided. The index building method for distributed columnar database includes: obtaining a column field from a distributed columnar database, generating a column index file in which the column field is a key word, the column index file comprising the mapping relationship between the value of the column field in the distributed columnar database and the corresponding Row field value; storing the column index file to a index catalogue corresponding to the column field in the distributed columnar database. | 12-22-2011 |
| 20120011127 | DATABASE MANAGEMENT METHOD AND DATABASE SERVER SYSTEM USING THE SAME - A method and apparatus to manage a database in which a data file and an index file are efficiently disposed include generating a table space in such a way that a region of a database in which data in a table form is stored is allocated to a first storage device, and a region of the database in which index information used to search for the data is stored is allocated to a second storage device, storing the data in table form in the first storage device and the index information in the second storage device according to the table space, and storing the data in the database or searching the database according to an input query. | 01-12-2012 |
| 20120023106 | MAP INFORMATION PROCESSING APPARATUS, MAP INFORMATION PROCESSING METHOD, MAP INFORMATION PROCESSING PROGRAM, AND RECORDING MEDIUM - There are provided a map information processing apparatus, a map information processing method, a map information processing program and a recording medium, which provide house-contour data with valuable information such as address information and the like in an effective manner and with a high degree of accuracy, while remarkably minimizing time and cost as required. | 01-26-2012 |
| 20120030214 | Facilitating Object Searches in Virtual Worlds - A mechanism is provided for facilitating object search in a virtual world environment where each object is defined by a plurality of attributes and the search is performed on any attributes of the object however is not limited to a 3-D search. The co-ordinate location of each object in the virtual world is also provided in the search result and the range within which to perform the search may also be specified. Optionally, the user has the ability to teleport/transport to the location of the object using the search result. | 02-02-2012 |
| 20120096008 | HYPERSPACE INDEX - A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes small parameter pattern records. Each parameter pattern record corresponds to an identifier corresponding to a parameter pattern. If the record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first field. Each of the additional fields includes identifiers for a subset of information in the first field. The absence of an identifier corresponding to a parameter pattern at any level in all of the hierarchical threads indicates that the parameter pattern is not present. | 04-19-2012 |
| 20120131010 | TECHNIQUES TO DETECT VIDEO COPIES - Some embodiments include a video copy detection approach based on speeded up robust features (SURF) trajectory building, local sensitive hash (LSH) indexing, and spatial-temporal-scale registration. First, interesting points' trajectories are extracted by SURF. Next, an efficient voting based spatial-temporal-scale registration approach is applied to estimate the optimal transformation parameters (shift and scale) and achieve the final video copy detection results by propagations of video segments in both spatial-temporal and scale directions. To speed up the detection speed, local sensitive hash (LSH) indexing is used to index trajectories for fast queries of candidate trajectories. | 05-24-2012 |
| 20120136874 | TECHNIQUES FOR ORGANIZING SINGLE OR MULTI-COLUMN TEMPORAL DATA IN R-TREE SPATIAL INDEXES - Techniques for organizing single or multi-column temporal data into R-tree spatial indexes are provided. Temporal data for single or multiple column data, within a database system, is converted into one or more line segments. The resulting line segments are transformed into a minimum bounding rectangle (MBR). Finally, the MBR is inserted into an R-tree spatial index. | 05-31-2012 |
| 20120166446 | INDEXING SPATIAL DATA WITH A QUADTREE INDEX HAVING COST-BASED QUERY DECOMPOSITION - Approaches for indexing and retrieving spatial data with a quadtree index in database management systems are described. In an embodiment, data objects are stored without decomposition within a linearized quadtree stored within a B-tree index. In another embodiment, a method determines an optimal execution plan for a spatial query by parsing it to determine a query type and geometry object associated with the query. The method tessellates the query object by recursively decomposing the quadtree blocks that cover it. Cost-based decomposition decisions are made by consulting a cost model furnished by the database management system to minimize the cost of the resulting index range plan on the B-tree storage. Thus, data-directed query decomposition enacted by the method results in the optimal cost index range plan for the current data distribution and system context. In another embodiment, a system identifies and displays an optimal index range plan in a user interface. | 06-28-2012 |
| 20120179690 | RAPID, SPATIAL-DATA VIEWING AND MANIPULATING INCLUDING DATA PARTITION AND INDEXING - A high-density, distance-measuring laser system and an associated computer that processes the data collected by the laser system. The computer determines a data partition structure and stores that structure as a header file for the scan before data is collected. As the scan progresses, the computer collects data points until a predetermined threshold is met, at which point a block of data consisting of the data points up to the threshold is written to disk. The computer indexes each data block using all three coordinates of its constituent data points using, preferably, a flexible index, such as an R-tree. When a data block is completely filled, it is written to disk preferably with its index and, as a result, each data block is ready for access and manipulation virtually immediately after having been collected. Also, each data block can be independently manipulated and read from disk. | 07-12-2012 |
| 20120197900 | SYSTEMS AND METHODS FOR SEARCH TIME TREE INDEXES - A system and method for searching a time tree index for a database table, where the index uses time representations. A request for data is received, the request comprising a search value. A search date value is derived. The search date value comprises at least one time unit selected in order from a largest time unit to a smallest time unit from the list: century, year, month, date, hour, minute, second and millisecond. A time tree index is searched for at least one node, such that the index path to the node comprises the search date. At least one data record associated with the node is retrieved. | 08-02-2012 |
| 20120271833 | HYBRID NEIGHBORHOOD GRAPH SEARCH FOR SCALABLE VISUAL INDEXING - A hybrid search method may be used to identify information responsive to a query. A search may be performed utilizing a neighborhood graph and a partitioning tree. The partitioning tree may be searched to select one or more pivots that may be used to guide a subsequent search in the neighborhood graph. Once the search in the neighborhood graph is unable to identify nearest neighbors in closer proximity to the query, the search may be switched to the partitioning tree. The partitioning tree may then be searched to select pivots that may be used to guide subsequent searches in the neighborhood graph. The searches performed in the partitioning tree and/or the neighborhood graph may be conducted utilizing an iterative algorithm. | 10-25-2012 |
| 20120278335 | Systems and Methods for a Cache-Sensitive Index Using Partial Keys - Systems and methods are disclosed for a cache-sensitive index that uses fixed-size partial keys. The index may include a node comprising a child group pointer, a number of partial keys and a similar number of full-key pointers. The node may also include a record count. The nodes are organized into groups. The groups may contain a number of nodes one greater than the number of partial keys in a node and the nodes in a group may be stored contiguously in memory. The child group pointer and the number of partial keys may fit within a cache line. A method is disclosed for traversing the index, for bulk-loading the index, and for live deletion of records from the index. | 11-01-2012 |
| 20120284280 | SPACE-TIME-NODE ENGINE SIGNAL STRUCTURE - Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented using one or more computing devices or platforms to facilitate or otherwise support one or more processes or operations associated with a space-time-node engine signal structure. | 11-08-2012 |
| 20120284281 | String And Methods of Generating Strings - A system for generating a string based upon a plurality of places and a relationship between two or more of those places. Of the plurality of places used in any given string, at least one of the places does not have associated entity related information (e.g., business hours, description of services, etc.). The strings represent an authentic user experience of a quality, character, and/or feel intended by the string author. The user experience can be further enhanced or guided through a narrative accompanying the string or places, written by the string author, that describes or invokes the quality, character or feel of the experience intended by the author. | 11-08-2012 |
| 20120330967 | Descriptor storage and searches of k-dimensional trees - Various arrangements for using a k-dimensional tree for a search are presented. A plurality of descriptors may be stored. Each of the plurality of descriptors stored is linked with a first number of stored dimensions. The search may be performed using the k-dimensional tree for one or more query descriptors that at least approximately match one or more of the plurality of descriptors linked with the first number of stored dimensions. The k-dimensional tree may be built using the plurality of descriptors wherein each of the plurality of descriptors is linked with a second number of dimensions when the k-dimensional tree is built. The second number of dimensions may be a greater number of dimensions than the first number of stored dimensions. | 12-27-2012 |
| 20130066880 | METHOD FOR SEARCHING OBJECTS IN A DATABASE - The invention provides a method for searching objects in a database by means of an index data structure which associates object attribute values to collections of spatial elements—such as tiles of a quadtree or cuboids of an octtree—defined to partition a space, herein a predefined number of spatial elements being combinable to a next-level spatial element. The method comprising: searching the index data structure for a first input search pattern and, if the first input search pattern is associated to a first collection of spatial elements through the index data structure, including all spatial elements from the first collection into a first candidate set of spatial elements, wherein, if the number of spatial elements in the first candidate set exceeds a predetermined maximum, some or all of the spatial elements are combined to a reduced number of next-level spatial elements; searching the index data structure for a second input search pattern and, if the second input search pattern is associated to a second collection of spatial elements through the index data structure, including all spatial elements from the second collection into a second candidate set of spatial elements, wherein, if the number of spatial elements in the second candidate set exceeds a predetermined maximum, some or all of the spatial elements are combined to a reduced number of next-level spatial elements; forming, from of the first candidate set and the second candidate set, a combined candidate set of spatial elements; and searching, in the combined candidate set of spatial elements, for objects that match the first input search pattern and the input second search pattern to obtain a set of result objects. | 03-14-2013 |
| 20130066881 | INDEXING SYSTEM OF SPATIAL INFORMATION FOR COMBINED SOI OBJECT AND CONTENT - One aspect of the invention provides an indexing system of space of interest (SOI) defining at least a two-dimensional object. The system includes: a location data extractor configured calculate an index point for the space of interest; a map tile number converter configured to map the index point to a tile that lies within a plurality of tiles; and an indexer configured to index the space of interest based on the determined tile. | 03-14-2013 |
| 20130073560 | Facilitating Object Searches in Virtual Worlds - A mechanism is provided for facilitating object search in a virtual world environment where each object is defined by a plurality of attributes and the search is performed on any attributes of the object however is not limited to a 3-D search. The co-ordinate location of each object in the virtual world is also provided in the search result and the range within which to perform the search may also be specified. Optionally, the user has the ability to teleport/transport to the location of the object using the search result. | 03-21-2013 |
| 20130080443 | MULTI-SCALE SEGMENTATION AND PARTIAL MATCHING 3D MODELS - A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models. | 03-28-2013 |
| 20130086072 | METHOD AND SYSTEM FOR EXTRACTING AND CLASSIFYING GEOLOCATION INFORMATION UTILIZING ELECTRONIC SOCIAL MEDIA - Methods, systems and processor-readable media for extracting and classifying location information utilizing social media messages and/or data thereof. The social media messages can be sampled from a social media database and the messages filtered based on a heuristic rule. A geolocation entity from the unstructured social media messages can be extracted utilizing a geolocation entity extracting module. The messages with the geoentities can be uploaded onto a crowd sourcing platform to manually annotate the messages with a label. A text classification model can be built and learned from the label utilizing a machine learning algorithm and the messages can be classified by a location classifier in order to extract the user location. The user location can then be transformed into a geocode so that a spatial search can be enabled and the distance between the locations can be easily calculated. | 04-04-2013 |
| 20130132396 | METHOD FOR GENERATING LOCATION TARGETED, KEYWORD-TRIGGERED, ADS AND GENERATING USER RECALLABLE LAYER-BASED ADS - Location-specific content is automatically generated for a particular entity having a plurality of physical locations. Database entries that contain identifying data associated with the particular entity are searched for to obtain location information of each of the plurality of physical locations. The location information, in correlation with one or more keywords associated with the particular entity, is stored in a computer-readable electronic database such that a user-generated query that includes at least one of the keywords and a search location causes a processor to execute operations that initiates a search of the computer-readable electronic database for the location information of the physical locations that are in proximity to the search location. At least one result that is displayable to the user is provided. | 05-23-2013 |
| 20130173632 | METHOD AND APPARATUS FOR PREDICTING OBJECT PROPERTIES AND EVENTS USING SIMILARITY-BASED INFORMATION RETRIEVAL AND MODELING - Method and apparatus for predicting properties of a target object comprise application of a search manager for analyzing parameters of a plurality of databases for a plurality of objects, the databases comprising an electrical, electromagnetic, acoustic and thermal spectral database (ESD), a micro-body assemblage database (MAD) and a database of image data whereby the databases store data objects containing identifying features, source information and information on site properties and context including time and frequency varying data. The method comprises application of multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes and to predict further properties of objects by means of k-means clustering and related methods. By way of example, an evidence tree display showing a target object linked by a pathway to a predicted property comprises a similarity value, a speculation value and a model-based rank. | 07-04-2013 |
| 20130290346 | Geographic Information System (GIS) with Linked GIS Objects and GIS Operation - A geographic information system (GIS) includes a created link between GIS objects in the database of the geographic information system (GIS), and performed GIS operations. The linked GIS object and performed GIS operation provides a mechanism to more easily identify the impact of making an update to a GIS database. A database association is maintained between GIS object identifiers and the requesting GIS operation to enable a reverse trace back from the nature of the GIS operation to the GIS object involved. | 10-31-2013 |
| 20130304746 | RETRIEVING INDEXED DATA FROM A DISPERSED STORAGE NETWORK - A method begins by a dispersed storage (DS) processing module traversing multiple index structures based on search criteria to identify an object retrieval structure. The method continues with the DS processing module retrieving a set of encoded data slices corresponding to the object retrieval structure from a dispersed storage network (DSN) and decoding the set of encoded data slices in accordance with a dispersed storage error coding function to recover the object retrieval structure. The method continues with the DS processing module identifying one of one or more data version records of the recovered object retrieval structure based on the search criteria to produce an identified data version record and determining DSN addressing information for at least a portion of data based on information of the identified data version record. | 11-14-2013 |
| 20130325874 | Columnwise Storage of Point Data - A database query of point data among two or more axes of a database is received. The database stores point data in distinct integer vectors with a shared dictionary. Thereafter, the dictionary is scanned to determine boundaries for each axis specified by the query. In response, results characterizing data responsive to the query within the determined boundaries for each axis are returned. Related apparatus, systems, techniques and articles are also described. | 12-05-2013 |
| 20130339370 | Apparatus and Method for Executing Different Query Language Queries on Tree Structured Data Using Pre-Computed Indices of Selective Document Paths - A method of operating a tree structured database includes receiving a document, forming a top-down tree characterizing the document, generating pre-computed indices characterizing the document, combining subsets of the pre-computed indices to dynamically create a table of information characterizing the document, and resolving a structured query language query against the table to form collected data. | 12-19-2013 |
| 20130339371 | SPATIO-TEMPORAL DATA MANAGEMENT SYSTEM, SPATIO-TEMPORAL DATA MANAGEMENT METHOD, AND PROGRAM THEREOF - It is provided a spatio-temporal data management system for managing time series data associated with a spatio-temporal region, comprising: a processor for executing a program; a memory for storing the program; and a storage device for storing the time series data. The processor segments the spatio-temporal region in time and space to generate a plurality of spatio-temporal segments, assigns, in consideration of temporal and spatial proximity of the plurality of spatio-temporal segments, identifiers for uniquely identifying the plurality of spatio-temporal segments, each of the identifiers being expressed with a one-dimensional integer value; and determines an arrangement of the time series data so that pieces of data of spatio-temporal segments that are close in the assigned identifiers are arranged close on the storage device. | 12-19-2013 |
| 20130346418 | Columnwise Spatial Aggregation - A spatial aggregation query of a database is processed by receiving data specifying a maximum bounded rectangle for point data responsive to the query and specifying one or more grid partitions of the maximum bounded rectangle (in which at least one of the partitions is partially aggregated. Thereafter, for each partition, a number of points responsive to the query in each partition and a center of gravity of the points in each partition is computed. Data characterizing the corresponding computed number of points and center of gravity is then provided (e.g., persisted, loaded, transmitted, displayed, etc.). Related apparatus, systems, techniques and articles are also described. | 12-26-2013 |
| 20140012858 | DATA PROCESSING METHOD, DATA QUERY METHOD IN A DATABASE, AND CORRESPONDING DEVICE - A data processing method, data query method in a database, and corresponding device. A data processing, wherein a query request for data records includes information indicating a source and destination IP address, the source IP address including N sections, the destination IP address including M sections, both M and N being positive integers, the method including: determining an index encoding manner for the database, wherein the index is an one-dimensional index including N+M sections, the encoding manner specifying a variation sequence of various sections for the index, at least one of the source IP address and the destination address indicated by the information contained in the possible query request including at least one section having a wildcard character, wherein according to the index, for any possible query requests, successive data records can be obtained as a query result; according to the encoding manner, establishing the index for the data records. | 01-09-2014 |
| 20140032568 | System and Method for Indexing Streams Containing Unstructured Text Data - A system, method and computer readable medium for indexing streaming data. Data may be received from distributed devices connected via a network. Data elements may be stored and allocated to data blocks and events of the block stores. Non-text data may be converted into a text representation. The data may be split into terms, and term frequencies of each term within each of the event may be calculated. Block-level term frequency statics may be calculated based on the term frequencies. Tree index structures, such as the Y-tree index, may be generated based on the block-level term frequency data. The Y-tree index structures may use the terms as keys and pointers to the corresponding data blocks and block-level term frequency data. A search query may be performed over the tree index structures. | 01-30-2014 |
| 20140074853 | METHOD AND SYSTEM FOR PROVIDING STATISTICAL FROM A DATA WAREHOUSE - The invention relates to a method for providing statistical data from a data warehouse ( | 03-13-2014 |
| 20140074854 | SCALABLE RENDERING OF LARGE SPATIAL DATABASES - Aspects of the invention provide a service for data management and integration across a wide range of applications. Clustered computers may be arranged in a cloud-type configuration for storing and handling large amounts of user data under the control of a front-end management server. Communities of distributed users may collaborate on the data across multiple enterprises. Very large tabular data files are uploaded to the storage facilities. The data files are maintained as tables, and a composite table of related information is created and maintained in response to user queries. Different ways of visualizing the data are provided. Depending on the amount of information that can be displayed, features in a spatial index may the thinned for presentation. Spatial and structured queries are processing and results are intersected to obtain information for display. | 03-13-2014 |
| 20140081985 | EFFICIENTLY FINDING SPATIALLY SCORED BEST ENTITIES - In one embodiment, a particular number of best entities are found in a database with a spatial index that satisfy both spatial criteria and entity filtering criteria. For each of a set of targets in the spatial index whose bounding box meets the spatial criteria, a spatial score is calculated. If the spatial score is less than a minimum spatial score in a current map of best entities and the current map is full, the target is excluded from further consideration. If the spatial score is not less than the minimum spatial score, when the target is an entity that meets the entity filtering criteria, the current map is updated to store the entity and the spatial score for the entity. When each of the targets in the spatial index has been subject to test or excluded from consideration, the current map is returned as a final result. | 03-20-2014 |
| 20140108419 | METHOD FOR EFFICIENTLY QUERYING MULTIPLE POINTS IN AN INDEXED QUADTREE - A method for efficiently querying multiple points in an indexed quadtree is disclosed. The elevation along a path containing points covered by nodes in a quadtree is desired. Index nodes covering the nodes with elevation data are retrieved. Based on the data in the index nodes, the highest resolution data is retrieved while limiting database lookups below a specified limit. | 04-17-2014 |
| 20140136545 | Multi-tier Indexing Methodology for Scalable Mobile Device Data Collection - A mobile device indexing system includes a plurality of edge nodes in communication with each other across a communication network and a plurality of mobile devices configured to communicate with the edge nodes. Each mobile device has both computing and communication functionalities. A separate mobile device index is maintained at each one of the plurality of edge nodes. Each mobile device index is a geographical spatio-temporal index having entries for a unique set of mobile devices derived from the plurality of mobile devices. Each unique set contains only mobile devices registered to the edge node associated with that mobile device index. | 05-15-2014 |
| 20140156672 | SPACE-TIME-NODAL TYPE SIGNAL PROCESSING - Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented using one or more computing devices or platforms to facilitate or otherwise support one or more processes or operations associated with a space-time-node engine signal processing. | 06-05-2014 |
| 20140164389 | MINING TRAJECTORY FOR SPATIAL TEMPORAL ANALYTICS - Embodiments relate to generating a trajectory heat map at an aggregated level using computed transit points is provided. An aspect includes generating, by a processing device, a trajectory database from time-stamped global positioning system (GPS) sample points. According to exemplary embodiments, transit points are computed for each trajectory in the trajectory database. A temporal transit graph is constructed from the transit points. The transit graph of embodiments captures the shortest paths among these transit points. The transit graph is then indexed and stored in a spatial-temporal database for online analytic processing. | 06-12-2014 |
| 20140164390 | MINING TRAJECTORY FOR SPATIAL TEMPORAL ANALYTICS - Embodiments relate to generating a trajectory heat map at an aggregated level using computed transit points is provided. An aspect includes generating, by a processing device, a trajectory database from time-stamped global positioning system (GPS) sample points. According to exemplary embodiments, transit points are computed for each trajectory in the trajectory database. A temporal transit graph is constructed from the transit points. The transit graph of embodiments captures the shortest paths among these transit points. The transit graph is then indexed and stored in a spatial-temporal database for online analytic processing. | 06-12-2014 |
| 20140222828 | Columnwise Storage of Point Data - A database query of point data among two or more axes of a database is received. The database stores point data in distinct integer vectors with a shared dictionary. Thereafter, the dictionary is scanned to determine boundaries for each axis specified by the query. In response, results characterizing data responsive to the query within the determined boundaries for each axis are returned. Related apparatus, systems, techniques and articles are also described. | 08-07-2014 |
| 20140244657 | DYNAMIC GRAPH SYSTEM FOR A SEMANTIC DATABASE - A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix. | 08-28-2014 |
| 20140280199 | System and Method for Determining and Maintaining Object Location and Status - An asset information management system is provided for obtaining and storing information on assets disposed within a structural environment. The system comprises at least one mobile interface device for capturing information about a target object in the structural environment. An information management operating system operates on a central processor in communication with the mobile interface device and a local positioning system. The domain coordinate management system comprises one or more computers configured for establishing spatial addresses for spaces and points within the structural environment. The asset log comprises one or more data storage modules configured for storing information associated with objects disposed within the structural environment. The spatial indexing engine is configured for assigning a spatial address to the target object and for storing information associated with the target object in the asset log. | 09-18-2014 |
| 20140330838 | Content Distribution - The distribution of content items, such as news items, is dependent in part upon the geographic relevance of the content item and the geographic community to which the target reader belongs. The geographic relevance of content items is determined and compared to a geographic profile for the reader at the distribution target. Where the function of geographic relevance exceeds a predetermined threshold, the content item is delivered to the target. As a result the reader is presented with content items that are more closely relevant to his geographic profile and desired interest threshold. | 11-06-2014 |
| 20140365500 | FAST, SCALABLE DICTIONARY CONSTRUCTION AND MAINTENANCE - A computer-implemented method of constructing and maintaining a record keeping dictionary data structure can include: generating a PATRICIA trie from a set of strings; generating multiple kth-level elevator-stairs data structures at exponentially reducing k-levels, wherein each of the kth-level elevator-stairs data structure includes a kth-level trie corresponding to the PATRICIA trie and wherein nodes of the kth-level trie at string depths of integer multiples of k are accessible through hash table links; and linking nodes in neighboring kth-level tries of the multiple kth-level elevator-stairs data structures where the nodes represent a same node in the PATRICIA trie. | 12-11-2014 |
| 20150012544 | INDEX SCAN DEVICE AND INDEX SCAN METHOD - The index scan device acquires information on a search space in a multi-dimensional space corresponding to a search range of a query, or information on a partial search space in this search space; sets, as a search point, a data point corresponding to at least one of a minimum and a maximum of values obtained by changing each data point in the multi-dimensional space to be one-dimensional, from among data points contained in the search space or the partial search space; identifies, in the index storage unit, index data associated with a partial space containing the search point; estimates a boundary line passing through the search space or the partial search space on the basis of identification information on the partial space obtained from the identified index data; and determines, from among divided search spaces obtained by dividing the search space or the partial search space by the estimated boundary line, a divided search space excluding the partial space containing the search point as the partial search space. | 01-08-2015 |
| 20150026190 | GEO-LOCATION CUSTOM INDEXES - Apparatuses, systems, and methods for generating and utilizing custom indexes for a plurality of geo-locations are described. A plurality of indexes are generated, each corresponding to one of a plurality of geo-locations, based on spatial area subdivisions of a space including the plurality of geo-locations. A points of interest (POIs) query is received, wherein results of the query are to be limited by a distance value. One or more geo-locations are identified as POIs within the distance value from a first geo-location of the plurality of geo-locations based on the corresponding indexes of the one or more identified geo-locations. | 01-22-2015 |
| 20150052149 | METHOD AND SYSTEM FOR CROSS-REFERENCING AND DEDUPLICATING OBJECTS IN MULTIPLE MAP BUILDING BLOCKS - A system and method for providing a digital map database wherein multiple instances of geocoded objects pertaining to points of interest (POI) and/or three-dimensional (3D) objects contained within one or more building blocks are compared to find undesirable duplicate geocoded objects. Cross-referencing information is stored and preference information about which geocoded object or object property/attribute should be used is assessed to determine priority for selection or presentation on the display screen of a navigation device or other suitable computing device. Cross-references can be pre-calculated at compile time or calculated on-the-fly by the navigation application at run time and may be persistently stored in dedicated data structures. When duplicate geocoded objects are found, only the most accurate information or a super set of (attribute) information is used by applications or presented to a user thereby preventing confusion. | 02-19-2015 |
| 20150058354 | SYSTEM AND METHODS FOR STORING AND ANALYZING GEOGRAPHICALLY-REFERENCED DATA - Embodiments of a system and method for storing and analyzing geographically-referenced data are generally described herein. In some embodiments, the system includes one or more computing devices to generate an index value for geographically referenced data. The index value may be representative of a geographic location corresponding to the geographically-referenced data. The system may also include one or more storage devices configured to store the geographically-referenced data and the index value such that the geographically-referenced data is stored contiguously with other geographically-referenced data of the geographic location based on the index value. | 02-26-2015 |
| 20150081719 | Parallel Spatio Temporal Indexing for High-Update Workloads and Query Processing - Disclosed herein are system, method, and computer program product embodiments for providing a spatio-temporal index for high-update workloads and query processing. An embodiment operates by a first thread retrieving an update record from a first queue, the update record comprising a location component and a temporal component indicating a location of one of a plurality of mobile devices at a specified time, and updating a columnar-store database with the update record. The embodiment further operates by a second thread identifying a spatial grid of a spatial temporal index within a memory corresponding to the location component of the update record, and updating a temporal index of the spatial grid based on the temporal component of the update record. | 03-19-2015 |
| 20150106381 | LOADING DATA WITH COMPLEX RELATIONSHIPS - Data to be loaded into a target system includes entities having corresponding unique primary data value and secondary data values. The secondary data values have associated foreign key relationships, which links the secondary data value to the primary data value of another entity. In loading the data, the entities are split into insertion leaf groups by execution of an iteration process, each iteration involving generation of a respective set of insertion leaf groups containing entities whose secondary data values have no foreign key relationships or only foreign key relationships with the primary data values of entities of the insertion leaf groups generated during any prior iteration. The iteration process is executed until there are no such entities are left. A sequence of generation of the sets of insertion leaf groups is recorded, and the sets of insertion leaf groups are consecutively loaded into the target system according to the sequence. | 04-16-2015 |
| 20150142822 | METHOD AND APPARATUS FOR PROVIDING CROWD-SOURCED GEOCODING - An approach is provided for providing crowd-sourced location geocoding. A geocoding platform determines one or more location strings associated with at least one event, wherein the at least one event is associated with one or more users. The geocoding platform further causes, at least in part, a geocoding of the one or more location strings to determine location information associated with the at least one event based, at least in part, on one or more inputs, contextual information, a combination thereof associated with the one or more users. | 05-21-2015 |
| 20150149479 | Lidar Model With Hybrid-Columnar Format and No Indexes for Spatial Searches - A method and apparatus for querying a database table containing point spatial data and without indexes is provided. A request for point spatial data in the table includes a query window provided by the user and describing an area of interest in which the user desires the point spatial data contained therein. The query window is tiled to create interior tiles and boundary tiles. A first query is formed to determine the point spatial data contained in the interior tiles. A second query is formed to determine the point spatial data contained within the boundary tiles and also within the query window. The second query includes a function that tests to determine whether the point spatial data within a boundary tile also lies within the query window. The first and second queries are executed in part on an enhanced data storage device and the results joined and returned to the user in answer to the request. | 05-28-2015 |
| 20150293961 | DATABASE-DRIVEN ENTITY FRAMEWORK FOR INTERNET OF THINGS - Unified and normalized management of an object within a structured data store on any machine and/or across difference machines. In an embodiment, a first agent accesses a first request dataset representing a two-dimensional structure. Each row in the request dataset comprises an identification of an agent, a statement, an identification of a resource to execute the statement, and one of a plurality of request types. Each row in the request dataset is processed according to the identification of the agent in the row. When the identified agent is the first agent, the request type of the row is accessed, and one or more elements in the row are processed based on the request type. When the identified agent is not the first agent, the row is sent within a second request dataset to the identified agent (which may be on a different machine than the first agent) for processing. | 10-15-2015 |
| 20150317334 | SPARSE DATATABLE DATA STRUCTURE - A sparse dataset structure is created by creating column vectors for one or more columns in a dataset that have at least one significant value. Each column vector includes data values for columns of the dataset. Each column vector that is a sparse column vector includes a look-up index array and a value array. Entries in the look-up index array represent columns. The value array includes values for a row in a column. Each entry in the value array points to a row entry in the look-up index array. A side structure includes a row index and a column index. The row index includes a location for an entry for each row where entries point to a location in the column index that identifies a column that has a first significant entry for a row. Alternatively a sparse dataset could be constructed with sparse rows. | 11-05-2015 |
| 20150347457 | AUTOMATIC UPDATE FOR MAP CACHE - Systems, methods, and other embodiments associated with automatically updating a map cache are described. In one embodiment, a method includes detecting a modification to a spatial database record having a geometry attribute and recording, in a log table, an identifier for the record that was modified. The method includes periodically accessing the log table to identify map tiles that include at least one geometry of records that have been modified and periodically generating the identified map tiles. The generated map tiles are stored in a map cache. | 12-03-2015 |
| 20150347478 | SYSTEMS AND METHODS FOR CONTEXT-AWARE AND PERSONALIZED ACCESS TO VISUALIZATIONS OF ROAD EVENTS - The present disclosure is directed to systems and methods for context-aware and personalized access to data corresponding to an event. The data is related to multiple predefined parameters including a location, date, time, and a classifier representing a status or an impact intensity for the event. The method includes receiving the data and an event type for the data. The event type is selected from multiple predefined event types. The method also includes creating a hierarchical data structure configured to spatially index the data based on the selected event type. The hierarchical data structure includes a node representing the selected event type. The node is augmented using a linked list for referring to the data to be stored in a database. The node is associated with a frequency of occurrence of the selected event type. | 12-03-2015 |
| 20150347479 | STORING AND QUERYING MULTIDIMENSIONAL DATA USING FIRST AND SECOND INDICIES - The present disclosure relates to methods and systems for storing and querying data. According to the embodiments of the present invention, two-layer indexes are created for multi-dimension data, wherein the primary index is created based on two or more dimensions to retrieve respective data units of the data, while the secondary index is created based on specific dimensions to retrieve respective data blocks in the data unit. Correspondingly, when receiving a multi-dimension query request for data, the primary retrieval first determines a data unit including the target data based on a primary index, and then the secondary retrieval quickly locates a data block including the target data based on the secondary index. In this way, the multi-dimension retrieval can be efficiently performed. Moreover, by appropriately setting the size of a smallest data block, the I/O efficiency of data access will be significantly enhanced. | 12-03-2015 |
| 20150347480 | Process and Framework For Facilitating Data Sharing Using a Distributed Hypergraph - A knowledge model “overlay” for organizing and analyzing large, dynamic data volumes is implemented as a hypergraph that manifests as a result of a distributed theory-driven data source transformation process. This process maps exponentially growing data into an asymptotically limited information space. Within this space, real-world entities (e.g. people, computers, cities, Earth) and their complex interdependencies (e.g. social networks, connectivity, causal relationships) are represented as attributed hypergraph elements (i.e. both hypervertices and hyperedges). Attributes are represented as state vectors affixed to any hypergraph element. Transformation of source system data into this overlay structure is accomplished with minimal data movement and replication using a universal “pointer” like mechanism that is managed in a decentralized fashion by the respective transformation components. Access to the knowledge overlay is performed via a hypergraph communication protocol encapsulated within a common hypergraph API and accompanying hypergraph toolkit. | 12-03-2015 |
| 20150347481 | STORING AND QUERYING MULTIDIMENSIONAL DATA USING FIRST AND SECOND INDICIES - The present disclosure relates to methods and systems for storing and querying data. According to the embodiments of the present invention, two-layer indexes are created for multi-dimension data, wherein the primary index is created based on two or more dimensions to retrieve respective data units of the data, while the secondary index is created based on specific dimensions to retrieve respective data blocks in the data unit. Correspondingly, when receiving a multi-dimension query request for data, the primary retrieval first determines a data unit including the target data based on a primary index, and then the secondary retrieval quickly locates a data block including the target data based on the secondary index. In this way, the multi-dimension retrieval can be efficiently performed. Moreover, by appropriately setting the size of a smallest data block, the I/O efficiency of data access will be significantly enhanced. | 12-03-2015 |
| 20150347485 | GENERATING A MAPPING RULE FOR CONVERTING RELATIONAL DATA INTO RDF FORMAT DATA - A method for generating a mapping rule for converting relational data into RDF format data includes obtaining a first mapping rule for converting relational data in a first relational database into RDF format data, wherein a URI pattern of the first mapping rule expresses features of the relational data in the first relational database; parsing a generated rule for the URI pattern of the first mapping rule; determining that a second relational model of the second relational database and a first relational model of the first relational database conform to pattern matching; and generating a second mapping rule for converting the relational data of the second relational database into RDF format data, based on a mapping relationship between the generated rule and the pattern matching of the first relational model and the second relational model. | 12-03-2015 |
| 20150356126 | FEDERATED SOCIAL MEDIA ANALYSIS SYSTEM AND METHOD THEREOF - Embodiments of the present invention disclose a system and method for federated social media analysis. According to one embodiment, aggregating social data from a plurality of social media sources is aggregated and stored in a federated social media database. The aggregated social data is then analyzed to determine content correlations. Furthermore, an application interface is provided for accessing the content correlations associated with the aggregated social media data. | 12-10-2015 |
| 20150363446 | System and Method for Indexing Streams Containing Unstructured Text Data - A system, method and computer readable medium for indexing streaming data. Data may be received from distributed devices connected via a network. Data elements may be stored and allocated to data blocks and events of the block stores. Non-text data may be converted into a text representation. The data may be split into terms, and term frequencies of each term within each of the event may be calculated. Block-level term frequency statics may be calculated based on the term frequencies. Tree index structures, such as the Y-tree index, may be generated based on the block-level term frequency data. The Y-tree index structures may use the terms as keys and pointers to the corresponding data blocks and block-level term frequency data. A search query may be performed over the tree index structures. | 12-17-2015 |
| 20150363449 | Refining location estimates and reverse Geocoding based on a user profile - The present invention pertains to enhancement or refinement of estimated locations based upon user-specific information. Upon user authorization, geographical information is extracted from a number of user-related sources, including the web browser history, search history, maps history, address book, e-mail archives and calendar entries. Such information is used to build a spatial index of specific physical locations for a geocoded result set. From this, heat maps identifying particular locations from the user-related sources are created for different periods of time. The heat maps may be used to refine an initial location estimate of the user. This may be done by determining whether one or more positions in a given heat map provide a more accurate position of the user than the initial estimate. If so, a best position is selected. This can be used to provide enhanced driving directions to the user. | 12-17-2015 |
| 20150363508 | GRID-BASED ANALYSIS OF GEOSPATIAL TRAJECTORIES - Described herein is a framework for analyzing geospatial trajectory data. In accordance with one aspect, a grid model of a geographical area of interest is generated in response to a user event. The grid model includes a grid having a plurality of rows and columns of cells, in which the cells may be identified by unique cell numbers. Geospatial trajectory data of users may be mapped to the cells in the grid to generate mapped data with unique cell numbers associated to the geospatial trajectory data. The mapped data may further be analyzed to identify cell transitions based on the mapped data. Identifying the cell transitions includes determining cell density sequences and cell dwell-time sequences of the users. The cell density and cell dwell-time sequences may further be analyzed to perform a similarity analysis. Results of the similarity analysis may be presented to the end-user device of a user. | 12-17-2015 |
| 20150370823 | Method and Apparatus to Enable Finer-Grained, Scalable Allocation of Storage in a Data Storage System - In one aspect, the invention is directed to a method of expanding storage for filesystems in a fine-grained, scalable manner. The method includes determining, by a file server, a run bias for a span, wherein the run bias indicates a number of contiguous chunks of memory associated with an entry in an address translation table for a filesystem. The method includes receiving, by the file server, a request for an expansion of memory for the filesystem. The method includes scoring, by the chunk allocator, each stripe set in a group of stripe sets based at least in part on a number of unused chunks on the stripeset and a number of chunks on the stripeset being used by the filesystem. The method includes allocating, by the chunk allocator, a chunk on the stripeset with the highest score, wherein the allocated chunk lies outside of runs reserved for other filesystems. | 12-24-2015 |
| 20150379028 | Shared Geo-Located Objects - A method of reviewing geo-coded information at a geographic information system is disclosed. The method may include receiving information identifying a geo-located object from a submitter of the object, receiving information identifying the location of the geo-located object from the submitter, and receiving a request from a user of the geographic information system for one or more geo-located objects that includes the submitted geo-located object, and transmitting information for permitting display of the geo-located object to the user of the geographic information system. | 12-31-2015 |
| 20160004738 | SYSTEMS AND METHODS OF GENERATING A NAVIGABLE, EDITABLE MEDIA MAP - Libraries containing numerous media items such as movies, music, and still images can be difficult to organize in a meaningful and accessible way. To more efficiently and aesthetically organize media items in a library, media maps are generated from hierarchical trees. The media maps are displayed to a user via a user display device. The user can quickly navigate through the media maps to discover connections and similarities between media items previously unknown to the user. The user can further make changes to the media map by interacting with the media map via a user interface. The media map is then re-generated to reflect the changes made by the user. The user can thus personalize the automatically generated media map to reflect his own media preferences and opinions. | 01-07-2016 |
| 20160004739 | Column Store Optimization Using Simplex Store - Using index clusters to approximate coordinate values for vertices of compressed simplexes of a spatial data set, valid subspaces can be identified and used to identify other simplexes that may intersect a first simplex. Such approaches can be used for filtering, refining, etc. analysis of intersections between areas, lines, volumes, etc. within spatial data sets. | 01-07-2016 |
| 20160019290 | State Tracking Over Machine-Learned Relational Trees in a Dialog System - A method is provided for representing and updating the state of a dialog involving a series of queries and commands to an artificial intelligence system. Each statement within the dialogue may be modeled as a relational tree spanning nodes corresponding to named entities within the statement. A data structure may be used to store each of these trees and to modify them as the dialog progresses. A subsequent statement in the dialog may be parsed and its contents used to update an ongoing search initiated within that dialog. Statements may be used for the update process despite being fragmentary or not corresponding to any predetermined grammar. An algorithm is disclosed for updating the trees within the data structure after a new statement is parsed. | 01-21-2016 |
| 20160019667 | APPARATUS AND METHOD FOR PERFORMING SOCIAL WORK - A social work plan development apparatus stores client needs profiles as vectors P in a database, receives a query that includes client attribute data that is based on a primary issue and/or need of a client, and characterizes the client attribute data as an A vector. The A vector is then correlated with the P vectors stored in the database to determine the magnitude of correlation between the A vector and the P vectors with respect to the query through a vector overlap process. The magnitude of correlation between the A vector and the P vectors is used to determine the root cause of the issue and/or need that the client is facing. Goals and/or treatments addressing the root cause of the issue and/or need are determined, and client progress toward accomplishing the goals and/or treatments within a predetermined time is evaluated. | 01-21-2016 |
| 20160026649 | EFFICIENT ALLOCATION OF NUMBERS IN A NON-CONTIGUOUS LIST USING GAP VALUES - A method and system for efficient allocation of numbers in a non-contiguous list using gap values are disclosed. A server system receives a request for one or more numbers. The server system loads an original list of previously allocated numbers into an indexed data structure. The server system generates gap values for the original list of previously allocated numbers in the indexed data structure. The server system uses the original list of previously allocated numbers as an initial current number list and determines whether there are one or more available numbers between a lowest number in the current number list and a highest number in the current number list based on the gap value. The server system then transmits one or more identified available numbers to the requesting system. | 01-28-2016 |
| 20160034598 | GRAPH-BASED SYSTEM AND METHOD OF INFORMATION STORAGE AND RETRIEVAL - Structure of a resultant Every Document as a Graph (EVG) graph may be outlined using an EVG query. First metadata for a first data source may be retrieved. At least one entity key may be determined for a first entity, the entity key coming directly from the EVG query or from an entity on a preceding level of the EVG graph. Based on the first metadata and entity key, an edge may be created in the EVG graph beginning at the first entity, wherein the edge contains information retrieved from the first data source. Second metadata for a second data source may be retrieved. Based on the second metadata and information contained in the edge retrieved from first data source, a second entity may be created in the EVG graph, wherein the edge connects to the second entity, wherein the second entity contains information retrieved from the second data source. | 02-04-2016 |
| 20160078074 | METHOD OF SPATIAL STORAGE OF AN OBJECT BY MEANS OF A FLEXIBLE HIERARCHICAL STRUCTURE, AND A NON-TRANSIENT STORAGE MEDIUM - The present technology describes a method of determining the spatial storage of an object by means of a flexible hierarchical structure containing a set of element of an n-tree. The method comprises: obtaining from the computer memory an object for placement in one of the set of elements of the n-tree; determining the most suitable element of the n-tree for the placement of the object; determining if the boundary of the object goes beyond the boundaries of the most suitable element of the n-tree; if the boundary of the object goes beyond the boundaries of the most suitable element of the n-tree, determining of the boundary of the most suitable element of the n-tree that will be intersected by a portion of the object when the object is placed in this most appropriate element of the n-tree; increasing the size of the most suitable element of the n-tree by adding to it a zone of presence of the object, the boundary of the zone of presence of the object being distant from the boundary of the most suitable element of the n-tree by the maximum value of the projection of the object beyond the boundaries of the most suitable element of the n-tree. | 03-17-2016 |
| 20160078075 | SCALABLE SELECTION MANAGEMENT - Architecture for handling large data selections with small and substantially constant memory footprints. The architecture facilitates the creation of sets of data objects (e.g., rows) of a data source based on selection of the data objects. The set structures can be defined according to a range (span) of data objects selected and a pattern of the objects selected. These set structures are then saved in memory, rather than the data objects, to provide optimized memory usage. In a database implementation, the solution stores the set representation (the structure) in nearly a constant amount of memory, regardless of the number of rows in the grid, and regardless of the number of rows selected. Memory usage can be proportional to the number of discontinuous spans of rows selected by the user. Structures in memory can be consolidated, replaced, or eliminated dynamically as the user changes row selections and pattern criteria. | 03-17-2016 |
| 20160125007 | METHOD OF FINDING COMMON SUBSEQUENCES IN A SET OF TWO OR MORE COMPONENT SEQUENCES - A method of finding common subsequences in a set of two or more component sequences. The method includes obtaining two or more component sequences and identifying the location(s) of one or more distinct items that occur at least once within each of the two or more component sequences. The method also includes placing the location(s) within each component sequence of each commonly-occurring distinct item in a location n-tuple and storing each location n-tuple in a location n-tuple container. The method further includes sorting the entries in the location n-tuple container and placing each of the location n-tuples in the location n-tuple container into a tier in a tier set. The method additionally includes obtaining any desired information regarding common subsequences. | 05-05-2016 |
| 20160132539 | FAST SEARCHING USING MULTIDIMENSIONAL INDEXING - A method and apparatus for performing relatively fast record searching is provided. The design includes providing one alphanumeric key to any record of a plurality of records not including an alphanumeric key, providing one text description comprising at least one word to any record of the plurality of records not including a text description having at least one word, and establishing a multidimensional index, where for each record there is provided in the multidimensional index a keyword pointer pointing from each keyword to one associated record, a text description pointer pointing from each text description the one associated record, a first reverse word index pointer pointing from each word to one keyword, and a second reverse word index pointer pointing from each word to one text description. Records are searched using the multidimensional index. | 05-12-2016 |
| 20160140153 | PROCESSING SPATIOTEMPORAL DATA RECORDS - A method for processing a primary data record, a spatial tree index and a plurality of time tree indexes is described. The method includes writing the primary data record to a primary data table, determining whether a spatial tree leaf node including location data exists and, if not, generating a spatial tree leaf node including the location data, and creating or updating spatial tree nodes connecting the spatial tree leaf node to a spatial tree root node. For spatial tree nodes including the location data, updating a respective time tree index by determining whether a time tree leaf node including time data exists and, if not, generating a time tree leaf node including the time data, and creating or updating time tree nodes connecting the time tree leaf node to a time tree root node. The time tree leaf node updated to include a pointer to the primary data record. | 05-19-2016 |
| 20160140154 | INDEXING HIERARCHICAL DATA - A system includes generation of an encoding for each of a hierarchy of nodes, each of the nodes associated with one or more attributes, and the encoding for each node including a first pointer and a second pointer, and generation of an order tree comprising a hierarchy of entries, where each pointer of the encoding points to a respective one of the entries, wherein the encoding and the order tree indicate a position of each node in the hierarchy of nodes. | 05-19-2016 |
| 20160171027 | FAST AND ACCURATE GEOMAPPING | 06-16-2016 |
| 20160171036 | ITEM RECOMMENDATION METHOD AND APPARATUS | 06-16-2016 |
| 20160179980 | ASSIGNING GLOBAL EDGE IDS FOR EVOLVING GRAPHS | 06-23-2016 |
| 20160196309 | RANGE QUERY METHODS AND APPARATUS | 07-07-2016 |
| 20160203136 | Methods, Systems, and Product for Hashing Using Twisted Tabulation | 07-14-2016 |
| 20160203173 | INDEXING METHODS AND SYSTEMS FOR SPATIAL DATA OBJECTS | 07-14-2016 |
| 20190146961 | DERIVATION OF HIERARCHY INDEXES | 05-16-2019 |
