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.

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

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

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

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: 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: The invention relates to a method for providing statistical data from a data warehouse (410) involving one or more data storage means and one or more processor coupled to the data storage means characterized in that it comprises the steps of: defining a plurality of index fields (114) each index field accepting a plurality of index field values; creating a plurality of indexed files (432) and hierarchically indexing the files as trees of indexes (300) which includes, for each tree, the steps of: hierarchically ordering the index fields (201); defining bins, each bin being associated to an index field and gathering one or more index field values for that index field; creating indexes by concatenating one or more bins in compliance with the hierarchy of hierarchically ordered index fields to form a sequence of bins, an index comprising only one bin per index field; hierarchically indexing the files as trees of indexes (300), each index having zero or more children indexes or and having at most one parent index,

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

Abstract: Techniques are described for generating histograms for a multidimensional space. In the presence of large spatial objects, fuzzy splitting techniques are utilized to recursively divide the multidimensional space into partitions, where a single spatial object may belong to multiple partitions. Large spatial objects are essentially broken down into smaller objects that may allow for more efficient partitioning of the multidimensional space. A count of spatial objects in each partition yields a spatial histogram. A spatial object that belongs to multiple partitions may have a weighted count for each of the multiple partitions, based on the extent to which the spatial object overlaps with each partition. Thus, an object that is split among a handful of partitions will only contribute a fraction of a count to each partition. Small partitions having relatively few objects are avoided by refusing to subdivide a partition whose members drop below a threshold number.

Abstract: A image processing apparatus extracts a plurality of feature points, comprising a local feature amount, from an inputted image, and a region information that relates to the feature point, identifies at least one of the plurality of feature points, associates the feature point thus identified with a feature point with a high relational degree between the feature point thus identified and a region that is denoted by the region information of the feature point thus identified, and registers the feature point thus identified and associated as an index of the inputted image.

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

Abstract: The method and system of the present invention provides an improved technique for integrated asset management. Information is aggregated from a variety of sources into a centralized computerized database. Thereafter, asset transition events are scheduled. Information from the centralized computerized database is used in the performance of the asset transition events and information relating to the asset transition events is added to the centralized computerized database. Subsequent changes to the asset are also recorded into the centralized computerized database. As a result, a plethora of information is available within said database for the purpose of managing future asset transition events.

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

Abstract: Images are processed by extracting a number of small, fixed size pixel arrays, here called tiles. The image is thus represented as a collection of small parts in almost cookie cutter fashion. For storage, the tile data are added to a database and indexed for fast recall. Stored images can be rescaled, possibly rotated, and inserted again for more robustness. A sample image for recall is likewise processed, the extracted tiles serving as keys to find their stored counterparts. The original image can thus be recognized from even a small portion of the original image, if the sample offers enough tiles for lookup. The invention includes an image collection module, an image processing module, a storage module, a recall module and an interactive module by which a user can query a sample image or sub-image against the stored information.

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

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

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: 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: Systems and methods are provided for retrieving data relevant to a subject of interest. Occurrences of each of a plurality of n-grams within the data record are identified. A multinomial distribution is defined from the respective numbers of occurrence of a subset of the plurality of n-grams. The multinomial distribution is stored in a semantic model as a point on an information manifold. The semantic model is configured to represent an indexed family of probability distributions as points on the information manifold. It is determined if the data record is relevant to the subject of interest according to the position of the point on the information manifold, and the data record is retrieved if the data record is relevant to the subject of interest.

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

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: Systems and methods for utilizing affinity groups to allocate data items and computing resources are disclosed. Upon receipt of a user preference indicating an affinity group, a token associated with that affinity group may be stored in a database. The affinity group may be associated with a geographic region or a number of data centers. Data items and computing resources may be associated with the affinity group. These data items and computing resources may be allocated to a geographic region or data center based on their association with the affinity group. These data items and computing resources may also be reallocated based on efficiency analyses or user preferences. In this way, data items and computing resources may be efficiently allocated with lower user effort.

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

Abstract: Aspects of the invention relate generally to identifying and providing 3D models in response to a search request. More specifically, a server may access a database of 3D models, at least some of which include geolocation information such as an address, intersection, or geolocation coordinates. The server may select a particular model and identify points of interest. For example, the server may use detailed map information to identify points of interest located at or near the geolocation information associated with the particular model. Once a point of interest has been identified, a corresponding system tag may be generated and associated with the 3D model. Tags may be used to index, search, and retrieve 3D models in response to a search request. For example, when a request for a 3D model is received, the server identifies the search terms and searches the tags to identify relevant 3D models.

Abstract: A method of querying spatial events in a vehicle network includes receiving, by a processing device, a query condition of a user; in response to reception of the query condition of the user, determining context information of a position where the user locates; and according to the query condition of the user and the context information of the position where the user locates, querying an index table recording correspondence between terminal nodes of roads in a road map and spatial events to obtain spatial events meeting the query condition of the user.

