Sciweavers

591 search results - page 86 / 119
» The complexity of XPath query evaluation
Sort
View
SEM
2004
Springer
14 years 2 months ago
Integration of a Text Search Engine with a Java Messaging Service
Large-scale information processing applications must rapidly search through high volume streams of structured and unstructured textual data to locate useful information. Content-ba...
Justin Almquist, Ian Gorton, Jereme Haack
DEXA
2006
Springer
80views Database» more  DEXA 2006»
14 years 9 days ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
FQAS
2006
Springer
76views Database» more  FQAS 2006»
14 years 9 days ago
Why Using Structural Hints in XML Retrieval?
Abstract. When querying XML collections, users cannot always express their need in a precise way. Systems should therefore support vagueness at both the content and structural leve...
Karen Sauvagnat, Mohand Boughanem, Claude Chrismen...
VLDB
2000
ACM
248views Database» more  VLDB 2000»
14 years 5 days ago
Multi-Dimensional Database Allocation for Parallel Data Warehouses
Data allocation is a key performance factor for parallel database systems (PDBS). This holds especially for data warehousing environments where huge amounts of data and complex an...
Thomas Stöhr, Holger Märtens, Erhard Rah...
VLDB
1995
ACM
129views Database» more  VLDB 1995»
14 years 5 days ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...