Sciweavers

1429 search results - page 24 / 286
» Efficient processing of XPath queries using indexes
Sort
View
DAWAK
1999
Springer
15 years 1 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
94
Voted
SPIRE
2001
Springer
15 years 2 months ago
Distributed Query Processing Using Partitioned Inverted Files
In this paper, we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that offers concurrent query service. The di...
Claudine Santos Badue, Ricardo A. Baeza-Yates, Ber...
WWW
2007
ACM
15 years 10 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
ECIR
2006
Springer
14 years 11 months ago
Efficient Phrase Querying with Common Phrase Index
Abstract. In this paper, we propose a common phrase index as an efficient index structure to support phrase queries in a very large text database. Our structure is an extension of ...
Matthew Chang, Chung Keung Poon
88
Voted
WIDM
2003
ACM
15 years 2 months ago
XPath query transformation based on XSLT stylesheets
Whenever XML data must be shared by heterogeneous applications, transformations between different applicationspecific XML formats are necessary. The state-of-the-art method transf...
Sven Groppe, Stefan Böttcher