Presentation is loading. Please wait.

Presentation is loading. Please wait.

Graph Data Management Lab, School of Computer Science Branch Code: A Labeling Scheme for Efficient Query Answering on Tree

Published byAmie Cole Modified over 9 years ago

Similar presentations

Presentation on theme: "Graph Data Management Lab, School of Computer Science Branch Code: A Labeling Scheme for Efficient Query Answering on Tree"— Presentation transcript:

1 Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDAN Branch Code: A Labeling Scheme for Efficient Query Answering on Tree www.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn The 12-th International Conference of Date Engineering Yanghua Xiao, Ji Hong, Wanyun Cui, Zhenying He, Wei Wang, Guodong Feng April 2012 Branch Code: A Labeling Scheme for Efficient Query Answering on Trees

2 2 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Background  Tree is widely used data model XML data File directory Spanning tree in graphs  One typical task on tree data is querying structural relationships PC: Parent/Child AD: Ancestor/Descendant SR: Sibling Relation LCA: Lowest Common Ancestor

3 3 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Interval-based A triple, generated by pre- order/post-order traverse Can not support SR Hard to compute LCA Hard to update  Prefix-based Dewey Code and its variety Storage costly for deep trees Hard to update  Prime-based (Integer-based) Use primes to encode (X. Wu, etc., ICDE’04) Storage costly Previous Labeling Schemes

4 4 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Support various queries efficiently PC, AD in constant time LCA in O(d), where d is the depth of tree  Space efficient Exact labeling cost O(Nd) spaces, but in most cases is less space than other labelings Approximate labeling allows us to tradeoff accuracy for space cost  Support update on trees Amortized O(logN) modification cost by Splay tree Our Labeling Schemes: Brach codes

5 5 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Original Idea  Definition of BranchCode  Addressing Update Operations on Trees  Compression Method  Experimental Evaluation  Conclusion Outline

6 6 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Prefix-based A : * B : *.0 C : *.1 D : *.0.0 E : *.0.1 F : *.0.1.0  Prime-based A : 2 B : 3 × A C : 5 × A D : 7 × B E : 11 × B F : 13 × E Basic Idea Our Idea

7 7 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Simple Radix  Decimal (10-based): 123, 78, 23472, …  Binary (2-based): 0, 1, 101, 1010, 1101,… Representation of Numbers

8 8 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Complex Radix Prefix form

9 9 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Original Idea  Definition of BranchCode  Addressing Update Operations on Trees  Compression Mechanism  Experimental Evaluation  Conclusion Outline

10 10 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Definition of BranchCode

11 11 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Example [-, 1] [2, 1] [3, 1] [3, -]  R =  D =  b(n) = S(D, R) = 1 + 2 × (1 + 3 × 1) = 13

12 12 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Query Answering 2. Navigability 3. Lowest Common Ancestor (LCA) Stems from Navigability.

13 13 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Original Idea  Definition of BranchCode  Addressing Update Operations on Trees  Compression Mechanism  Experimental Evaluation  Conclusion Outline

14 14 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  S(D,R), where D = R =  S’(D’,R’), where D’ = R’ =  Delta = |S’ – S|  How to calculate Delta? BranchCode for Dynamic Trees

15 15 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Incremental Update of BranchCode

16 16 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Incremental Update of BranchCode

17 17 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Incremental Update of BranchCode

18 18 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Incremental Update of BranchCode

19 19 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Example

20 20 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  When we insert (or delete) a child of a particular node, all its descendants will be affected.  According to mathematical proofs, in expection O(n) nodes can be affected after an insertion operation in some bad cases, here n is the size of the tree. Affect Nodes after Update

21 21 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Post-order traversal on trees. Seq = {2, 3, 6, 7, 4, 5, 1}  Two properties of post-order sequence: 1)All descendants of a single node are consecutive in the post-order sequence. 2)All descendants of a set of consecutive siblings are consecutive in the post-order sequence. Affect Nodes after Update (Cont’d) Use Splay Tree to maintain the sequence.