Abstract: Range query techniques are disclosed for use in accordance with data stream processing systems. In one aspect of the invention, a technique is provided for indexing continual range queries for use in data stream processing. For example, a technique for use in processing a data stream comprises obtaining at least one range query to be associated with the data stream, and building a range query index based on the at least one range query using one or more virtual constructs such that the query index is adaptive to one or more changes in a distribution of range query sizes. The step/operation of building the range query index may further comprise building the range query index such that the range query index accommodates one or more changes in query positions outside a monitoring area of the at least one range query. In another aspect of the invention, a technique is provided for incrementally processing continual range queries against moving objects.

Abstract: A Searchable Symmetric Encryption (SSE) mechanism is described which allows efficient dynamic updating of encrypted index information. The encrypted index information includes pointer information that is encrypted using a malleable encryption scheme. The SSE mechanism updates the encrypted index information by modifying at least one instance of the pointer information without decrypting the pointer information, and thereby without revealing the nature of the changes being made. In one implementation, the SSE mechanism includes a main indexing structure and a deletion indexing structure. An updating operation involves patching applied to both the main indexing structure and deletion indexing structure.

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 he 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: A method performs a database query in a relational database, the query being carried out by a database engine and being based on user-defined search criteria. The method includes retrieving a number N of properties of a record within a main database table, the number N being higher than zero, creating a search criteria option for each of the N properties, creating a search criteria table for every search criteria option, creating an index for every search criteria table, and performing the database query based on a user-defined combination of a plurality of the search criteria options.

Abstract: The present invention relates to a sensor network managing apparatus and a method thereof. The sensor network managing apparatus according to the present invention receives a query that includes a spatial join predicate for searching for target sensor nodes and a comparison predicate that is different for each sensor network, and generates query execution order information for searching for the target sensor nodes based on the spatial join predicate and the comparison predicate, wherein the spatial join predicate is related to a spatial location between sensor nodes respectively included in different sensor networks, and the comparison predicate are related to sensing values of sensor nodes of the sensor networks. In addition, the sensor node managing apparatus executes queries for the spatial join predicate and the comparison predicate on the plurality of sensor nodes on the basis of determined query execution order, and then extracts target sensor nodes as the query results.

Abstract: A transactionally consistent indexer is a tiered middleware framework component that updates a transactional index for a data blob according to a data transaction requested by an application. The transactionally consistent indexer determines index entries to be added or removed from a transaction index based on the application request. The transactionally consistent indexer further inserts each index entry to be added into the transaction index. With respect to each index entry to be removed, the transactionally consistent indexer uses a time stamp or version number of the index entry for ensuring optimistic concurrency during deletion. The transactionally consistent indexer then updates a data blob that is associated with each index entry to be added or each index entry to be removed based on the application request.

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

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. Electronic documents are first indexed by the indexing module and stored as a synthetic text library. The retrieval module then converts an 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. In one or more embodiments, the present invention includes a method for comparing the synthetic text to documents that have been converted to synthetic text for a match.

Abstract: A computer readable storage medium includes a data analyzer to build population sets for dimensions of a multi-dimensional data source and to identify intersections of population sets so as to form density metadata. A query processor accesses the density metadata while processing a query.

Abstract: A system and method linking one or more disparate datasets with one or more spatial layers to create linked datasets. One or more data attributes common to the dataset and the spatial layer are identified, and the linkage is defined between the dataset and the spatial layer. The spatial layer and the linked data set then may be queried using a single input query. Features from the spatial layer and features from the linked dataset that match the query are generated for display.

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: Embodiments provide 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: 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: A method and system for automatically refining information extraction (IE) rules. A provenance graph for IE rules on a set of test documents is determined. The provenance graph indicates a sequence of evaluations of the IE rules that generates an output of each operator of the IE rules. Based on the provenance graph, high-level rule changes (HLCs) of the IE rules are determined. Low-level rule changes (LLCs) of the IE rules are determined to specify how to implement the HLCs. Each LLC specifies changing an operator's structure or inserting a new operator in between two operators. Based on how the LLCs affect the IE rules and previously received correct results of applying the rules on the test documents, a ranked list of the LLCs is determined. The IE rules are refined based on the ranked list.

Abstract: A computer performed method models a spatial index having n spatial regions defined in a multidimensional space using a tree-based model representing an infinite number of arrangements of n spatial regions in the multidimensional space allowable by the spatial index using a finite number of tree representations, computes an average retrieval complexity measure for content retrieval using the spatial index based on the tree based model, and provides a spatial index recommendation based on the average retrieval complexity measure. In some embodiments a spatial index selection module selects the spatial index based on average retrieval complexity measures for candidate spatial indices that are functionally dependent upon a number of spatial regions to be defined by the spatial index.

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

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

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

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

Abstract: One example method of spatial query processing using query window indexes 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 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.