Sciweavers

2099 search results - page 208 / 420
» Similarity for Conceptual Querying
Sort
View
112
Voted
AI
2010
Springer
15 years 1 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
BMCBI
2006
147views more  BMCBI 2006»
15 years 1 months ago
QPath: a method for querying pathways in a protein-protein interaction network
Background: Sequence comparison is one of the most prominent tools in biological research, and is instrumental in studying gene function and evolution. The rapid development of hi...
Tomer Shlomi, Daniel Segal, Eytan Ruppin, Roded Sh...
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 8 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
OTM
2009
Springer
15 years 8 months ago
The Constellation Query Language
Collaboration in modeling is essential to success, but ORM diagrams intimidate many business people, and most would never install an ORM modeling tool on their computers. The Const...
Clifford Heath
CIKM
2007
Springer
15 years 8 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu