Sciweavers

2859 search results - page 177 / 572
» Querying Complex Structured Databases
Sort
View
GEOINFO
2003
13 years 9 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
WWW
2010
ACM
14 years 1 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 ...
DEXA
2009
Springer
222views Database» more  DEXA 2009»
14 years 2 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos
ICAIL
1999
ACM
14 years 20 days ago
Generating exception structures for legal information serving
More and more legal information is available in electronic form, but traditional retrieval mechanisms are insufficient to answer questions and legal problems of most users. In the...
Radboud Winkels, D. J. B. Bosscher, A. W. F. Boer,...
DEXAW
1999
IEEE
119views Database» more  DEXAW 1999»
14 years 20 days ago
Structure-Based Similarity Search with Graph Histograms
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
Apostolos Papadopoulos, Yannis Manolopoulos