Sciweavers

1335 search results - page 169 / 267
» Privacy in Database Publishing
Sort
View
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
15 years 10 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
VLDB
1995
ACM
181views Database» more  VLDB 1995»
15 years 8 months ago
NeuroRule: A Connectionist Approach to Data Mining
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
Hongjun Lu, Rudy Setiono, Huan Liu
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 4 months ago
Detecting Ontological Conflicts in Protocols between Semantic Web Services
Abstract. The task of verifying the compatibility between interacting web services has traditionally been limited to checking the compatibility of the interaction protocol in terms...
Priyankar Ghosh, Pallab Dasgupta
PVLDB
2008
100views more  PVLDB 2008»
15 years 4 months ago
Scalable query result caching for web applications
The backend database system is often the performance bottleneck when running web applications. A common approach to scale the database component is query result caching, but it fa...
Charles Garrod, Amit Manjhi, Anastasia Ailamaki, B...
TODS
2010
108views more  TODS 2010»
15 years 2 months ago
A survey of B-tree locking techniques
: © A survey of B-tree locking techniques Goetz Graefe HP Laboratories HPL-2010-9 storage systems, databases, B-tree, indexes, concurrency control, locking B-trees have been ubiqu...
Goetz Graefe