Sciweavers

3020 search results - page 42 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
PR
2006
101views more  PR 2006»
15 years 1 months ago
Feature-based approach to semi-supervised similarity learning
For the management of digital document collections, automatic database analysis still has ties to deal with semantic queries and abstract concepts that users are looking for. When...
Philippe Henri Gosselin, Matthieu Cord
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
16 years 1 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos
COCOON
1998
Springer
15 years 5 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
191
Voted
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 2 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
WIDM
2004
ACM
15 years 7 months ago
Querying structured data in an unstructured P2P system
Abstract— Peer-to-Peer networking has become a major research topic over the last few years. Sharing of structured data in such decentralized environments is a challenging proble...
Verena Kantere, Dimitrios Tsoumakos, Nick Roussopo...