Sciweavers

228 search results - page 3 / 46
» Relational queries over interpreted structures
Sort
View
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 7 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
ICDE
2005
IEEE
134views Database» more  ICDE 2005»
13 years 12 months ago
Index Structures for Matching XML Twigs Using Relational Query Processors
Various index structures have been proposed to speed up the evaluation of XML path expressions. However, existing XML path indices suffer from at least one of three limitations: ...
Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Kou...
TABLEAUX
2007
Springer
14 years 10 days ago
Tableau Systems for Logics of Subinterval Structures over Dense Orderings
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
PODS
2010
ACM
213views Database» more  PODS 2010»
13 years 11 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
JCSS
2008
73views more  JCSS 2008»
13 years 6 months ago
Structure identification of Boolean relations and plain bases for co-clones
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanutti...