Sciweavers

707 search results - page 36 / 142
» Processing queries on tree-structured data efficiently
Sort
View
ICGI
2010
Springer
13 years 9 months ago
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
Ryo Yoshinaka
VLDB
1995
ACM
97views Database» more  VLDB 1995»
14 years 5 days ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 10 months ago
SQL Queries Over Unstructured Text Databases
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...
Alpa Jain, AnHai Doan, Luis Gravano
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
14 years 8 months ago
Angle-based space partitioning for efficient parallel skyline computation
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
ICDE
2008
IEEE
103views Database» more  ICDE 2008»
14 years 10 months ago
Processing Diagnosis Queries: A Principled and Scalable Approach
Abstract-- Many popular Web sites suffer occasional uservisible problems such as slow responses, blank pages or error messages being displayed, items not being added to shopping ca...
Shivnath Babu, Songyun Duan, Kamesh Munagala