Abstract: In some example embodiments, there may be provided a method including detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator.

Abstract: A method for pre-utilizing tables before refresh includes selecting a query for execution in a data analytics application and identifying a table specified by the query, for instance a materialized table. Another operation includes computing an encoding, such as a hash value, for at least one portion of the identified table. Another operation includes comparing the computed encoding to a pre-stored encoding for the at least one portion of the identified table. On the condition that the computed encoding is identical to the pre-stored encoding, the operations include utilizing the identified table in executing the query in lieu of re-materializing the identified table. Otherwise, on the condition that the computed encoding differs from the pre-stored encoding, the operations include re-materializing the identified table before returning the results of the query.

Abstract: An approach is provided for probe trajectory anonymization using based on a negative gap. The approach involves, for example, receiving a probe trajectory generated from at least one sensor of a probe device. The approach also involves processing the probe trajectory to segment the probe trajectory into a first subtrajectory and a second subtrajectory based on a negative gap between the first subtrajectory and the second subtrajectory. The negative gap specifies an amount of overlap between the end of the first subtrajectory and the beginning of the second subtrajectory. The approach further involves assigning a first pseudonym (e.g., a first new probe identifier) to the first subtrajectory, and a second pseudonym (e.g., a second new probe identifier) to the second subtrajectory. The approach then involves providing the first subtrajectory and the second subtrajectory as a trajectory anonymization output.

Abstract: Technologies are provided for detecting backup network paths in a computer network using geospatial data. Geospatial data for network links in a computer network can be used to identify network links that are located within a specified distance to one another. Network links located within the specified distance to one another can be considered to share the same or similar risks of failure. Network links located within the specified distance to one another can be included in shared risk resource groups (SRRGs), such as shared risk link groups (SRLGs). The SRRGs can be used to identify a backup path for a network path that does not include any network links that are in SRRGs that also contain network links in the network path. The backup path can be used to transmit data if a failure is detected in one or more links in the network path.

Abstract: Computer-implemented systems and methods for generating and using a location sensitive ensemble classifier for classifying content includes dividing a validation data set into regions. Each region encompasses data points of the validation data set that fall within the region. A regional ensemble classifier is generated for each region based on the data points that fall within the region. A content item is then classified in at least one of a plurality of classes using the regional ensemble classifier for the region to which the content item belongs.

Abstract: An autonomous moving apparatus control system including a range sensor, a reflection plate, and a control unit. The range sensor is installed in a cage of an elevator and detects a distance to an object by receiving reflected light of signal light applied to the object. The reflection plate is disposed in an elevator hall of a floor on which the elevator stops, and reflects the signal light. The control unit determines whether or not a mobile robot, which is an autonomous moving apparatus, can get on and off the elevator based on a detected distance, the detected distance being a distance to the reflection plate detected by the range sensor.

Abstract: Methods, systems, and computer program products are provided for signature verification. Signature verification may be provided for target signatures using genuine signatures. A signature verification model pipeline may extract features from a target signature and a genuine signature, encode and submit both to a neural network to generate a similarity score, which may be repeated for each genuine signature. A target signature may be classified as genuine, for example, when one or more similarity scores exceed a genuine threshold. A signature verification model may be updated or calibrated at any time with new genuine signatures. A signature verification model may be implemented with multiple trainable neural networks (e.g., for feature extraction, transformation, encoding, and/or classification).

Abstract: Disclosed herein are systems and methods for point-based relation splitting in geospatial-function-implied interval joins. In an embodiment, a data platform receives a query that applies a geospatial-function predicate to first and second geography data objects from first and second relations. The second relation is divided into point and non-point subsets based on the second data geography object. The data platform routes the point subset along a first path that includes a one-sided interval join that applies, to the first relation and the point subset, an interval-join predicate implied by the geospatial-function predicate. The data platform routes the non-point subset along a second path that does not include the one-sided interval join. The data platform obtains query results at least in part with a filter that applies the geospatial-function predicate to outputs of the one-sided interval join and the second path, and outputs the query results.

Abstract: Techniques are disclosed for querying, retrieval, and presentation of data. A data analytic system can enable a user to provide input, through a device to query data. The data analytic system can identify the semantic meaning of the input and perform a query based on the semantic meaning. The data analytic system can crawl multiple different sources to determine a logical mapping of data for the index. The index may include one or more subject areas, terms defining those subject areas, and attributes for those terms. The index may enable the data analytic system to perform techniques for matching terms in the query to determine a semantic meaning of the query. The data analytic system can determine a visual representation best suited for displaying results of a query determined by semantic analysis of an input string by a user.

Abstract: Embodiments of methods and/or systems for tagging trees are disclosed.

Abstract: Aspects of the present invention customize services, including search results, that are customized based on the user's familiarity with a geographic area. The search results may be customized by including different information in a search result, emphasizing different information in a search result, adjusting a relevance rank of different search results, and such. The search results may be customized based on the understanding that a user's familiarity with a particular area may influence the type of information that can be useful to the user. Different levels of familiarity may cause different types and levels of search result customization to be performed.

Abstract: An improved database-management system determines that a near-capacity leaf page of its database index must be split into multiple pages in order to store newly added index entries. The system determines whether the page should be “multi-split” into more than two pages, the total number of new pages to be added, and the range of indexed values assigned to each new page. These determinations are made as functions of the frequency with which the index page, and other index pages for the same index, have been split in the past, of the data distribution of values indexed by the leaf page, and of the degree of sequentiality of entries added to the leaf page. Leaf pages approaching capacity may also be scheduled for “pre-split” splitting during a period of lower utilization. These multi-split and pre-split operations reduce the numbers of index splits and of corresponding synchronous database-log writes.

Abstract: A method and an apparatus for generating a road network are disclosed. The method for generating a road network comprises: aggregating a plurality of grid cells partitioned in advance on a trajectory map based on trajectories in each grid cell of the plurality of grid cells to form level-1 regions; and generating a link of the road network by merging a level-1 region having two valid neighbors with its neighbor level-1 regions having two valid neighbors.

Abstract: A method that enables time as data is described herein. The method includes constructing a tree structure, wherein data of the tree structure is a plurality of time intervals, and layers of the tree below a root node comprise identical sibling nodes for layers above a threshold interval length and parent nodes share identical sibling nodes. The method also includes assigning a node identification to each node of the tree structure, wherein each node of the tree structure corresponds to a time interval, and traversing the tree structure to convert a timestamp to a human readable time.

Abstract: Methods and systems for generating a database index and searching the database index are described herein. In one aspect this may include receiving an item of database data, wherein the item of database data comprises a sequence of data elements. Groups of data elements may be identified within the received item of database data. If any one or more of the identified groups of data elements have not been previously identified within the item of database data and/or previous items database data then the one or more identified group may be stored as index entries in a database index. Information describing the sequence of the groups of neighbouring data elements may be recorded within the database index as they are located within the item of database data. The database index may be searched based on a received search term comprising a sequence of data elements.

Abstract: Systems and methods for correlating and referencing blockchains are described herein. An example method may include providing a database configured to store at least one grid. The grid comprises positions referenced by coordinates. The method may include acquiring, by a processor communicatively coupled to the database, a plurality of blockchains. The method may further include mapping, by the processor, the blockchains to the positions within the grid. The method may include acquiring, by the processor, a subset of coordinates ({P}) corresponding to a subset of the positions within the grid and a set of specifications ({S}). The specifications include an instruction for selection of blocks of one or blockchains mapped to on or more position of the subset of the positions. The method may include associating a function F({P}, {S}) with a further position within the grid, wherein the function F ({P}, {S}) operates on contents of the selected blocks.

Abstract: The present disclosure relates to a method for processing data blocks of a data table. The data blocks comprise an attribute representing multidimensional spatial data objects, where the attribute has multiple values representing respective dimensions of the multidimensional spatial data object. The method comprises creating for each data block of the data blocks, a respective attribute metadata. The attribute metadata comprises attribute value information defining a multidimensional minimum bounding rectangle that covers attribute values of the attribute comprised in the data block. A query is processed on the multidimensional spatial data objects associated with a query area using the multidimensional minimum bounding rectangle to check whether a data block of the data blocks contains attribute values of the attribute in the query area.

