{'fraction_non_alphanumeric': 0.021134593993325918, 'fraction_numerical': 0.0033370411568409346, 'mean_word_length': 5.474820143884892, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Framework for Querying Pedigree Data

Genealogy information is becoming increasingly abundant in light of modern genetics and the study of diseases and risk factors. As the volume of this structured pedigree data expands, there is a pressing need for better ways to manage, store, and efficiently query this data. Building on recent advances in semi-structured data management and proven relational database technology, we propose a general-purpose pedigree query language (PQL) and evaluation framework for elegantly expressing and efficiently evaluating queries on this data. In this paper, we describe how the problem of modeling and querying pedigree data differs from XML, present an overview of PQL, and present efficient evaluation for key parts of the language. Experimental results using real data show significant (>850%) performance improvement for complex queries over naive evaluation