Sciweavers

431 search results - page 34 / 87
» KPYR: An Efficient Indexing Method
Sort
View
EKAW
2008
Springer
13 years 11 months ago
Ontological Profiles in Enterprise Search
Ontology-driven search applications use ontological concepts either to index documents or to guide and understand the users. Since ontologies by nature are domain-dependent and app...
Geir Solskinnsbakk, Jon Atle Gulla
ISI
2008
Springer
13 years 9 months ago
Improving quality and performance of schema matching in large scale
ABSTRACT. Schema matching is a crucial task to gather information of the same domain. However, this process is still largely performed manually or semi-automatically, discouraging ...
Fabien Duchateau, Zohra Bellahsene, Mathieu Roche
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 11 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
CIKM
2004
Springer
14 years 3 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
14 years 2 months ago
Acceleration of Relational Index Structures Based on Statistics
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 existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...