Sciweavers

1148 search results - page 213 / 230
» Using a relational database for scalable XML search
Sort
View
EDBT
2008
ACM
128views Database» more  EDBT 2008»
14 years 7 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...
ELPUB
2006
ACM
14 years 1 months ago
Open Access in Sweden 2002-2005
The paper gives an overview of recent developments in Sweden concerning the communication and reception of the Open Access concept and the growth and co-ordination of digital acad...
Jan Hagerlid
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
13 years 11 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
AGENTS
1999
Springer
13 years 11 months ago
Personal Navigating Agents
The World Wide Web provides a huge distributed web database. However, information in the web database is free formatted and unorganized. Traditional keyword-based retrieval approa...
H. L. Wang, W. K. Shih, C. N. Hsu, Y. S. Chen, Y. ...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen