Sciweavers

6650 search results - page 396 / 1330
» Mutating database queries
Sort
View
ISEMANTICS
2010
15 years 4 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 9 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
ICDE
2005
IEEE
147views Database» more  ICDE 2005»
15 years 11 months ago
Privacy-Preserving Top-K Queries
Processing of top-k queries has been attracting considerable attention. Much of the work assumes distributed data, with each site holding a different set of attributes for the sam...
Jaideep Vaidya, Chris Clifton
ADBIS
2003
Springer
108views Database» more  ADBIS 2003»
15 years 10 months ago
Evaluation of Common Counting Method for Concurrent Data Mining Queries
Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we ...
Marek Wojciechowski, Maciej Zakrzewicz
DASFAA
1995
IEEE
118views Database» more  DASFAA 1995»
15 years 9 months ago
Combining Indexing Technique with Path Dictionary for Nested Object Queries
A path dictionary encodes the connections among objects in the aggregation hierarchy. It has been shown to be an efficient mechanism for supporting nested object queries [6]. In t...
Wang-Chien Lee, Dik Lun Lee