Abstract: Systems, methods and a graphical user interface are provided for enhancing a computing navigation device route directions view. A system is disclosed including a computing navigation device configured to identify a route for travel. The route includes one or more geographic locations along the route. The computing navigation device is further configured to receive media from a media service via a computer network, wherein each media includes associated geographic information indicating that the media relates to the one or more geographic locations. The computing navigation device is further configured to display the media in a route directions view of a graphical user interface.

Abstract: 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.

Abstract: A covariance matrix associated for a set of spatial and/or temporal sub-portions of a media object is populated based on a lookup table of relative displacements and sums of covariance values generated from pairs of data elements in the media object. The lookup table is generated in linear time, providing an efficient method of generating the covariance matrix.

Abstract: The invention generally relates to enabling the management of survey data. One embodiment includes providing an upload description that describes characteristics of survey data to be uploaded, assigning a thread to process a group of files that store aspects of the survey data, dividing the file into data chunks, deriving from a given data chunk a corresponding data-integrity value and respectively associating the same with the given data chunk, communicating the data chunks to a remote storage device, utilizing the corresponding data-integrity values to ensure successful communication of the data chunk, and spatially storing the survey data such that it is retrievable upon a request that describes a geographic area of interest.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for “house for sale” in a specific area will be directed to web pages that meet the geographic and content search terms.

Abstract: 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.

Abstract: 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.

Abstract: Embodiments of the present invention provide mechanisms that overcome limitations of existing indexes by creating two-dimensional (2D) spatial indexes to quickly locate data containers that match two or more predicates. This is accomplished by representing metadata attributes describing a data container as dimensions in a 2D space so that a data container can be expressed as a point or a cell in a 2D space with coordinates being a pair of values of the selected attributes. A space filling curve is used to traverse the 2D space and convert each pair of the 2D coordinates to a single space filling curve value. A 2D spatial index is then created based on the computed space filling curve values so that one value can be associated with one or more points (data containers) in the index. Advantageously, the created spatial index provides for searching and processing fewer metadata entries, thereby decreasing the time typically used to search for data.

Abstract: A method, computer program, database system and data structure for indexing spatial objects are disclosed. Each spatial object has a location in an n-dimensional space. The indexing is for use in a partitioned parallel environment including P partitions. Each partition resides on one or more parallel processing systems. The n-dimensional space is divided into quad-tree cells (QTCs) in a quad-tree structure. Each spatial object is assigned to one or more QTCs based on the location of the spatial object in the n-dimensional space. A spatial object index entry is created which includes a designator for the QTC to which the spatial object is assigned and a pointer to the spatial object. The entries are sorted by their QTC numbers into a list. The list of entries is divided into P substantially equal parts. The entries associated with each part are stored in a different one of the P partitions.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: The present invention relies on the two-dimensional information in documents and encodes two-dimensional structures into a one-dimensional synthetic language such that two-dimensional documents can be searched at text search speed. The system comprises: an indexing module, a retrieval module, an encoder, a quantization module, a retrieval engine and a control module coupled by a bus. A number of electronic documents are first indexed by the indexing module and stored as a synthetic text library. The retrieval module then converts and input image to synthetic text and searches for matches to the synthetic text in the synthetic text library. The matches can be in turn used to retrieve the corresponding electronic documents. It should be noted that a plurality of matches and corresponding electronic documents may be retrieves ranked by order according the similarity of the synthetic text.

Abstract: The present invention provides a system and method for height based indexing of data. In an embodiment, the present invention parses indexed data by (1) storing a geo-spatial multi-resolution data structure that represents a three dimensional environment, where at least a portion of the three dimensional environment lies within a view frustum; (2) traversing recursively the geo-spatial multi-resolution data structure, where the traversal is based on a range of coordinates that lie within the view frustum; and (3) extracting the indexed data from at least one vertical slice of at least one node of the geo-spatial multi-resolution data structure, where the extracted indexed data is displayed in the view frustum.

Abstract: 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.

Abstract: In certain embodiments, a method for locating an electronic graphics file stored in a database includes extracting from an electronic graphics file, the electronic graphics file including a first and a second header, the first header of the electronic graphics file being searchable, information corresponding to electronic graphics file annotations stored in the second header of the electronic graphics file. The method further includes storing at least a portion of the extracted information corresponding to electronic graphics file annotations in the first header of the electronic graphics file to form an annotations-searchable version of the electronic graphics file, the annotations-searchable version of the electronic graphics file being searchable according to at least a portion of the information corresponding to electronic graphics file annotations stored in the first header of the electronic graphics file.

