6974 search results - page 1142 / 1395 » Querying Semi-Structured Data |
111
Voted
DAWAK
1999
Springer
15 years 5 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
117
click to vote
KDD
1998
ACM
15 years 5 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
103
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
SIGMOD
1997
ACM
15 years 5 months ago
1997
ACM
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
132
Voted
SIGMOD
1994
ACM
15 years 4 months ago
1994
ACM
In the mobile wireless computing environment of the future, a large number of users, equipped with low-powered palmtop machines, will query databases over wireless communication ch...