Sciweavers

243 search results - page 37 / 49
» A Privacy-Preserving Index for Range Queries
Sort
View
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 7 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 8 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
14 years 9 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
14 years 9 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...
ICDE
1998
IEEE
142views Database» more  ICDE 1998»
14 years 9 months ago
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
Nick Koudas, Kenneth C. Sevcik