arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2005.14068cs.DB
收藏

通过订单查询发现域名订单

Discovering Domain Orders through Order Dependencies

Reza Karegar, Melicaalsadat Mirsafian, Parke Godfrey, Lukasz Golab, Mehdi Kargar, Divesh Srivastava, Jaroslaw Szlichta

摘要:

许多真实世界的数据都带有明确定义的域顺序;例如,字符串按字典顺序排列,整数按数值顺序排列,时间按时间顺序排列。我们的目标是发现我们还不知道的隐含域顺序;例如,中国农历中的月份顺序是角<杏<桃。为此,我们通过顺序依赖关系发现数据中的隐式域顺序来增强数据分析方法。我们列举了易于处理的特殊情况下,并继续对最一般的情况下,我们证明是NP-完全的。我们表明,一般情况下,但可以有效地处理SAT求解器。我们还设计了一个有趣的措施来排名发现的隐式域的顺序,我们验证了用户的研究。基于一套广泛的实验与真实世界的数据,我们建立了我们的算法的有效性,并通过展示显着的附加值在三个应用程序(数据分析,查询优化,和数据采掘)中发现的域顺序的效用。

英文摘要:

Much real-world data come with explicitly defined domain orders; e.g., lexicographic order for strings, numeric for integers, and chronological for time. Our goal is to discover implicit domain orders that we do not already know; for instance, that the order of months in the Chinese Lunar calendar is Corner < Apricot < Peach. To do so, we enhance data profiling methods by discovering implicit domain orders in data through order dependencies. We enumerate tractable special cases and proceed towards the most general case, which we prove is NP-complete. We show that the general case nevertheless can be effectively handled by a SAT solver. We also devise an interestingness measure to rank the discovered implicit domain orders, which we validate with a user study. Based on an extensive suite of experiments with real-world data, we establish the efficacy of our algorithms, and the utility of the domain orders discovered by demonstrating significant added value in three applications (data profiling, query optimization, and data mining).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