Abstract: Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: identifying a certain timestamp hyperlink included within a text based comment entry associated to a published video file, wherein the published video file has been selected by a user, wherein the published video file is published on a video sharing system, and wherein the certain timestamp hyperlink is configured so that clicking on the certain timestamp hyperlink results in playback of the published video file jumping to a playback time specified by the certain timestamp hyperlink; subjecting the text based comment entry having the certain timestamp hyperlink to natural language processing; and injecting a notification for playback to the user with the published video file in dependence on a result of the natural language processing.

Abstract: Techniques are disclosed herein for predicting and presenting to a user images corresponding to visual depictions of materials for a room or building that are pleasant to the user.

Abstract: In an embodiment, a database platform receives query instructions for a query on a database, where the query instructions include instructions for a geospatial-function join that includes a geospatial-function predicate. The database platform generates a query-execution plan based on the query instructions, including replacing the geospatial-function join with one or more interval joins that each include one or more predicates implied by the geospatial-function predicate. The database platform inserts, into the query-execution plan above the one or more interval joins, a filter operator that applies the geospatial-function predicate. The database platform obtains results of the query at least in part by executing the query-execution plan, and returns the query results in response to the query.

Abstract: A method for encoding information within a feature of a document. The method includes at least one computer processors determining information to encode within a document. The method further includes identifying a feature within the document to encode information within based, at least in part, on metadata of the document corresponding to the feature. The method further includes determining a set of geometric properties of one or more segments of the identified feature. The method further includes encoding, by one or more computer processors, a first bit of information of the determined information within a first segment of the feature within the document by modifying one or more geometric properties respectively associated with the first segment. The method further includes outputting the document with information encoded within the first segment.

Abstract: A virtual satellite system may receive, re-project to a spatial resolution and interpolate to a desired temporal resolution, georeferenced data representing an image of a geographic region from a plurality of different satellites. Bias in the georeferenced data between the plurality of satellites is determined and based on which satellite's image data contains an identified minimum spatial resolution, vegetation index data may be set to one of the satellite's data, which may or may not be adjusted. A target image may be generated based on the set vegetation index data.

Abstract: Systems, methods, and computer-readable media for storing data in a data storage system using a child table. In some examples, a trickle update to first data in a parent table is received at a data storage system storing the first data in the parent table. A child table storing second data can be created in persistent memory for the parent table. Subsequently the trickle update can be stored in the child table as part of the second data stored in the child table. The second data including the trickle update stored in the child table can be used to satisfy, at least in part, one or more data queries for the parent table using the child table.

Abstract: Aspects of the present disclosure aim to improve upon systems for managing long database transactions, and the way in which changes made to a database from within a workspace view during a long transaction are committed to the underlying parent database. The present disclosure aims to solve problems caused by the need to refresh a workspace view as part of the process of resolving conflicts between competing workspace views operating on the same portions of the database. Aspects described herein solve the problem through the creation of a separate data structure which effectively logs all of the further transactions which commit changes to parent database. The data structure can be arranged to include all changes committed after a first transaction is opened and worked upon. The process of committing the changes made in the first transaction to the workspace includes performing a recursive search using the data structure.

Abstract: A system and method, including determining, by a processor, distinction bit positions for index keys of a database index; determining, by the processor, concatenation of the bits of the index keys; and generating a record of the concatenation. Other systems and methods include collecting, by a processor, index keys of a database index in parallel, wherein data pages of a target table are evenly distributed to a plurality of processor cores; scanning, by each of the cores the data pages to extract compressed keys and corresponding record identifiers; sorting, by a plurality of the processor cores, pairs of the compressed key and corresponding record identifier in accordance with a parallel sorting algorithm; generating an index tree in a bottom-up fashion; and storing a record of the generated index tree.

