Sciweavers

381 search results - page 35 / 77
» Approximate Matching of Hierarchical Data Using pq-Grams
Sort
View
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 7 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 7 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 7 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
BMVC
2010
13 years 5 months ago
Real-time Action Recognition by Spatiotemporal Semantic and Structural Forests
Whereas most existing action recognition methods require computationally demanding feature extraction and/or classification, this paper presents a novel real-time solution that ut...
Tsz-Ho Yu, Tae-Kyun Kim, Roberto Cipolla
VLDB
2007
ACM
159views Database» more  VLDB 2007»
14 years 7 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...