Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps William F . Jones and Gregory M. Kapfhammer Allegheny College http://www.cs.allegheny.edu/ ∼ gkapfham/ 20th International Conference on Software Engineering and Data Engineering, June 20 - 22, 2011
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Finding Data in Unstructured Heaps Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Finding Challenges Data in Unstructured Heaps Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Finding Challenges Data in Unstructured Solutions Heaps Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Finding Challenges Data in Unstructured Solutions Heaps Benchmarking Framework Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Finding Challenges Data in Unstructured Solutions Heaps Benchmarking Framework JQL : Java Query Language Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Finding Challenges Data in Unstructured Solutions Heaps Benchmarking Framework JQL : Java JoSQL : Java Query Objects Struc- Language tured Query Language Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Finding Challenges Data in Unstructured Solutions Heaps Benchmarking Framework JQL : Java HC : Hand JoSQL : Java Query Coded Iterative Objects Struc- Language Methods tured Query Language Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Finding Challenges Comprehensive Data in Empirical Study Unstructured Solutions Heaps Benchmarking Framework JQL : Java HC : Hand JoSQL : Java Query Coded Iterative Objects Struc- Language Methods tured Query Language Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Overview of the Presentation Experiments Reveal Trade-offs in Performance and Overall Viability Finding Challenges Comprehensive Data in Empirical Study Unstructured Solutions Heaps Benchmarking Framework JQL : Java HC : Hand JoSQL : Java Query Coded Iterative Objects Struc- Language Methods tured Query Language Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap The unstructured heap in a Java virtual machine stores objects that are connected in complex and unpredictable ways (Xu and Rountev, ICSE 2008) Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap The unstructured heap in a Java virtual machine stores objects that are connected in complex and unpredictable ways (Xu and Rountev, ICSE 2008) When is an Object Allocated to the Heap? LinkedList list = new LinkedList() Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap The unstructured heap in a Java virtual machine stores objects that are connected in complex and unpredictable ways (Xu and Rountev, ICSE 2008) When is an Object Allocated to the Heap? LinkedList list = new LinkedList() Let’s Allocate Some Objects to the Heap! Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap u k − 1 u k u k +1 w k − 1 B w k B w k +1 B x k − 1 A x k A x k +1 · · · · · · v k − 1 H v k H v k +1 H z k − 1 z k z k +1 Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap S 00 T 01 u k − 1 u k u k +1 S 01 T 02 T 10 w k − 1 B w k B w k +1 B S 02 S 10 T 03 T 04 T 11 T 12 S 03 S 04 S 11 S 12 x k − 1 A x k A x k +1 · · · · · · T 05 T 06 T 07 T 08 T 09 . 0 T 13 T 14 T 09 . 1 S 05 S 06 S 07 S 08 S 13 S 14 v k − 1 H v k H v k +1 H S 09 T 15 T 16 T 17 S 15 S 16 S 17 T 18 T 19 T 20 T 21 T 22 . 0 z k − 1 z k z k +1 T 22 . 1 S 18 S 19 S 20 S 21 S 22 Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap 55 119 5 238 94 ∅ S 00 T 01 u k − 1 u k u k +1 S 01 T 02 T 10 w k − 1 B w k B w k +1 B S 02 S 10 T 03 T 04 T 11 T 12 S 03 S 04 S 11 S 12 x k − 1 A x k A x k +1 · · · · · · T 05 T 06 T 07 T 08 T 09 . 0 T 13 T 14 T 09 . 1 S 05 S 06 S 07 S 08 S 13 S 14 v k − 1 H v k H v k +1 H S 09 T 15 T 16 T 17 S 15 S 16 S 17 T 18 T 19 T 20 T 21 T 22 . 0 z k − 1 z k z k +1 T 22 . 1 S 18 S 19 S 20 S 21 S 22 Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap 55 119 5 238 94 ∅ Root S 00 ... T 01 u k − 1 u k u k +1 22 S 01 T 02 T 10 w k − 1 B w k B w k +1 B S 02 S 10 5 19 T 03 T 04 T 11 T 12 S 03 S 04 S 11 S 12 x k − 1 A x k A x k +1 · · · · · · T 05 T 06 T 07 T 08 T 09 . 0 T 13 T 14 T 09 . 1 S 05 S 06 S 07 S 08 S 13 S 14 v k − 1 H v k H v k +1 H S 09 T 15 T 16 T 17 S 15 S 16 S 17 T 18 T 19 T 20 T 21 T 22 . 0 z k − 1 z k z k +1 T 22 . 1 S 18 S 19 S 20 S 21 S 22 Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap 55 119 5 238 94 ∅ Root S 00 ... T 01 u k − 1 u k u k +1 22 S 01 T 02 T 10 w k − 1 B w k B w k +1 B S 02 S 10 5 19 T 03 T 04 T 11 T 12 S 03 S 04 S 11 S 12 x k − 1 A x k A x k +1 · · · · · · T 05 T 06 T 07 T 08 T 09 . 0 T 13 T 14 T 09 . 1 S 05 S 06 S 07 S 08 S 13 S 14 v k − 1 H v k H v k +1 H S 09 T 15 T 16 T 17 Start S 15 S 16 S 17 T 18 T 19 T 20 T 21 T 22 . 0 z k − 1 z k z k +1 T 22 . 1 S 18 S 19 S 20 S 21 ... 75 S 22 Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Introduction Query Methods Empirical Study Conclusion Correctly and Efficiently Finding Objects in the Heap 55 119 5 238 94 ∅ Root S 00 ... T 01 u k − 1 u k u k +1 22 S 01 T 02 T 10 w k − 1 B w k B w k +1 B S 02 S 10 5 19 T 03 T 04 T 11 T 12 S 03 S 04 S 11 S 12 x k − 1 A x k A x k +1 · · · · · · T 05 T 06 T 07 T 08 T 09 . 0 T 13 T 14 T 09 . 1 S 05 S 06 S 07 S 08 S 13 S 14 v k − 1 H v k H v k +1 H S 09 T 15 T 16 T 17 Start S 15 S 16 S 17 T 18 T 19 T 20 T 21 T 22 . 0 z k − 1 z k z k +1 T 22 . 1 S 18 S 19 S 20 S 21 ... 75 S 22 LinkedList Node(s) with Values Greater Than Those in the Trees Jones & Kapfhammer Allegheny College Ask and You Shall Receive: Empirically Evaluating Declarative Approaches to Finding Data in Unstructured Heaps
Recommend
More recommend
