Sciweavers

2889 search results - page 356 / 578
» Querying Structured Hyperdocuments
Sort
View
165
Voted
CIKM
2005
Springer
16 years 4 days ago
On reducing redundancy and improving efficiency of XML labeling schemes
The basic relationships to be determined in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering relationships. The containment labeling sc...
Changqing Li, Tok Wang Ling, Jiaheng Lu, Tian Yu
DAWAK
2005
Springer
16 years 4 days ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
WEBDB
2005
Springer
102views Database» more  WEBDB 2005»
16 years 2 days ago
Design and Implementation of a Geographic Search Engine
In this paper, we describe the design and initial implementation of a geographic search engine prototype for Germany, based on a large crawl of the de domain. Geographic search en...
Alexander Markowetz, Yen-Yu Chen, Torsten Suel, Xi...
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
16 years 2 days ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho
CINQ
2004
Springer
163views Database» more  CINQ 2004»
16 years 9 hour ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau