Sciweavers

448 search results - page 46 / 90
» Queries and Constraints on Semi-structured Data
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
14 years 11 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
KRDB
1996
123views Database» more  KRDB 1996»
14 years 11 months ago
Flexible Query-Answering Systems Modelled in Metalogic Programming
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
Troels Andreasen, Henning Christiansen
DKE
2007
101views more  DKE 2007»
14 years 9 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
PODS
2012
ACM
253views Database» more  PODS 2012»
13 years 4 days ago
Local transformations and conjunctive-query equivalence
Over the past several decades, the study of conjunctive queries has occupied a central place in the theory and practice of database systems. In recent years, conjunctive queries h...
Ronald Fagin, Phokion G. Kolaitis
VLDB
2004
ACM
128views Database» more  VLDB 2004»
15 years 10 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...