Abstract: The present disclosure discloses an interaction method and apparatus based on artificial intelligence. A specific embodiment of the method comprises: receiving a current interactive statement entered by a user through a terminal; extracting at least one type of characteristic based on the current interactive statement and a previous interactive statement entered by the user; processing the at least one type of characteristic using a pretrained neural network model to determine whether an intent maintaining relationship exists between the current interactive statement and the previous interactive statement; and if the intent maintaining relationship exists, updating a limitation condition for the previous interactive statement using the current interactive statement, performing information retrieval using the previous interactive statement with the updated limitation condition, and pushing a retrieved retrieval result to the terminal. This embodiment reduces time spent in user entry.

Abstract: A method, apparatus, and program product utilize projection-based area operations to accelerate the determination of subsurface structure parameters for subsurface structures such as fractures, faults and horizons in a subsurface formation.

Abstract: Methods, systems, and computer program products for secure distance computations are provided herein.

Abstract: A method and an apparatus for generating a road network are disclosed. The method for generating a road network comprises: aggregating a plurality of grid cells partitioned in advance on a trajectory map based on trajectories in each grid cell of the plurality of grid cells to form level-1 regions; and generating a link of the road network by merging a level-1 region having two valid neighbors with its neighbor level-1 regions having two valid neighbors.

Abstract: One embodiment provides a method comprising maintaining a multi-dimensional data structure partitioned into cells utilizing a tree data structure (“tree”) comprising intervals for each dimension of a multi-dimensional space. To partition an interval for a node of the tree into multiple subintervals, multiple leaf nodes (“leaves”) are generated, each leaf descending from the node. To merge multiple intervals for multiple nodes of the tree, a parent node (“parent”) and multiple leaves descending from the parent are generated, the parent and the leaves are time constrained, and the leaves are scheduled for a merger. When transient data in cells included in a list that corresponds to a leaf scheduled for merger expires, each cell in the list is converted into a cell for inclusion in a different list corresponding to a parent of the leaf, each leaf of the parent removed, and the parent turned into a leaf.

Abstract: Techniques for detecting errors in a computing system are provided. In one technique, first member data that comprises first attribute values of a particular attribute is stored. Each attribute value in the first attribute values is associated with a different member of a first plurality of members. Second member data that comprises second attribute values of the particular attribute is stored. Each attribute value in the second attribute values is associated with a different member of a second plurality of members. For each attribute value of the first attribute values, a first number of instances of the attribute value in the first member data is determined, a second number of instances of the attribute value in the second member data is determined, and based on the first number and the second number, a determination of whether a notification indicating the particular attribute will be generated is made.

Abstract: A user factor is analyzed to establish a context in which a user will view a video segment. A data source is selected from a metadata associated with an enhanced video segment. Replacement data is obtained from the data source, where the replacement data corresponds to the context. The replacement data is arranged in a layout, the layout being selected from the metadata according to a device feature of a device on which the user will view the video segment. A set of pixels that represents a first data in a data overlay in the frame is changed, the changed set of pixels representing the layout containing the replacement data. A modified video segment is transmitted, which includes a video content from the video segment and the changed set of pixels.

Abstract: The present disclosure relates to a method for processing data blocks of a data table. The data blocks comprise an attribute representing multidimensional spatial data objects, where the attribute has multiple values representing respective dimensions of the multidimensional spatial data object. The method comprises creating for each data block of the data blocks, a respective attribute metadata. The attribute metadata comprises attribute value information defining a multidimensional minimum bounding rectangle that covers attribute values of the attribute comprised in the data block. A query is processed on the multidimensional spatial data objects associated with a query area using the multidimensional minimum bounding rectangle to check whether a data block of the data blocks contains attribute values of the attribute in the query area.

Abstract: Performing a geo-visual search is disclosed. A query feature vector associated with a query tile is obtained. Based at least in part on a comparison of the query feature vector against at least some of a plurality of exemplar feature vectors, an exemplar feature vector is selected from the plurality of exemplar feature vectors. A list of candidate feature vectors associated with the selected exemplar feature vector is obtained. Based at least in part on a comparison of the query feature vector against at least some of the candidate feature vectors in the obtained list, a tile that is visually similar to the query tile is determined. The determined tile is provided as output.

