Sciweavers

792 search results - page 121 / 159
» Computing Iceberg Queries Efficiently
Sort
View
DEXA
2010
Springer
180views Database» more  DEXA 2010»
13 years 11 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 12 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
14 years 11 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...
SIGMOD
2004
ACM
120views Database» more  SIGMOD 2004»
14 years 10 months ago
Prediction and Indexing of Moving Objects with Unknown Motion Patterns
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...
Yufei Tao, Christos Faloutsos, Dimitris Papadias, ...
COLCOM
2007
IEEE
14 years 4 months ago
Message replication in unstructured peer-to-peer network
—Recently, unstructured peer-to-peer (P2P) applications have become extremely popular. Searching in these networks has been a hot research topic. Flooding-based searching, which ...
Osama Al-Haj Hassan, Lakshmish Ramaswamy