The effect of distance metrics in a general purpose synthesizer: An empirical study on integer domain imperative programs

An Empirical Study of Distance Metrics for k-Nearest Neighbor Algorithm

The Proceedings of the 2nd International Conference on Industrial Application Engineering 2015 ◽

10.12792/iciae2015.051 ◽

2015 ◽

Cited By ~ 30

Author(s):

Kittipong Chomboon ◽

Pasapichi Chujai ◽

Pongsakorn Teerarassammee ◽

Kittisak Kerdprasop ◽

Nittaya Kerdprasop

Keyword(s):

Empirical Study ◽

Nearest Neighbor ◽

Distance Metrics ◽

K Nearest Neighbor ◽

Nearest Neighbor Algorithm ◽

K Nearest Neighbor Algorithm

Download Full-text

An Empirical Study of Some Zone-Design Criteria

Environment and Planning A Economy and Space ◽

10.1068/a100781 ◽

1978 ◽

Vol 10 (7) ◽

pp. 781-794 ◽

Cited By ~ 59

Author(s):

S Openshaw

Keyword(s):

Linear Regression ◽

Empirical Study ◽

Regression Model ◽

Linear Regression Model ◽

General Purpose ◽

Design Criteria ◽

Aggregated Data

The results obtained from studies of spatially aggregated data are not independent of the choice of zoning system. The paper investigates the effects of different zone-design criteria on a linear-regression model. It is concluded that there is unlikely to be either a simple or general-purpose solution to the problem.

Download Full-text

Leveraging range joins for the computation of overlap joins

The VLDB Journal ◽

10.1007/s00778-021-00692-3 ◽

2021 ◽

Author(s):

Anton Dignös ◽

Michael H. Böhlen ◽

Johann Gamper ◽

Christian S. Jensen ◽

Peter Moser

Keyword(s):

Empirical Study ◽

Database Management ◽

State Of The Art ◽

General Purpose ◽

Management Systems ◽

Open Time ◽

B Trees ◽

Continuous Domains ◽

Time Periods ◽

Insight Into

AbstractJoins are essential and potentially expensive operations in database management systems. When data is associated with time periods, joins commonly include predicates that require pairs of argument tuples to overlap in order to qualify for the result. Our goal is to enable built-in systems support for such joins. In particular, we present an approach where overlap joins are formulated as unions of range joins, which are more general purpose joins compared to overlap joins, i.e., are useful in their own right, and are supported well by B+-trees. The approach is sufficiently flexible that it also supports joins with additional equality predicates, as well as open, closed, and half-open time periods over discrete and continuous domains, thus offering both generality and simplicity, which is important in a system setting. We provide both a stand-alone solution that performs on par with the state-of-the-art and a DBMS embedded solution that is able to exploit standard indexing and clearly outperforms existing DBMS solutions that depend on specialized indexing techniques. We offer both analytical and empirical evaluations of the proposals. The empirical study includes comparisons with pertinent existing proposals and offers detailed insight into the performance characteristics of the proposals.

Download Full-text