This paper presents an m-array based indexing scheme for efficient retrieval on FLOWR queries on XML databases. The proposed technique stores path dictionary, element dictionary and value node dictionary using B+tree structure. With help of this method we can access database quickly and effectively.Keywords: FLOWR, XML, m-way search, B+...
Graphs algorithms Graph indexing Shortest path Tree decomposition k Nearest Neighbors problems 1. Introduction Querying and manipulating large scale graph-like data have attracted much attention in the database community, due to the wide application areas of graph data, such as ranked keyword search, ...
17.A computerized system for searching a collection of content, comprising:a data store storing at least:a set of content descriptors characterizing the collection of content; andan index tree indexing the set of content descriptors; anda processor; anda memory device including instructions that, whe...
Rudolf Bayer and Karl Unterauer. "Prefix B-trees", Proc. ACM Trans. Database Syst. 2, 1, pp.11-26), March 1977.[DOI] Sponsors No sponsors yet. Will you be the first? It will be my motivation to continue working on this project. ...
(just as DB schemas are necessary in traditional DBMS for the provision of efficient storage, retrieval and indexing facilities, the same is true for DTDs and/or XSDs in XML repositories), XML ranked document retrieval via structural queries [32], [55] (a structural query being represented ...
Cannot apply indexing with [] to an expression of type 'method group' Cannot apply indexing with [] to an expression of type 'System.Collections.Generic.IEnumerable Cannot await 'Void' Cannot cast DBNull.Value to System.Decimal error in LINQ Cannot change startup object of a basic C# console...
We propose the application of graph database as an indexing layer that defines conceptual linking between database entities, beside logic-based assertions and constraints to evaluate XML queries over this layer to find most related entities and traverse only their related nodes in the XML document....
Graph Database Indexing Layer for Logic-Based Tree Pattern Matching Over Intensional XML Document DatabasesMost XML query evaluation approaches are based on the technique of tree pattern query matching (TPQ) to find similar occurrences of the query's path and conditions. Mainly, two types of ...
A SCHEME OF INDEXING AND QUERY OF XML TREE BASED CONCEPT STRUCTURE OF DATABASEinvention XML (eXtensible Markup Language) documents in the database structure information obtained bet for the concept structures based index of an XML tree, and to a method of querying the database based on the ...
For this reason, a hybrid spatial index method combining octree and R*-tree [12] to organize Point Cloud data is proposed. 2. Related Work 2.1. Single Indexing Structure With the widely utilized of 3D sensors, the volume of Point Cloud data is increasing dramatically. Point Cloud data ...