228 search results - page 13 / 46 » Relational queries over interpreted structures |
261
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
145
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
123
click to vote
JIIS
2006
15 years 4 months ago
2006
For some years, data summarization techniques have been developed to handle the growth of databases. However these techniques are usually not provided with tools for enduserstoeffi...
144
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
150
click to vote
CP
1997
Springer
15 years 8 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...