Sciweavers

7576 search results - page 274 / 1516
» On Querying Ontologies and Databases
Sort
View
SIGIR
2009
ACM
16 years 1 months ago
What queries are likely to recur in web search?
We study the recurrence dynamics of queries in Web search by analysing a large real-world query log dataset. We find that query frequency is more useful in predicting collective ...
Dell Zhang, Jinsong Lu
SSD
2001
Springer
119views Database» more  SSD 2001»
15 years 11 months ago
Constrained Nearest Neighbor Queries
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as neare...
Hakan Ferhatosmanoglu, Ioana Stanoi, Divyakant Agr...
DEXAW
1999
IEEE
111views Database» more  DEXAW 1999»
15 years 11 months ago
A Parallel Algebra for Object Databases
This paper describes an algebra for use with parallel object databases, and in particular ODMG compliant databases with OQL. Although there have been many proposals for parallel r...
Sandra de F. Mendes Sampaio, Norman W. Paton, Paul...
WWW
2008
ACM
16 years 7 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
16 years 8 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh