Sciweavers

1429 search results - page 151 / 286
» Efficient processing of XPath queries using indexes
Sort
View
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 10 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 9 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 10 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
EKAW
2008
Springer
13 years 11 months ago
Ontological Profiles in Enterprise Search
Ontology-driven search applications use ontological concepts either to index documents or to guide and understand the users. Since ontologies by nature are domain-dependent and app...
Geir Solskinnsbakk, Jon Atle Gulla
ADBIS
1998
Springer
97views Database» more  ADBIS 1998»
14 years 1 months ago
Using Queries with Multi-Directional Functions for Numerical Database Applications
Object-oriented database management systems are often motivated by their support for new emerging application areas such as computer-aided design and analysis systems. The object-o...
Staffan Flodin, Kjell Orsborn, Tore Risch