Pith. sign in

REVIEW 2 major objections 5 minor 10 references

Proximity-based equivalence classes in fuzzy relational database model

T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proposes defining fuzzy-relational equivalence classes from fixed interval partitions of a domain, so that classes no longer depend on database contents but still guarantee mutual proximity above a threshold.

desk verdict Theorems check out and the interval-partition idea is genuinely domain-independent for numeric domains, but the linguistic-domain construction rests on an arbitrary equal-spacing assumption that the paper never acknowledges. read the letter →

arxiv 1908.09333 v1 pith:2OJSSSZ3 submitted 2019-08-25 cs.DB

Aleksandar Janjić This is my paper · ORCID
classification cs.DB MSC 68P1503E72
keywords fuzzyrelationaldatabaseproximityrelationequivalenceclassessimilarityintervalpartitionindependencetransitiveclosurelinearlyordereddomain
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper addresses a known weakness of fuzzy relational databases: the equivalence classes used to merge similar tuples are defined over the current database content, so dense data can drag distant values into one class and inserts or deletes can change the classes. It proposes a different construction in which, for a given threshold α, an attribute domain that is an interval is partitioned into equal-length pieces (plus possibly one shorter piece), and the pieces themselves are the equivalence classes. For one- and two-dimensional Euclidean domains the paper proves that any two values in the same piece have normalized distance small enough that their proximity is at least α, while class membership never depends on which values appear in the database. The motivation is that query results become stable and that automatic proximity relations can be read off from ordinary distance for linearly ordered domains.

What carries the argument

The central object is the normalized Euclidean proximity function $p$, together with the equal-length partition of the domain. In one dimension $p(a,b)=1-|b-a|/L$; in two dimensions $p(M_1,M_2)=1-d(M_1,M_2)/(\sqrt{2}L)$. The load-bearing identity is $p(x,y)\ge\alpha \iff |x-y|\le(1-\alpha)L$, which turns a geometric bound on cell diameter into a uniform proximity guarantee. Partitioning at step size $m=(1-\alpha)L$ makes the proof immediate and removes any role for the current database contents.

What would settle it

Take $L=100$, $\alpha=0.8$, and two values just on either side of a boundary, $20-\epsilon$ and $20+\epsilon$. Their proximity is $1-2\epsilon/100$, above any reasonable threshold, yet the construction assigns them to different classes because $20$ is the cut between $[0,20)$ and $[20,40)$. This boundary example, visible already in the paper's status data with 75 and 80 at α=0.8, settles that the claim 'same class implies proximity ≥ α' is one-directional and that class membership is not equivalent to mutual proximity.

Watch

Extended reading notes

Core claim

The central claim is that a proximity relation—reflexive and symmetric only, with no max-min transitivity—can yield useful, database-independent equivalence classes. On an interval $[0,L]$ the proximity is $p(a,b)=1-|b-a|/L$; fixing $\alpha\in(0,1]$ sets $m=(1-\alpha)L$ and the classes are the consecutive intervals $[km,(k+1)m)$, with the last interval extended to $L$. In the two-dimensional square $[0,L]\times[0,L]$, proximity is normalized by the diagonal and classes are Cartesian products of the one-dimensional intervals. Theorems 4–6 prove that the pieces are an equivalence relation and that any two elements in one piece have proximity at least $\alpha$. The deliberate price is that the converse fails: proximity above threshold is necessary but not sufficient for belonging to the same class.

Load-bearing premise

The construction presupposes that every attribute domain can be mapped onto a line or a grid in which normalized Euclidean distance between the coded values is an accurate measure of semantic similarity; for linguistic labels this is assumed, not derived.

Editorial extensions

If this is right

  • For a fixed threshold α, tuple merging and query results no longer change when rows are inserted or deleted, because the equivalence classes are defined on the attribute domain alone.
  • Linearly ordered domains get automatic proximity values from distance: the paper's build and hair-colour examples assign values 0, 1, 2, … and compute proximity from these spacings.
  • Dense databases no longer collapse into one class: in the 23-city example, the previous transitive-closure method yields a single class for α=0.4, 0.6 and 0.8, whereas the interval method yields several geographically meaningful classes.
  • Two-dimensional classes are axis-aligned squares, so the same one-dimensional construction applies coordinatewise and the proximity guarantee inside each square follows from the bounds $|x_2-x_1|\le m$ and $|y_2-y_1|\le m$.
  • The method is asymmetric by design: it guarantees that co-class members are mutually close, but it does not guarantee that mutual closeness puts two values in the same class.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • An implicit limitation the paper does not explore is that the same fixed-cell idea would work on any metric space: one could take any metric with known diameter and define cells of diameter at most $(1-\alpha)$ times the diameter, so the construction is not inherently tied to intervals or squares.
  • The automatic coding of linguistic terms in Example 4.2 embeds a semantic assumption: equating 'one step apart' regardless of which pair of labels are involved. A reader testing this on other vocabularies should expect the shape of the classes to shift if the ordering is not perceptually uniform.
  • The one-sidedness suggests a natural follow-up: refine partitions so that proximity above α is also sufficient, or introduce a second threshold for merging, at the cost of either data dependence or non-transitive clusters. That tradeoff is left open.
  • One testable extension would compare query outcomes and user interpretations between the interval classes and the transitive-closure classes on the same dense dataset, since the paper demonstrates geometry rather than measured user or query quality.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper proposes a method for forming equivalence classes over attribute domains in fuzzy relational databases using a proximity relation that satisfies only reflexivity and symmetry. For a one-dimensional domain [0,L] with proximity p(a,b)=1-|a-b|/L, it partitions the interval into half-open subintervals of length (1-alpha)L and proves (Theorems 4 and 5) that this partition is an equivalence relation and that elements in the same class have proximity at least alpha. The construction is extended to [0,L]^2 with normalized Euclidean distance (Theorem 6). The paper argues that this makes equivalence classes independent of the current database content, in contrast with the Shenoi-Melton temporal-domain classes, and offers an automatic way of generating proximity relations for ordered and linguistic domains, illustrated with supplier and city-location examples.

Significance. If the advertised scope is carefully qualified, the paper gives a clean and correct construction whose main virtue is content-independence for a fixed numeric metric. Theorems 4-6 are simple but valid, and the worked examples make the behavior concrete. The main limitation, acknowledged only indirectly, is that the construction applies to domains equipped with a numeric embedding and normalized distance; for linguistic domains it silently assumes equal spacing of codes. With that assumption stated explicitly, the result would be a useful, if incremental, theoretical contribution for fuzzy relational databases.

major comments (2)
  1. [Section 4, Example 4.2, Eq. (1)] The claim that the equivalence classes 'depend only on the attribute domain' is not established for linguistic domains. The construction first maps ordered linguistic values to equally spaced integers (VL=0, L=1, A=2, S=3, VS=4; Bk=0, DB=1, ..., Bc=6) and then defines proximity as normalized Euclidean distance on those integers. This introduces a modeling assumption about semantic equidistance that is neither justified nor stated. A strictly monotone but nonlinear re-encoding changes the distances, hence changes p and the alpha-equivalence classes for a fixed alpha. Content-independence is therefore relative to a user-chosen embedding, not a property of the domain alone. The paper should either state this limitation explicitly and advise users that the encoding must be chosen to reflect real proximities, or restrict the automatic-construction claim to domains that already carry a metric.
  2. [Section 4, introductory paragraph] The statement that the result is 'easily extended to any linearly ordered set' is unsupported. An abstract linear order does not determine a distance; the construction depends on the specific interval length L and normalized absolute difference in a real embedding. No theorem characterizes which linearly ordered sets admit such a metric-preserving embedding, and Example 4.2 imposes equal spacing by hand. The extension should be formulated conditionally: for any set equipped with an injective map into [0,L] (or a chosen order-preserving metric), the construction applies, but different embeddings yield different equivalence classes.
