{'fraction_non_alphanumeric': 0.024875621890547265, 'fraction_numerical': 0.0, 'mean_word_length': 5.44, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, '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}}
Efficient Execution of Dependency Models

Recently, several studies have investigated the efficient execution of bag-of-words (BOW) retrieval models for large document collections. Even though there is a large body of work that consistently shows that dependency models consistently outperform BOW models, none of these studies consider the efficient execution of dependency models. In this study we present initial investigations into the efficient execution of the sequential dependence model (SDM), a commonly used benchmark dependency model. We observe that versions of the Weak-And and Max-Score query processing models are efficient rank-k-safe query processing algorithms for this dependence model. Further, we observe that query processing time can be halved using a two-pass heuristic algorithm.