Sciweavers

467 search results - page 57 / 94
» Processing top k queries from samples
Sort
View
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
14 years 1 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
EL
2008
166views more  EL 2008»
13 years 9 months ago
The digital library as an enterprise: the Zachman approach
Purpose: Examines the needs of digital library stakeholders and how a collaborative digital library might be designed to meet these needs. The collaborative digital library has be...
Abdullah Abrizah, A. N. Zainab
ICASSP
2008
IEEE
14 years 3 months ago
A pattern classification framework for theoretical analysis of component forensics
Component forensics is an emerging methodology for forensic analysis that aims at estimating the algorithms and parameters in each component of a digital device. This paper propos...
Ashwin Swaminathan, Min Wu, K. J. Ray Liu
PPDP
2010
Springer
13 years 7 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
CIKM
2006
Springer
14 years 26 days ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...