minor comments (5)
  1. [Section 4.1] The equalization construction defines m = L/n without specifying n; the subsequent sentence about two classes for alpha between 0 and 0.5 and three classes between 0.5 and 2/3 is consistent with n = ceil(1/(1-alpha)), but the paper has just defined n = floor(1/(1-alpha)). This ambiguity should be resolved.
  2. [Section 5] The interval indexing in the two-dimensional construction is inconsistent: for alpha = 0.8, n = 5 and the list I1,...,I5 already covers [0,100] with I5 = [80,100], yet the text also introduces I_{n+1} = [nm,L] = [100,100], a degenerate interval. The definition of I_{n+1} should be conditioned on whether 1/(1-alpha) is an integer.
  3. [Theorem 5 proof] The proof says the length of Ik is m, but the final interval In = [nm,L] can have length strictly less than m. The inequality still holds because its length is at most m, but the proof should say that rather than claiming every interval has length exactly m.
  4. [Section 4, alpha = 1] The construction is stated for alpha in (0,1], but for alpha = 1 the formulas m = (1-alpha)L and n = floor(1/(1-alpha)) are undefined due to division by zero. The paper should either restrict alpha to [0,1) or handle alpha = 1 separately, for example by defining the equivalence classes to be singletons.
  5. [Throughout] The manuscript contains numerous typographical and formatting errors, including missing separators in tables (e.g., 'BreeGamgee' in Table 14), inconsistent use of 'nad' for 'and', and notation such as 'k in 0,n' that should be 'k in {0,1,...,n}'. A careful copyedit is needed.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the construction and theorems follow directly from the explicitly defined proximity function and interval partition.

full rationale

The paper's central claim is a construction, not an empirical prediction. The proximity function p(a,b)=1-∣b-a∣/L is explicitly defined (Eq. 1), and for a given alpha the interval [0,L] is partitioned into half-open intervals of length m=(1-alpha)L. Theorem 5 is then a direct consequence: any two elements in the same class satisfy ∣x-y∣≤m, hence p(x,y)≥alpha. The two-dimensional case (Theorem 6) is the same argument applied to the Euclidean metric, using the maximal diagonal length sqrt(2)L for normalization. No parameter is fitted to a data subset and then renamed a prediction; the equivalence classes are constructed from the definition and the chosen alpha. The treatment of linguistic domains in Example 4.2 adopts equally spaced numeric codes, which is an unverified modeling assumption about semantic distance and makes the construction encoding-dependent, but this is a limitation of the example rather than circularity: for the fixed embedding the proof still establishes the stated implication. The cited literature (Buckles-Petry, Shenoi-Melton, etc.) is used to frame the problem and does not supply a load-bearing premise that is assumed without proof. Consequently, no step reduces to its own input, and the derivation is self-contained.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The central construction relies on standard interval arithmetic plus the domain assumption that ordered attributes live in [0,L] with normalized Euclidean proximity. The automatic proximity generation additionally assumes uniform semantic spacing of linguistic labels, a free modeling choice. No external benchmarks are used.

free parameters (2)
  • proximity threshold alpha = user-specified, not fitted
    Chosen by the user per query; determines interval width m=(1-alpha)L. It is an input parameter, not estimated from data.
  • uniform numeric mapping for linguistic domains = VL=0, L=1, A=2, S=3, VS=4 in Example 4.2
    Assigned by hand to ordered linguistic terms; assumes equal semantic spacing, which is not derived and affects the resulting proximity relation.
assumptions (4)
  • domain assumption Domains considered are subsets of [0,L] with the linear order and distance-based proximity p(a,b)=1-|b-a|/L.
    Chapter 4 assumes I=[0,L] and uses this proximity function.
  • domain assumption For two-dimensional domains, Euclidean distance normalized by sqrt(2)L defines proximity.
    Chapter 5 defines p(M1,M2)=1-d(M1,M2)/(sqrt(2)L); assumes Euclidean metric is appropriate.
  • ad hoc to paper Linguistic terms can be mapped to equally spaced integers preserving their proximity semantics.
    Example 4.2 assigns VL=0,...,VS=4 and Bk=0,...,Bc=6 without justification of uniform spacing.
  • standard math Standard floor function and interval arithmetic facts.
    Used in the proof of coverage of the interval by subintervals in Chapter 4.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Proximity-based equivalence classes in fuzzy relational database model." pith.science (2026). https://pith.science/paper/2OJSSSZ3

@misc{pith2026190809333,
  author       = {Pith},
  title        = {Pith review of: Proximity-based equivalence classes in fuzzy relational database model},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2OJSSSZ3}},
  note         = {Machine review of arXiv:1908.09333}
}
read the original abstract

