Abstract: A method, apparatus, and computer implemented method for modeling a Big Data dataset, the method comprising creating non-specific representations of the Big Data dataset by representing, as objects in a computer model, non-specific representations including metaInformation, DataSet, BigData and Properties representations and creating non-specific representations of Properties, wherein at least one of the representations are selected from the group consisting of Analytical, size, volume, and structural.

Abstract: Techniques, systems, and articles of manufacture for voltage-based clustering to infer connectivity information in smart grids. A method includes clustering multiple voltage time series measurements into one or more groups, wherein said multiple voltage time series measurements are derived from one or more sensors; determining a connectivity model based on the one or more groups; comparing the determined connectivity model to an existing connectivity model to detect one or more inconsistencies between the determined connectivity model and the existing connectivity model; and updating the existing connectivity model based on said one or more detected inconsistencies.

Abstract: Various embodiments crowd source images to cover various angles, zoom levels, and elevations of objects and/or points of interest (POIs) while under various lighting conditions. The crowd sourced images are tagged or associated with a particular POI or geographic location and stored in a database for use by an augmented reality (AR) application to recognize objects appearing in a live view of a scene captured by at least one camera of a computing device. The more comprehensive the database, the more accurately an object or POI in the scene will be recognized and/or tracked by the AR application. Accordingly, the more accurately an object is recognized and tracked by the AR application, the more smoothly and continuous the content and movement transitions thereof can be presented to users in the live view.

Abstract: A single object system, method, and computer program product are provided for storing information associated with user interactions with a good or service. In use, a plurality of user interactions with one of a good and a service are received via a graphical user interface. Furthermore, information associated with the user interactions is stored in a single object.

Abstract: Methods, systems, and apparatus, including computer programs for receiving a set of content items, each content item including a time reference and digital content that is distributed using one or more computer-implemented services, for each content item: determining an event time based on a respective time reference, identifying one or more n-grams based on text of the content item, associating each of the one or more n-grams with the event time, and including the one or more n-grams in a superset of n-grams, the superset of n-grams including n-grams provided from one or more of the content items in the set of content items, generating one or more n-gram clusters based on the superset of n-grams, each n-gram cluster providing a description of an event and including at least one n-gram and an associated event time and storing each of the one or more n-gram clusters in a cluster database.

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

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

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

Abstract: Systems and methods are provided for file searching on mobile devices. A system includes a user interface and a file query system. The user interface is for receiving a user-provided spatio-temporal query for use in searching for a particular file. The user-provided spatio-temporal query is provided by a user of a mobile device. The file query system is for determining information about the particular file responsive to the user-provided spatio-temporal query, and identifying from the information one or more files as a search result for the particular file.

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

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

Abstract: Application developers can request to have their applications registered for use with a content delivery platform. The operator of the content delivery platform establishes perimeters defining geographic areas, and maintains records reserving particular areas for delivery of content associated with particular sponsors. Registered applications running on mobile devices can request content from the content delivery platform. Based at least in part on the request, the content delivery platform can identify a target location, which may be the location of the mobile device, or some other location indicated in the request. A mobile device can be provided content based on the relationship of the target location to the geographic areas, so that a registered application running on a mobile device with a target location contained within a geographic area assigned to a particular sponsor will receive content related to that sponsor.

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

Abstract: Systems and methods for efficiently processing electronically stored information (ESI) are described. The systems and methods describe processing ESI in preparation for, or association with, litigation. The invention preserves the contextual relationships among documents when processing and indexing data, allowing for increased precision and recall during data analytics.

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

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

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

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

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

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

Abstract: Techniques for indexing file paths of items in a content repository may include taking turns in querying each different item type or folder type in a round robin schedule to visit select nodes of the folder tree of that type to update and maintain the file path indexes. Item types or folder types may be associated with a count of instances or children of instances that are missing indexes. For each item type or folder type, a query may be performed for instances of the item type or folder type having children that are missing indexes, the instances or children of the instances returned may be associated with file path indexes, and the count of instances or children of instances may be adjusted based on the associating.

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

Abstract: A computer-implemented system is used for implementing an improved personal health record enrollment process. The system includes an electronic medical record system configured to generate configured to generate an index file, the index file associated with patient medical data including the clinical records of the patient, wherein the index file is augmented with encrypted metadata generated based on the patient medical data and configured to include patient authentication information. The system further includes a personal health record web portal configured to implement a patient enrollment process including the steps of receiving patient authentication input, authenticating the patient authentication input based on the received patient authentication input and the encrypted metadata in the index file, and generating a patient enrollment account for the patient based at least in part on the patient authentication information.

Abstract: A plurality of storage devices is organized into a physical volume called an aggregate, and the aggregate is organized into a global storage space, and a data block is resident on one of the storage devices of the plurality of storage devices. A plurality of virtual volumes is organized within the aggregate and the data block is allocated to a virtual volume. A physical volume block number (pvbn) is selected for the data block from a pvbn space of the aggregate, and virtual volume block number (vvbn) for the data block is selected from a vvbn space of the selected vvol. Both the selected pvbn and the selected vvbn are inserted in a parent block as block pointers to point to the allocated data block on the storage device.

Abstract: Techniques are provided for dynamic configuration of search parameters for multimedia fingerprint databases that use weak bits. A multimedia fingerprint database, which stores reference fingerprints and uses weak bits, is maintained. Maintaining the database includes dynamically configuring one or more of the following parameters: a fingerprint length of those portions of the reference fingerprints that are used to identify multimedia objects; an index length of the index used to index those portions of the reference fingerprints that are used to identify multimedia objects; a threshold that is used to determine whether multimedia objects are correctly identified; and a number of the weak bits in the reference fingerprints.

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

Abstract: A Universal Geographic Database (“UGD”) is provided that includes a real-time, automated registry/clearinghouse for the publication and retrieval of real-world locations and location-related information for businesses and other entities. By this registry, entities may publish their location and location-related information in a single place, and information services and their users can refer to this single place, via telecommunications devices, to obtain static, real-time location and location-based information about the registered locations. Each UGD record is keyed by a proprietary location address (PLA) based on the World Geographic Referencing System (WGRS). PLAs may be used as key reference and addressing terms, e.g., imbedded in digital documents, websites, GPS devices, or other information services to provide links to maps, directions, and information in the registry related to such locations.

Abstract: A system and method for managing geotag data associated with content within a geofeed is provided. The content may be tagged with metadata such as geotag data that may specify a location where the content was created. The generated content may be geotagged by one or more geotag sources including a GPS-enabled device, a user input, a content provider, a user profile, or other sources. The system may determine the geotag data for the content that is not already associated with geotag data. The system may determine a confidence level of the geotag data, whether already geotagged or not. The confidence level may be indicative of a likelihood that the geotag data accurately describes a location where the content was actually created.

Abstract: An information re-organization system includes a plurality of counters coordinated to meaning attributes, and a re-organization incentive notification unit that updates, in case the information stored in preset storage unit has been updated, value of a counter out of the multiple counters that has the meaning attribute associated with contents updated. The information re-organization system also includes an information re-organization processor that executes, in case the value of the counter section updated has met one of a number of predetermined conditions for information re-organization, a processing for information re-organization corresponding to the condition for information re-organization on the information stored in the preset storage unit.

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: Embodiments are directed to dynamically adapting metadata for use with a native data encoding and to efficiently modifying object model type references. In one scenario, a computer system instantiates a metadata reader over an object model description to access various portions of metadata in the object model description. The metadata reader is configured to read native metadata, where native metadata is metadata represented in an encoding that is expected by the metadata reader. The metadata reader determines that the accessed metadata is encoded in a non-native encoding and then determines which metadata modifications are to be performed to transform the non-native encoding into a native encoding. The computer system then dynamically adapts the metadata of the object model from a non-native encoding to a native encoding according to the determined modifications. As such, the object model is readable by a native runtime.

Abstract: A set of index keys is included in an index search system that are associated with the scope of the search rather than the content of the documents that are the target of the search. These scope related index keys, or scope keys allows the scope of the search to be selected, reducing the number of documents that a search is required to sift through to obtain results. Furthermore, compound scopes are recognized and stored such that an index of complex search scopes is provided to eliminate rehashing of the searches based on these complex search scopes.

Abstract: The embodiments provides a method for network-context based content positioning. The method includes receiving a plurality of parameters associated with content, and computing a content positioning relevance index for one or more node using the plurality of parameters. Further, the method includes positioning the content in the network based on the content positioning relevance index.

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

Abstract: Techniques for mapping a virtual R-Tree to an extensible-hash based file system for databases are provided. Spatial data is identified within an existing file system, which stores data for a database. Rows of the spatial data are organized into collections; each collection represents a virtual block. The virtual blocks are used to form an R-Tree spatial index that overlays an existing index for the database on the existing file system. Each row within its particular virtual block includes a pointer to its native storage location within the existing file system.

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

Abstract: Systems and methods for deleting non-key values from an index distributed over a plurality of computing devices maintains a non-key master list that includes the non-key values that are stored on each of the plurality of computing devices and receives a list of non-key values to delete. The systems and methods further intersect the list of non-key values to delete with the non-key master list, creating a first delete list for a first one of the plurality of computing devices that includes non-key values to be deleted that are stored on the first computing device. The systems and methods further transmit the first delete list to the first computing device and update the non-key master list based on the list of non-key values to delete.

Abstract: A method and apparatus for geo-spatial and social relationship analysis are disclosed. In one embodiment, a method of contacting a target member of a community includes obtaining a target location of the target member, obtaining a social path to the target member, determining an association between a node location of at least one node of the social path and the target location of the target member, generating a geo-spatial index that determines a geographic proximity each node is from the target member, and communicating with the target member using the at least one node of the social path based on the geographic proximity between each node and the target member. The method may include establishing a social link with the target member using the at least one node.

Abstract: Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described.

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

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: A method of conducting a collaborative event, comprising receives input from at least one participant computing device joined to the collaborative event, categorizing the input according to two or more categories defined within the collaborative event, and displaying the input according to the two or more categories.

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 geospatial object property assessment apparatus comprises a processing resource (102) arranged to support a geospatial object property processor (206) comprising a subject data source input (212) capable of receiving a first metadata associated with 10 quality of current source information content used to define a property (408) of a geospatial object; a resource data source input (214) capable of receiving a second metadata associated with quality of candidate resource information content for updating the definition of the property (408) of the geospatial object.

Abstract: A vehicle navigation system having an input device, a storage device, a processor, and an output device. The storage device stores a database of geographical locations, such as the names of states, cities, streets, or countries. The database has a data list that includes data sub-lists, where the data sub-lists may have one or more data sub-list elements. Each data sub-list may have an assigned unique name. The data sub-lists also may be divided into parts, such that each part is assigned a unique name. The processor is operative to index the data sub-lists or the parts of a divided data sub-list. The processor may be further operative to search the database for a data sub-list element given an input from a user, and the output device may output one or more data sub-list elements from the database based on the search performed by the processor.

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

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

Abstract: In one embodiment, a union of the bounding boxes is computed of entities in a relational database indexed by a spatial index, filtered according to some criteria. For each of a set of targets to be considered, a bounding box of the target is tested against a current range union result. If the bounding box is completely contained in the current range union result, the target is excluded from further consideration. Otherwise, the target is processed. When the target is an entity, it is determined whether the entity meets the entity filtering criteria. If so a union is computed and the current range union result updated. When each of the targets to be considered in the spatial index has been subject to test or excluded, the current range union result is returned as a final range union result.

Abstract: The present invention is embodied in an online-like transaction processing method and system for processing account information contained in batch process files, the method including: reading at least one batch file containing a plurality of records, each of the plurality of records being related to an associated one of a plurality of accounts; identifying which of the plurality of records relate to same ones of the plurality of accounts; identifying one of the accounts; and, processing all of the records identified as relating to the one of the accounts together and independent of processing any of the records relating to any other of the plurality of accounts.