Sciweavers

642 search results - page 26 / 129
» Least-Squares Structuring, Clustering and Data Processing Is...
Sort
View
DKE
1998
88views more  DKE 1998»
13 years 8 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 10 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
MONET
2007
110views more  MONET 2007»
13 years 8 months ago
Multi-hop Clustering Based on Neighborhood Benchmark in Mobile Ad-hoc Networks
— Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a scheme is present...
Stephen S. Yau, Wei Gao
PKDD
2007
Springer
102views Data Mining» more  PKDD 2007»
14 years 2 months ago
Towards Data Mining Without Information on Knowledge Structure
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
Alexandre Vautier, Marie-Odile Cordier, Rene Quini...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 8 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin