Soft Cardinality Constraints on XML Data

347 views

Published on

Soft Cardinality Constraints on XML Data
WISE 2013

Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
347
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
2
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Soft Cardinality Constraints on XML Data

  1. 1. Soft Cardinality Constraints on XML Data How Exceptions Prove the Business Rule Emir Muñoz Fujitsu Ireland Ltd. Joint work with F. Ferrarotti, S. Hartmann, S. Link, M. Marin @ Nanjing, China, 14th October 2013
  2. 2. Contribution • Introduce the definition of soft cardinality constraints over XML data. • Efficient low-degree polynomial time decision algorithm for the implication problem. • Empirical evaluation of soft cardinality constraints on real XML data. Emir M. - WISE, Nanjing, China, 14th October 2013 2
  3. 3. Outline 1. 2. 3. 4. 5. Introduction Soft Cardinality Constraints The Implication Problem Performance Evaluation Conclusion Emir M. - WISE, Nanjing, China, 14th October 2013 3
  4. 4. Introduction Concepts • Cardinality constraints: – Capture information about the frequency with which certain data items occur in particular context. • Soft cardinality constraints: – Constraints which need to be satisfied on average only, and thus permit violations in a controlled manner. Emir M. - WISE, Nanjing, China, 14th October 2013 4
  5. 5. Introduction Example (1/2) Project within a research institute support Emir M. - WISE, Nanjing, China, 14th October 2013 research 5
  6. 6. Introduction Example (2/2) • Some cardinality constraints: – Every scientist is a member of 2, 3, or 4 research teams. – Every technician can work in up to 4 different support teams. – A project cannot have more than one manager. – In every team, there should be two employees for each expertise level. Emir M. - WISE, Nanjing, China, 14th October 2013 6
  7. 7. Introduction Example (2/2) • Some cardinality constraints: Scientist working in 5 research teams or more – Every scientist is a member of 2, 3, or 4 research teams. Probably will be exceptions Soft constraints – Every technician can work in up to 4 different support teams. – A project cannot have more than one manager. – In every team, there should be two employees for each expertise level. Emir M. - WISE, Nanjing, China, 14th October 2013 7
  8. 8. Soft Cardinality Constraints Definition • Expressiveness from the ability to specify soft upper bounds (soft-max) as well as soft lower bounds (soft-min) on the number of nodes. • soft-card(Q, (Q´, {Q1,…, Qk})) = (soft-min, soft-max) Context path Target path Field paths • With some sources of intractability Emir M. - WISE, Nanjing, China, 14th October 2013 soft-min = 1 8
  9. 9. Soft Cardinality Constraints Examples • Every scientist is a member of 2, 3, or 4 research teams. – soft-card(ε, (_.RTeam.Sci, {id})) = (2, 4) • Every technician can work in up to 4 different support teams. – soft-card(ε, (_.STeam.Tech, {id})) = (1, 4) • A project cannot have more than one manager. – soft-card(_, (Manager, Ø)) = (1, 1) • In every team, there should be two employees for each expertise level. – soft-card(_._, (_, {Expertise.S})) = (2, 2) Emir M. - WISE, Nanjing, China, 14th October 2013 9
  10. 10. The Implication Problem Definition and Algorithm • Let be a finite set of (soft) constraints. • We say that finitely implies , denoted by if every finite XML T that satisfies all also satisfies Emir M. - WISE, Nanjing, China, 14th October 2013 10
  11. 11. Performance Evaluation Configuration • We compare the performance against XML Keys • Machine Intel Core i7 2.8GHz, with 4G RAM • Documents: – 321gone, yahoo (auction data) – dblp (bibliographic information on CS) – nasa (astronomical data) – SigmodRecord (articles from SIGMOD Record) – mondial (world geographic db) Emir M. - WISE, Nanjing, China, 14th October 2013 11
  12. 12. Performance Evaluation Results In comparison with previous XML keys Expressivity Time Emir M. - WISE, Nanjing, China, 14th October 2013 12
  13. 13. Conclusion • We introduced an expressive class of soft cardinality constraints, sufficiently flexible to boost XML applications such as data exchange and integration. • Slight extensions result in the intractability of the associated implication problem. • We give an axiomatization for this new class. • Present an empirical performance test that indicate its efficient application in real use cases. Emir M. - WISE, Nanjing, China, 14th October 2013 13
  14. 14. Discussion • Questions & Answers – Soft Cardinality Constraints on XML Data THANKS! Emir Muñoz emir@emunoz.org Emir M. - WISE, Nanjing, China, 14th October 2013 14

×