One of the first attempts to set a solid theoretical foundation for extending the content of relational databases with incomplete information was the fuzzy relational model by Buckles and Petry. This structure was based on two generalizations of the traditional relational model: (1) A tuple component can be any subset of the corresponding domain, rather than a single element and (2) A similarity relation is defined on each domain. This relation satisfies the properties of reflexivity, symmetry and max-min transitivity, thus having the equality relation as a special case. This generalization keeps two key properties of the relational model - that no two different tuples represent the same information and that the application of any operation of the relation algebra has a unique result. Shenoi and Melton generalized this model and showed how the existence of equivalence classes over the attribute domains can also be preserved with a relation that only satisfies the properties of reflexivity and symmetry (proximity relation). The motivation for this generalization is the strictness of the max-min transitivity property of similarity relations, which complicates the construction of this relation for some domain types. An important characteristic of the Shenoi-Melton model is the dependence of the equivalence classes upon the current content of the database. This characteristic, together with the way the equivalence relation is constructed by the proximity relation, can lead to the equivalence classes that don't correspond well with some database query types. Here we will present a different way of forming the equivalence classes over the attribute domains in fuzzy relational databases in which they depend only on the attribute domain and not on the current database state. We will also show a simple method for automatic construction of proximity relations over some domain types.

Figures

Figures reproduced from arXiv: 1908.09333 by the authors.

Figure 1
Figure 1. City locations 17 [PITH_FULL_IMAGE:figures/full_fig_p017_1.png] view at source ↗
Figure 2
Figure 2. Equivalence classes for α = 0.8 I5 = [80, 100]. The other classes are I1 = [0, 20), I2 = [20, 40), I3 = [40, 60) and I4 = [60, 80) The square K = [0, 100]×[0, 100] is partitioned into 25 squares with the size of the length 20. K11 = I1 × I1 = [0, 20) × [0, 20), K12 = [0, 20) × [20, 40), . . . , Kij = [20(i − 1), 20i] × [20(j − 1), 20j].... The cities in the database belong to the following equivalence classes: Shire… view at source ↗
Figure 3
Figure 3. Equivalence classes for α = 0.6 K11, Isengard, Moria ∈ K22, Gondor, Rohan ∈ K21, Lotlorien ∈ K32, Mordor ∈ K33 (figure 3). 6 Application The database contains a table with names, statuses and cities of several suppliers (table 13). When defining the proximity functions for attribute domains, one should also pay attention to the role the attribute plays in a query. The attribute SNAME in this case is the primary key … view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Region map 23 [PITH_FULL_IMAGE:figures/full_fig_p023_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

  1. [1]

    Buckles and Frederick E

    Billy P. Buckles and Frederick E. Petry, A fuzzy represen tation of data for relational databases, Fuzzy Sets and Systems 7 (1982), 213–226

    work page 1982

  2. [2]

    E. F. Codd, A relational model of data for large shared dat a banks, CACM 13 (1970), 377–387

    work page 1970

  3. [3]

    C. J. Date, An Introduction to Database Systems , Sixth Edition, Addison- Wesley, 1994

    work page 1994

  4. [4]

    Thomas Koshy, Elementary Number Theory with Applications , Second Edi- tion, Academic Press, 2007

    work page 2007

  5. [5]

    David Maier, The Theory of Relational Databases , Computer Science Press, Inc., 1983

    work page 1983

  6. [6]

    Petry, Fuzzy Databases: Principles and Applications , Boston: Kluwer Academic Publishers, 1996

    Frederick E. Petry, Fuzzy Databases: Principles and Applications , Boston: Kluwer Academic Publishers, 1996

    work page 1996

  7. [7]

    Sujeet Shenoi and Austin Melton, Proximity relations in the fuzzy relational database model, Fuzzy Sets and Systems 31 (1989), 285–296

    work page 1989

  8. [8]

    Sujeet Shenoi, Austin Melton and L. T. Fan, An equivalenc e classes model of fuzzy relational databases, Fuzzy Sets and Systems 38 (1990), 153–170

    work page 1990

Show all 10 references
  1. [9]

    Zadeh, Similarity relations and fuzzy orderings , Information Sci- ences 3 (1971), 177–200

    Lotfi A. Zadeh, Similarity relations and fuzzy orderings , Information Sci- ences 3 (1971), 177–200

    1971

  2. [10]

    Carlo Zaniolo, Database relations with null values, Journal of Computer and System Sciences 28 (1984), 142–166 28

    1984

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.