Sciweavers

2889 search results - page 336 / 578
» Querying Structured Hyperdocuments
Sort
View
196
Voted
JODL
2000
123views more  JODL 2000»
15 years 6 months ago
On Z39.50 wrapping and description logics
Z39.50 is a client/server protocol widely used in digital libraries and museums for searching and retrieving information spread over a number of heterogeneous sources. To overcome ...
Yannis Velegrakis, Vassilis Christophides, Panos C...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 6 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 6 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
EDBT
2010
ACM
208views Database» more  EDBT 2010»
16 years 1 months ago
Stream schema: providing and exploiting static metadata for data stream processing
Schemas, and more generally metadata specifying structural and semantic constraints, are invaluable in data management. They facilitate conceptual design and enable checking of da...
Peter M. Fischer, Kyumars Sheykh Esmaili, Ren&eacu...