Sciweavers

486 search results - page 84 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
15 years 7 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
ICDE
2010
IEEE
258views Database» more  ICDE 2010»
15 years 8 months ago
Anonymized Data: Generation, models, usage
Data anonymization techniques have been the subject of intense investigation in recent years, for many kinds of structured data, including tabular, item set and graph data. They e...
Graham Cormode, Divesh Srivastava
CIKM
2010
Springer
15 years 1 days ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
PVLDB
2010
120views more  PVLDB 2010»
14 years 12 months ago
EXTRUCT: Using Deep Structural Information in XML Keyword Search
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Previous work has shown that current XML keyword search methods, although in...
Arash Termehchy, Marianne Winslett
GIS
2006
ACM
16 years 2 months ago
Filtering with raster signatures
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...
Leonardo Guerreiro Azevedo, Ralf Hartmut Güti...