Abstract: In one embodiment, a method for indexing a document database includes determining, according to user's access status on a plurality of documents in the document database, index indicators from attributes of respective fields of the plurality of documents, wherein the index indicators are used for indexing the plurality of documents, dividing the plurality of documents into a plurality of document sets, indexing the plurality of document sets according to the index indicators. The method may include dividing a plurality of documents in a document database into document sets by utilizing an attribute that a document database is easy to be divided into chunks, and may effectively implement indexing of the document database for the document sets according to another embodiment.

Abstract: A system and method for managing a desired part. A manufacturing system comprises a product lifecycle management tool configured to retrieve from a database based on a number of search parameters. The product lifecycle management tool is further configured to define, for each of retrieved part models, a prism having a volume that contains a volume of a part corresponding to the each of the retrieved part models. The product lifecycle management tool is further configured to display on a display system an assembly model including a three-dimensional view of candidate parts using the retrieved part models arranged in positions relative to each other. The candidate parts in the three-dimensional view are displayed in a side-by-side configuration in an order based on a number of characteristics of each prism such that a part model that most closely matches the desired part may be identified and selected for reuse.

Abstract: Embodiments relate to a distributed map reduce network. An aspect includes receiving a description of a map reduce job comprising a time deadline. Another aspect includes selecting a set of candidate nodes from a plurality of nodes of the distributed map reduce network, wherein the set of candidate nodes are selected based on cost value. Another aspect includes determining an amount of time required to perform the map reduce job by the set of candidate nodes. Another aspect includes, based on the determined amount of time not meeting the time deadline: selecting a particular node of the set of candidate nodes for replacement based on the geographical location of the particular node; selecting a next node of the plurality of nodes based on the cost value of the next node; and replacing the particular node in the set of candidate nodes with the next node.

Abstract: A method and apparatus for position decoding of three dimensional mesh models are described including predicting a symbol probability of a non-empty-child-cell Cl,k, where Cl,k denotes the kth cell at layer l, wherein the symbol probability is estimated based on an accuracy of a fitted plane P, decoding the non-empty-child-cell responsive to the received predicted probability of the non-empty-child-cell, subdividing the non-empty-child-cell, if the non-empty-child-cell has more than one vertex, determining if there are more unprocessed non-empty-child-cells at layer l, determining if a lowest layer of non-empty-child-cells has been reached, if there are no more unprocessed non-empty-child-cells at layer l and regenerating the three dimensional mesh model, if the lowest layer of non-empty-child-cells has been reached.

Abstract: A geospatial indexing module operating in a server device operates on an efficient index for retrieving and providing map features which represent geographic entities such as streets, roads, cities, states, buildings, bodies of water, etc. The index includes identification information for a map feature fragment, which represents at least a portion of a map feature, as well as a node in a tree data structure to which the map feature fragment corresponds and a range of levels of detail for which the map feature fragment is valid. When a user requests map data for a geographic region at a level of detail, the geospatial indexing module queries the index for all map feature fragments within the requested region and level of detail and provides the retrieved map feature fragments to the user.

Abstract: The invention provides a method of terminable spatial tree-based position coding and decoding, and corresponding coding and decoding apparatus. The encoding method comprises: constructing a cell around the input spatial points; recursively dividing the cell into sub-cells at different layers; and assigning a symbol for each sub-cell indicating whether or not there is a spatial point within each sub-cell. The method further comprising: terminating further division of a sub-cell, if the sub-cell contains only one point and the distance between the center point of the sub-cell and the point contained in the sub-cell is smaller than the allowed maximal error.

Abstract: A skyline query is a query on a set of tuples which are not dominated by other tuples. The skyline query system includes a sky quad tree generator that generates a quad tree from data, and marks a leaf node, which cannot include a local skyline, as being dominated; a local skyline calculator that computes a local skyline of each leaf node, which is not marked as being dominated, in the sky quad tree; and a global skyline calculator that computes a global skyline by using the local skyline. A quad tree is a tree where each internal node has exactly four children. The skyline query is a query for calculating a skyline, a dynamic skyline, or a reverse skyline from the data, where a dynamic skyline includes dynamic attributes and a reverse skyline identifies queries corresponding to certain skyline results.