Abstract: A storage method and a search method for mark events on two-dimensional space are provided. First, an event and a corresponding coordinate thereof are retrieved. Next, calculation on the coordinate of the event is performed to generate an index representing a bucket position in a storage device. Next, whether or not there is any existing search tree stored in the bucket position is judged, and then the event is inserted into a linked list of a node of the search tree stored in the bucket position according to a judgment result. Besides, when a range on the two-dimensional space is designated, corresponding nodes in the search tree are rapidly accessed according to the index obtained by a hash function, and further by application of pointers pointing to the bucket position having the search tree stored therein and by real-time return of search result, the search speed is high.

Abstract: Systems, methods, and other embodiments associated with registering a WFS feature type are described. One example method includes creating a feature instance table and a set of collection item tables to register the WFS feature type. Elements in the feature instance table and a collection item table may be related by a feature instance primary key value. The example method may also include producing an r-tree based spatial index for spatial content collection items stored in the set of collection item tables. The method may also include selectively processing a WFS request to manipulate (e.g., insert, delete, update) a WFS feature instance based, at least in part, on the feature instance table and the set of collection item tables. The method may also include selectively processing a WFS query associated with a WFS feature instance based, at least in part, on the r-tree based spatial index.

Abstract: Systems, methods, and other embodiments associated with spatial query processing using query window indexes are described. One example method includes receiving a spatial query on spatial data that has an associated spatial data index. The spatial query specifies a query window. A query window index structure is constructed that describes a geometry of the query window. The query window index structure is compared to the spatial data index and, when necessary, to the spatial data to determine a spatial relationship between the query window and the spatial data.

Abstract: 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.

Abstract: 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.

Abstract: A system for provisioning content to at least one user is described. A content provisioning server is used. The content provisioning server includes a content provisioning application in communication with a user database. The content provisioning application is configured to access the user database to identify a user, determine rights of the user from the user database, and send a user interface to a client computing device that provides user interface items corresponding to the rights and associated links of the user.

Abstract: 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.

Abstract: Systems, methods, and other embodiments associated with logically expanding a document and determining the relevance of the logically expanded document to a query are described. One method embodiment includes searching an index to locate a document identifier for a document in which a query term appears. The method includes determining whether the index entry includes an expansion identifier, and, if so, producing a logically expanded document. The logically expanded document may include both a document associated with the document identifier and a document associated with the expansion identifier. The method may then determine a relevance value of the logically expanded document with respect to the query and may provide a signal corresponding to the relevance value.

Abstract: 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.

Abstract: 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).

Abstract: A system and method for aligning multilingual content and indexing multilingual documents, to a computer readable data storage medium having stored thereon computer code means for indexing multilingual documents, to a system for presenting multilingual content. The method for aligning multilingual content and indexing multilingual documents comprises the steps of generating multiple bilingual terminology databases, wherein each bilingual terminology database associates respective terms in a pivot language with one or more terms in another language; and combining the multiple bilingual terminology databases to form a multilingual terminology database, wherein the multilingual terminology database associates terms in different languages via the pivot language terms.

Abstract: A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way that facilitates efficient search and browsing.

Abstract: An indexing system uses a graph-like data structure that clusters features indexes together. The minimum atomic value in the data structure is represented as a leaf node which is either a single feature index or a sequence of two or more feature indexes when a minimum sequence length is imposed. Root nodes are formed as clustered collections of leaf nodes and/or other root nodes. Context nodes are formed from root nodes that are associated with content that is being indexed. Links between a root node and other nodes each include a sequence order value that is used to maintain the sequencing order for feature indexes relative to the root node. The collection of nodes forms a graph-like data structure, where each context node is indexed according to the sequenced pattern of feature indexes. Clusters can be split, merged, and promoted to increase the efficiency in searching the data structure.

Abstract: A system is disclosed for customizing a geographic location index based on user preferences. The system obtains geographic data provided by a user and generates a customized geographic region based on the obtained geographic data. The system generates relationship data corresponding to the new customized geographic region. The system updates the geographic location index based on the new customized geographic region and corresponding relationship data. Thereafter, on-line content may be delivered to an audience associated with the new customized geographic region, thereby allowing the user, such as an advertiser or publisher, to define targeting regions that are optimal to their specific business environment.

Abstract: 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.

