Sciweavers

1117 search results - page 78 / 224
» Querying structured data in an unstructured P2P system
Sort
View
WWW
2010
ACM
15 years 4 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 ...
ESWS
2008
Springer
15 years 1 months ago
Exploring the Knowledge in Semi Structured Data Sets with Rich Queries
Semantics can be integrated in to search processing during both document analysis and querying stages. We describe a system that incorporates both, semantic annotations of Wikipedi...
Jürgen Umbrich, Sebastian Blohm
IADIS
2009
14 years 9 months ago
Relational databases versus information retrieval systems: A case study
In this paper we present our evaluations of using an Information Retrieval library in a commercial employment website with over 300,000 searches a day. Comparison of existing rela...
Ozgur Yilmazel, Burcu Yurekli, Baris Yilmazel, Ahm...
APWEB
2007
Springer
15 years 3 months ago
DBMSs with Native XML Support: Towards Faster, Richer, and Smarter Data Management
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...
Min Wang
COCOON
1998
Springer
15 years 3 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...