Filters








720,524 Hits in 2.0 sec

Similarity-based queries

H. V. Jagadish, Alberto O. Mendelzon, Tova Milo
1995 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '95  
Our framework has three components: a pattern language, a transformation rule language, and a query language.  ...  The pattern language specifies classes of objects, the transformation rule language defines similarity by specifying the similarity-preserving transformations, and the whole package is wrapped in a  ...  The basic pattern language weuseis regular expressions, and the query language is calculus-based.  ... 
doi:10.1145/212433.212444 dblp:conf/pods/JagadishMM95 fatcat:ne6mfql22raczoum3m7av5uaxu

Context-Based Image Similarity Queries [chapter]

Ilaria Bartolini
2006 Lecture Notes in Computer Science  
In this paper an effective context-based approach for interactive similarity queries is presented.  ...  By exploiting the notion of image "context", it is possible to associate different meanings to the same query image.  ...  similarity queries.  ... 
doi:10.1007/11670834_18 fatcat:24uzxzbfcja4zey3lfoipsrzaq

Similarity-based relaxed instance queries

Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan
2015 Journal of Applied Logic  
Similarity measures can offer a controlled way of gradually relaxing a query concept within a user-specified limit.  ...  In this paper we formalize the task of instance query answering for DL KBs using concepts relaxed by concept similarity measures (CSMs).  ...  Concept similarity measures are widely used in ontology-based applications.  ... 
doi:10.1016/j.jal.2015.01.002 fatcat:nuog53hacrck3mgw422rgg6qwq

Query systems in similarity-based databases

Radim Belohlavek, Vilem Vychodil
2010 Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10  
A major implication of the paper is that similarity-based data querying can be made an integral part of an extended, similarity-based, relational model of data which is based on first-order predicate logics  ...  In this paper, we outline the foundations and propose two query systems for similarity-based databases: a domain relational calculus (DRC) and a relational algebra (RA).  ...  similarity-based queries.  ... 
doi:10.1145/1774088.1774444 dblp:conf/sac/BelohlavekV10a fatcat:oojn6l5uizdcbmfsdgwikc25my

Towards Similarity-Based Topological Query Languages [chapter]

Alberto Belussi, Omar Boucelma, Barbara Catania, Yassine Lassoued, Paola Podestà
2006 Lecture Notes in Computer Science  
In order to make such predicates effectively usable, we discuss how GQuery, an XML-based spatial query language, can be extended to support similarity-based queries through the proposed operators.  ...  the query results.  ...  -M 3 : GQ 3 = GQuery s : a Similarity-Based Spatial Query Language Weak topological predicates can be used to extend existing spatial query languages, in order to directly support similarity-based computations  ... 
doi:10.1007/11896548_51 fatcat:io47gzrwsrgn5bzgic4pvwuwzm

Surface similarity-based molecular query-retrieval

Rahul Singh
2007 BMC Cell Biology  
Therefore molecular similarity is a key notion in investigations targeting exploration of molecular structural space, query-retrieval in molecular databases, and structure-activity modelling.  ...  Surface-based molecular similarity is subsequently determined by computing the similarity of the surface-property distributions using a novel formulation of histogram-intersection.  ...  query, where molecules are retrieved in terms of their overall similarity, as defined using appropriate similarity functions, to the query molecule.  ... 
doi:10.1186/1471-2121-8-s1-s6 pmid:17634096 pmcid:PMC1924511 fatcat:pu2e3hj7ijfkrjr7w5ja6tqwna

Finding Similar Queries to Satisfy Searches Based on Query Traces [chapter]

Osmar R. Zaïane, Alexander Strilets
2002 Lecture Notes in Computer Science  
The approach is based on the notion of quasi-similarity between queries since full similarity with an unsatisfactory query would lead to disappointment.  ...  We present a model for search engine queries and a variety of quasi-similarity measures to retrieve relevant queries.  ...  If the user is unsatisfied with the results a recommendation for similar queries is requested and similar queries are displayed based on the similarity measure chosen.  ... 
doi:10.1007/3-540-46105-1_24 fatcat:w27gwag64jg3bls3rddr5lwbqy

Querying time series data based on similarity

D. Rafiei, A.O. Mendelzon
2000 IEEE Transactions on Knowledge and Data Engineering  
We present a query processing algorithm that uses the underlying multidimensional index built over the data set to efficiently answer similarity queries.  ...  AbstractÐWe study similarity queries for time series data where similarity is defined, in a fairly general way, in terms of a distance function and a set of affine transformations on the Fourier series  ...  RAFIEI AND MENDELZON : QUERYING TIME SERIES DATA BASED ON SIMILARITY . This can be verified by taking the first derivatives of D w.r.t. s x and s y and equating them to zero.3. & Y  ... 
doi:10.1109/69.877502 fatcat:e4zpfbmvzvh2vmusxwnezaoc4a

