Sciweavers

387 search results - page 21 / 78
» Reasoning About Approximate Match Query Results
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 12 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
CIKM
1997
Springer
15 years 4 months ago
Block Addressing Indices for Approximate Text Retrieval
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
Ricardo A. Baeza-Yates, Gonzalo Navarro
86
Voted
CVPR
2007
IEEE
16 years 1 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 2 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
EDBTW
2006
Springer
15 years 3 months ago
Towards Similarity-Based Topological Query Languages
Abstract. In recent times, the proliferation of spatial data on the Internet is beginning to allow a much larger audience to access and share data currently available in various Ge...
Alberto Belussi, Omar Boucelma, Barbara Catania, Y...