Sciweavers

2001 search results - page 60 / 401
» Indexing in a Hypertext Database
Sort
View
XSYM
2005
Springer
87views Database» more  XSYM 2005»
14 years 2 months ago
Relational Index Support for XPath Axes
In this paper, we designed efficient indexing structure for XML documents so that each basic XPath axis step is supported. The indexing structure is built on top of the B+ -tree wh...
Leo Yuen, Chung Keung Poon
GIS
2006
ACM
13 years 9 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 9 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
LAWEB
2005
IEEE
14 years 2 months ago
Optimized Index Structures for Querying RDF from the Web
Storing and querying Resource Description Framework (RDF) data is one of the basic tasks within any Semantic Web application. A number of storage systems provide assistance for th...
Andreas Harth, Stefan Decker
ADC
2004
Springer
88views Database» more  ADC 2004»
14 years 20 days ago
An Efficient Method for Indexing Now-relative Bitemporal data
Most modern database applications contain a significant amount of time dependent data and a substantial proportion of this data is now-relative, i.e. current now. While much resea...
Bela Stantic, Sankalp Khanna, John Thornton