109 search results - page 11 / 22 » Example-driven design of efficient record matching queries |
126
click to vote
CPM
1998
Springer
15 years 2 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
100
click to vote
CIKM
1993
Springer
15 years 2 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
SIGMOD
1996
ACM
15 years 2 months ago
1996
ACM
The constructionof high-performance databasesystems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectur...
192
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
ER
2004
Springer
15 years 1 months ago
2004
Springer
The semantic web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. Ontologies, a cornerstone of the semantic web,...