Sciweavers

1413 search results - page 12 / 283
» Efficient Learning of Semi-structured Data from Queries
Sort
View
145
Voted
COCOON
1998
Springer
15 years 6 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
141
Voted
ESWA
2006
139views more  ESWA 2006»
15 years 1 months ago
An efficient data mining approach for discovering interesting knowledge from customer transactions
Mining association rules and mining sequential patterns both are to discover customer purchasing behaviors from a transaction database, such that the quality of business decision ...
Show-Jane Yen, Yue-Shi Lee
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
16 years 2 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
COOPIS
2004
IEEE
15 years 5 months ago
Learning Classifiers from Semantically Heterogeneous Data
Semantically heterogeneous and distributed data sources are quite common in several application domains such as bioinformatics and security informatics. In such a setting, each dat...
Doina Caragea, Jyotishman Pathak, Vasant Honavar
120
Voted
CIDR
2009
152views Algorithms» more  CIDR 2009»
15 years 2 months ago
Visualizing the robustness of query execution
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
Goetz Graefe, Harumi A. Kuno, Janet L. Wiener