Sciweavers

3969 search results - page 364 / 794
» Query Processing Using Ontologies
Sort
View
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
16 years 6 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...
EOR
2006
117views more  EOR 2006»
15 years 4 months ago
Heuristics for selecting robust database structures with dynamic query patterns
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-ma...
Andrew N. K. Chen, Paulo B. Goes, Alok Gupta, Jame...
IPL
2007
101views more  IPL 2007»
15 years 4 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 4 months ago
Improving Term Extraction Using Particle Swarm Optimization Techniques
: Problem statement: Term extraction is one of the layers in the ontology development process which has the task to extract all the terms contained in the input document automatica...
Mohammad Syafrullah, Naomie Salim
WWW
2009
ACM
15 years 11 months ago
Rapid prototyping of semantic mash-ups through semantic web pipes
The use of RDF data published on the Web for applications is still a cumbersome and resource-intensive task due to the limited software support and the lack of standard programmin...
Danh Le Phuoc, Axel Polleres, Manfred Hauswirth, G...