Abstract: Methods and systems for interacting with multiple three-dimensional (3D) object data models are provided. An example method may involve receiving a search query comprising a descriptor for an object that is associated with a given category of objects. The method may involve comparing the descriptor to contents of a three-dimensional (3D) object-data-model database that includes contents associated with the given category of objects. Based on the comparison, the method may involve generating a search query result that comprises 3D object data models that describe the object and associated images that describe the object. The method may also involve arranging the 3D object data models and associated images in the search query result in a manner such that the 3D object data models are moveable inline in the search query result, and providing the search query result.

Abstract: Techniques and systems for processing within-distance queries are provided. A query for geometry objects within a query distance of a query geometry is received. An in-memory R-tree (IMR-tree) is generated for the query geometry. The IMR-tree includes nodes corresponding to edges of the query geometry. An R-tree index for a plurality of candidate geometries is accessed. At least one node of the R-tree index is processed by: generating an expanded bounding geometry based on the query distance, and using the IMR-tree to determine a topological relationship between the expanded bounding geometry and the query geometry. When the expanded bounding geometry intersects the query geometry, if at least one within-distance test is satisfied, the candidate geometries associated with the selected node are added to a result set. Otherwise, if the selected node is a non-leaf node of the R-tree index, child nodes of the selected node are processed.

Abstract: Example embodiments described herein pertain to a geographic information system (GIS), configured to obtain geospatial data representing a geographic area, assign a projection and coordinate system to the geospatial data, apply a transformation to the geospatial data, and generate a tile cache based on the transformed geospatial data, the tile cache including the determined projection and coordinate system.

Abstract: A National Online Parcel-Level Map Data Portal (NPDP) is provided that optimizes online delivery of parcel-level maps and linked attribute data. To do this, the NPDP manages a database of assembled and current vector based parcel data in a spatial format (GIS) that enables geocoded parcel boundaries to be linked to property tax records. A user enters a street address into an appropriate screen window to call up and view road right-of ways, all parcel boundaries and the “exact” address location as a highlighted parcel area. In addition, a list of property record attributes such as owner, use code, assessed value and year constructed can be displayed. Other on screen parcels can likewise be selected if one wishes to view their linked attributes.

Abstract: Querying for devices based on location is disclosed. A request to send a push notification to a location is received. One or more bucket indexes to search for the presence of a device identifier are determined. The one or more bucket indexes are searched for the presence of the device identifier. One or more device identifiers are received in response to the search. The push notification is sent to one or more devices associated with the received one or more device identifiers.

Abstract: A fuzzy database search technique is described for searching a database. The technique first prepares a database by first generating a reference hash value for each database entry to represent a value stored in a field of the database entry. The technique then receives search request to search for database entries in the database that have a value stored in the field that is within a provided range. The technique converts the search request into one or more search hash values and matches the search hash values to the reference hash values of the database to rapidly identify database entries that are likely relevant to the search.

Abstract: A computer-implemented method of organization of a plurality of objects contained in a quadrant tree into a singly linked linear list, comprising: placing a first, a second, a third and a fourth markers of a first level, that correspond to a first, a second, a third and a fourth elements of the first level of the quadrant tree, into the singly linked linear list; placing respective objects stored in any of: the first, the second, the third and the fourth element of the first level of the quadrant tree after a respective one of the first, the second, the third and the fourth marker of the first level accordingly into the singly linked linear list; placing a first, a second, a third and a fourth markers of the second level, that correspond to a first, a second, a third and a fourth elements of the second level of the quadrant tree, into the singly linked linear list; placing objects stored in any one of: the first, the second, the third and the fourth element of the second level of the quadrant tree into the si

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: A system and a method are provided that are capable of providing map data for supporting a variety of user network environments and selecting data zones freely. A navigation terminal includes a reception unit adapted to receive a file in which map data of a specific zone is stored, from a map provision server; and an execution unit adapted to execute a navigation function on the specific zone using the file. The file is produced by an individual unit with respect to each of geographic areas divided by a mesh unit having a variable size. The size of the mesh unit is decided according to the amount of information included in the geographic area such that the file has an equalized size.