22 22 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Update Based on Splay Tree Update and query based on splay tree

23 23 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Maintainance of Buffered Marks

24 24 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Original Idea  Definition of BranchCode  Addressing Update Operations on Trees  Compression Mechanism  Experimental Evaluation  Conclusion Outline

25 25 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Definition of Compressed Code: Compressed BranchCode

26 26 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Congruence:  CA Determination: Property of Compressed Code

27 27 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Original Idea  Definition of BranchCode  Addressing Update Operations on Trees  Compression Mechanism  Experimental Evaluation  Conclusion Outline

28 28 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Accuracy of Compressed Code

29 29 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Data sets: Results on Real Data

30 30 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Results on Real Data (Cont’d)

31 31 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Results on Synthetic Data

32 32 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  Original Idea  Definition of BranchCode  Addressing Update Operations on Trees  Compression Mechanism  Experimental Evaluation  Conclusion Outline

33 33 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn  We systematically explore the basic properties about branch code and construct conditions for correctly determining the relationships of nodes in trees.  The compressed BranchCode reduces the storage cost to linear complexity.  We also design an incremental approach (of O(logN) amortized update cost and query cost) based on splay tree to maintain branch codes on dynamic trees. Conclutions

34 34 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Open Question How to theoretically estimate the possibility of FP given particular modulo set?

35 35 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Thank you for your attention!

36 36 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Motivation of Problem  Why you study this problem?

37 37 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Related works  How did people solve this problem in the previous works?  Survey of any other related works Problems that is similar to your works Techniques that used in your solution Any other related works

38 38 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Problem definition  Formal definition  Property of proposed problem  Is this problem novel Difference of this problem to the related problem  Does this problem deserve our research efforts? Challenges of this problem Is this problem NP-hard? If so, give the proof

39 39 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Baseline Solution  What is the naive solution to solve this problem  Why this solution is unacceptable? Complexity Salability Or any other issues

40 40 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Your solution  Basic idea of your solution Example if exists  Algorithm framework of your solution

41 41 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Key technique of your solution  For each technique, give the following Rationality of this technique Procedure of the technique Can we prove the efficiency or effectiveness of your solution? If so, give them Optimization of your technique when handle large data or dynamic data

42 42 Branch Code: A Labeling Scheme for Efficient Query Answering on Tree The 28-th International Conference of Date Engineering Graph Data Management Lab, School of Computer Science GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn GDM@FUDANGDM@FUDANwww.gdm.fudan.edu.cn Email: {shawyh, ji_hong}@fudan.edu.cn Planning of next step  What you plan to do as the next step?  Checkpoint  Delivery

Download ppt "Graph Data Management Lab, School of Computer Science Branch Code: A Labeling Scheme for Efficient Query Answering on Tree"

Similar presentations

Ting Chen, Jiaheng Lu, Tok Wang Ling

Ting Chen, Jiaheng Lu, Tok Wang Ling
Computing Structural Similarity of Source XML Schemas against Domain XML Schema Jianxin Li 1 Chengfei Liu 1 Jeffrey Xu Yu 2 Jixue Liu 3 Guoren Wang 4 Chi.

Computing Structural Similarity of Source XML Schemas against Domain XML Schema Jianxin Li 1 Chengfei Liu 1 Jeffrey Xu Yu 2 Jixue Liu 3 Guoren Wang 4 Chi.
Succinct Representations of Dynamic Strings Meng He and J. Ian Munro University of Waterloo.

Succinct Representations of Dynamic Strings Meng He and J. Ian Munro University of Waterloo.
Introduction to Computer Science 2 Lecture 7: Extended binary trees

Introduction to Computer Science 2 Lecture 7: Extended binary trees
Jianxin Li, Chengfei Liu, Rui Zhou Swinburne University of Technology, Australia Wei Wang University of New South Wales, Australia Top-k Keyword Search.

Jianxin Li, Chengfei Liu, Rui Zhou Swinburne University of Technology, Australia Wei Wang University of New South Wales, Australia Top-k Keyword Search.
Frequent Closed Pattern Search By Row and Feature Enumeration

Frequent Closed Pattern Search By Row and Feature Enumeration
Di Yang, Elke A. Rundensteiner and Matthew O. Ward Worcester Polytechnic Institute VLDB 2009, Lyon, France 1 A Shared Execution Strategy for Multiple Pattern.

Di Yang, Elke A. Rundensteiner and Matthew O. Ward Worcester Polytechnic Institute VLDB 2009, Lyon, France 1 A Shared Execution Strategy for Multiple Pattern.
Fast Algorithms For Hierarchical Range Histogram Constructions

Fast Algorithms For Hierarchical Range Histogram Constructions
TI: An Efficient Indexing Mechanism for Real-Time Search on Tweets Chun Chen 1, Feng Li 2, Beng Chin Ooi 2, and Sai Wu 2 1 Zhejiang University, 2 National.

TI: An Efficient Indexing Mechanism for Real-Time Search on Tweets Chun Chen 1, Feng Li 2, Beng Chin Ooi 2, and Sai Wu 2 1 Zhejiang University, 2 National.
1 Abdeslame ALILAOUAR, Florence SEDES Fuzzy Querying of XML Documents The minimum spanning tree IRIT - CNRS IRIT : IRIT : Research Institute for Computer.

1 Abdeslame ALILAOUAR, Florence SEDES Fuzzy Querying of XML Documents The minimum spanning tree IRIT - CNRS IRIT : IRIT : Research Institute for Computer.
22C:19 Discrete Structures Trees Spring 2014 Sukumar Ghosh.

22C:19 Discrete Structures Trees Spring 2014 Sukumar Ghosh.
Constant-Time LCA Retrieval

Constant-Time LCA Retrieval
1 Huffman Codes. 2 Introduction Huffman codes are a very effective technique for compressing data; savings of 20% to 90% are typical, depending on the.

1 Huffman Codes. 2 Introduction Huffman codes are a very effective technique for compressing data; savings of 20% to 90% are typical, depending on the.
Midterm 2 Overview Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

Midterm 2 Overview Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
Accelerating Inferencing. Assertion Efficient inferencing using taxonomies require fast computation of subsumption, disjointness, least common ancestors,

Accelerating Inferencing. Assertion Efficient inferencing using taxonomies require fast computation of subsumption, disjointness, least common ancestors,
B+-tree and Hashing.

B+-tree and Hashing.
1 Indexing and Querying XML Data for Regular Path Expressions A Paper by Quanzhong Li and Bongki Moon Presented by Amnon Shochot.

1 Indexing and Querying XML Data for Regular Path Expressions A Paper by Quanzhong Li and Bongki Moon Presented by Amnon Shochot.
DEPARTMENT OF COMPUTER SCIENCE SOFTWARE ENGINEERING, GRAPHICS, AND VISUALIZATION RESEARCH GROUP 15th International Conference on Information Visualisation.

DEPARTMENT OF COMPUTER SCIENCE SOFTWARE ENGINEERING, GRAPHICS, AND VISUALIZATION RESEARCH GROUP 15th International Conference on Information Visualisation.
B + -Trees (Part 1). Motivation AVL tree with N nodes is an excellent data structure for searching, indexing, etc. –The Big-Oh analysis shows most operations.

B + -Trees (Part 1). Motivation AVL tree with N nodes is an excellent data structure for searching, indexing, etc. –The Big-Oh analysis shows most operations.
Recursive Graph Deduction and Reachability Queries Yangjun Chen Dept. Applied Computer Science, University of Winnipeg 515 Portage Ave. Winnipeg, Manitoba,

Recursive Graph Deduction and Reachability Queries Yangjun Chen Dept. Applied Computer Science, University of Winnipeg 515 Portage Ave. Winnipeg, Manitoba,

Similar presentations

Ads by Google