Abstract: An improved system and method for classifying tags of content using a hyperlinked corpus of classified web pages is provided. An anchor text index may be searched to find anchor texts that may match text of the tag, documents referenced by the matching anchor texts may be found, and the documents referenced by the matching anchor texts may be grouped to disambiguate multiple classifications that result from matching the anchor texts with the categories of the reference documents. To resolve ambiguity between multiple classifications, weighted classifications may be used where each document may be assigned a positive weight for a mapping to a category to indicate the confidence of the classification of the document to the category. The classification for the grouping of the documents referenced by the matching anchor texts with greatest frequency may be selected and output as the classification for the tag.

Abstract: 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.

Abstract: 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.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to structured content storage and provide a novel and non-obvious method, system and computer program product for managing structured content stored in a BLOB. In an embodiment of the invention, a performance optimized structured content management system can include a content repository, a content manager configured to provide access to structured content in the content repository and multiple different performance optimized containers disposed in the content repository. Each of the containers can store a portion of the structured content, and each of the containers can include a flattened form of original structured content in a primary binary large object (BLOB) and a parsed form of the original structured content in a secondary BLOB, the parsed form of the original structured content in the secondary BLOB indexing the flattened form of the original structured content in the primary BLOB.

Abstract: A method and system for generating a hybrid index for indexing objects based on location and keyword attributes and performing location-based searching is provided. A search system performs a location-based search using a hybrid index that indexes both location and keyword attributes of objects. The search system generates the hybrid index either using the location attribute as the primary index or the keyword attribute as the primary index. When the location attribute is the primary index, the keyword attribute is the secondary index, and vice versa. To generate the hybrid index, the search system identifies the values for the keyword and location attributes of each object. The search system generates the primary index to map each value of a first attribute to a secondary index. The search system thus generates, for each value of the first attribute, a secondary index to map values of a second attribute to objects that have the associated values of the first and second attributes.

Abstract: 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.

Abstract: 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.

Abstract: Under one aspect, an interface program stored on a computer-readable medium causes a computer system with a display device to perform the functions of: accepting search criteria from a user, the search criteria including a domain identifier identifying a domain and a free text query entry; in response to accepting said search criteria from the user, receiving a set of document-location tuples from a corpus of documents, wherein each document: (a) contains information that is responsive to the free text query entry; and (b) contains location-related information that refers to a location within the domain; requesting and receiving a result from an additional query based at least in part on the domain identifier, the result not being a document-location tuple; and displaying a visual representation of at least a subset of the document-location tuples and a visual representation of the result of the additional query on the display device.

Abstract: 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.

Abstract: 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 x1; extracting spectral-spatial features from brain signals; selecting spectral-spatial features containing discriminative information between concentration and non-concentration states from the set of extracted spectral-spatial features; classifying the selected spectral-spatial features using a classifier to give a score x2; combining the scores x1 and x2 to give a single score and determining if the subject is in a concentration state based on the single score.

Abstract: A disclosed embodiment relates to a system for populating an index table. The system comprises a component that decomposes a spatial object into a set of object pairs, a component that employs a value associated with the object pairs to sort the set of object pairs into a sequence of object pairs, a component that uses a sliding border analysis to create a subset of the sequence of object pairs depending upon a position of the object pair in the sequence of object pairs, and a component that populates the index table with the subset of object pairs.

Abstract: Methods and apparatus provide for a local search indexer to allow for an optimized search within a web server that returns accurate search results while maintaining independent control as to defining search patterns, search prioritization, and updated content available for search. Specifically, the local search indexer organizes content according to a hierarchical directory structure at a web server. The hierarchical directory structure includes at least one directory level that provides at least one directory for storing the content. The local search indexer builds a search index associated with the directory and stores the search index at the web server. The search index is populated with indexed content based on an update of the content stored in the directory. The local search indexer employs a search engine, at the web server, to process search queries against the indexed content to provide a search result that includes the update of the content.

Abstract: In accordance with a method of encoding meta-data associated with tree-structured data, a first set of elements of a plurality of elements in the tree-structured is associated explicitly with explicit meta-data levels, and a second set of elements of the plurality of elements is associated by inheritance with explicit meta-data levels of closest ancestor elements of the first set of elements. The plurality of elements is packed into a plurality of leaf nodes of an index structure. The plurality of leaf nodes is merged into a plurality of non-leaf nodes until a root non-leaf node is generated. The plurality of non-leaf nodes of the index structure is associated with indicators representing ranges of the explicit meta-data levels in the packed first set of elements, such that explicit meta-data level ranges of descendant non-leaf nodes are subsets of explicit meta-data level ranges of ancestor non-leaf nodes.

Abstract: 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.