Similarity-based queries for time series data

Davood Rafiei, Alberto Mendelzon
1997 Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97  
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence.  ...  In this paper, we present a new algorithm for processing queries that define similarity in terms of multiple transformations instead of a single one.  ...  We are often interested in similarity queries on time-series data [3, 2] .  ... 
doi:10.1145/253260.253264 dblp:conf/sigmod/RafieiM97 fatcat:i5n7i3xaerhmdegpxtyrmfdkxa

Similarity-Based Queries for Time Series Data

Davood Rafiei, Alberto Mendelzon
1998 arXiv   pre-print
We relate our transformations to the general framework for similarity queries of Jagadish et al.  ...  We present a query processing algorithm that uses the underlying R-tree index of a multidimensional data set to answer similarity queries efficiently.  ...  In the next section, we discuss an indexing technique for similarity queries. Indexing of Similarity Queries In this section we describe a fast query processing method for similarity queries.  ... 
arXiv:cs/9809023v2 fatcat:yom7hofqhjhopmypjl3qt2ftoe

Similarity-based queries for time series data

Davood Rafiei, Alberto Mendelzon
1997 SIGMOD record  
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence.  ...  In this paper, we present a new algorithm for processing queries that define similarity in terms of multiple transformations instead of a single one.  ...  We are often interested in similarity queries on time-series data [3, 2] .  ... 
doi:10.1145/253262.253264 fatcat:iwj4gfzvf5ggviom237f26fwb4

Query-based Attention CNN for Text Similarity Map [article]

Tzu-Chien Liu, Yu-Hsueh Wu, Hung-Yi Lee
2017 arXiv   pre-print
In this paper, we introduce Query-based Attention CNN(QACNN) for Text Similarity Map, an end-to-end neural network for question answering.  ...  First, the compare mechanism compares between the given passage, query, and multiple answer choices to build similarity maps.  ...  Based on first stage query-based sentence features from section 2.2.2, we want to acquire sentencelevel attention map.  ... 
arXiv:1709.05036v2 fatcat:etngc2ty75fa3dymksee7umauy

A Similarity-Based Unification Model for Flexible Querying [chapter]

S. Krajči, R. Lencses, J. Medina, M. Ojeda-Aciego, P. Vojtáš
2002 Lecture Notes in Computer Science  
We use the formal model for similarity-based fuzzy unification in multi-adjoint logic programs to provide new tools for flexible querying.  ...  Our approach is based on a general framework for logic programming, which gives a formal model of fuzzy logic programming extended by fuzzy similarities and axioms of first-order logic with equality.  ...  Later, a formal model for similarity-based fuzzy unification is presented by using the multi-adjoint logic programming paradigm to provide new tools for flexible querying.  ... 
doi:10.1007/3-540-36109-x_21 fatcat:sct7j7s3qnh4nd53747idnlcea

Expressing and Optimizing Similarity-Based Queries in SQL [chapter]

Like Gao, Min Wang, X. Sean Wang, Sriram Padmanabhan
2004 Lecture Notes in Computer Science  
The use of the NN-UDP makes the queries involving similarity searches intuitive to express.  ...  Searching for similar objects (in terms of near and nearest neighbors) of a given query object from a large set is an essential task in many applications.  ...  Conclusion In this paper, we introduced a user-defined predicate (UDP) for expressing queries involving similarity searches.  ... 
doi:10.1007/978-3-540-30464-7_36 fatcat:cbnglc4gqnckja757ca7cbb77a

Optimizing complex queries based on similarities of subqueries

Qiang Zhu, Yingying Tao, Calisto Zuzarte
2005 Knowledge and Information Systems  
Different levels of similarity for subqueries are introduced. Efficient algorithms to identify similar queries in a given query and optimize the query based on similarity are presented.  ...  To tackle this challenge, we present a new similarity-based approach to optimizing complex queries in this paper.  ...  Based on the above observation, we introduce a new similarity-based approach to reducing optimization time for a complex query by exploiting its similar subqueries (the similarity is defined by some error  ... 
doi:10.1007/s10115-004-0189-y fatcat:us4ziwhbfzby3jz7xwbplkvhcu
« Previous Showing results 1 — 15 out of 720,524 results