Sciweavers

387 search results - page 39 / 78
» Reasoning About Approximate Match Query Results
Sort
View
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 10 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
ASC
2006
13 years 10 months ago
A WAM implementation for flexible query answering
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similar...
Pascual Julián Iranzo, Clemente Rubio-Manza...
GIS
2005
ACM
14 years 9 months ago
Shapes based trajectory queries for moving objects
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
Bin Lin, Jianwen Su
WWW
2010
ACM
14 years 2 months ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...
ECCV
2002
Springer
14 years 10 months ago
Shock-Based Indexing into Large Shape Databases
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
Thomas B. Sebastian, Philip N. Klein, Benjamin B. ...