Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
(2) Consider the following fragment of a positional index with the format: word: document: ; document: < position, ...>.. Gates: 1: <3>; 2: <6>; 3: <2,17>; 4: <1>; IBM: 4: <3>; 7: <14>; Microsoft: 1: <1>; 2: <1,21>; 3: <3>; 5: <16,22,51>; The /k operator, word1 /k word2 finds occurrences of word1 within k words of word2 (on either side), where k is a positive integer argument. Thus k = 1 demands that word1 be adjacent to word2. Describe the set of documents that satisfy the query Gates /2 Microsoft. O {1, 2} ○ {1,3} ○ {2, 3} ○ {4, 5}

(2) Consider the following fragment of a positional index with the format: word: document: ; document: < position, ...>.. Gates: 1: <3>; 2: <6>; 3: <2,17>; 4: <1>; IBM: 4: <3>; 7: <14>; Microsoft: 1: <1>; 2: <1,21>; 3: <3>; 5: <16,22,51>; The /k operator, word1 /k word2 finds occurrences of word1 within k words of word2 (on either side), where k is a positive integer argument. Thus k = 1 demands that word1 be adjacent to word2. Describe the set of documents that satisfy the query Gates /2 Microsoft. O {1, 2} ○ {1,3} ○ {2, 3} ○ {4, 5}

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
(2) Consider the following fragment of a positional index with the format: word: document: <position, position, ...>; document: < position, ...>.. Gates: 1: <3>; 2: <6>; 3: <2,17>; 4: <1>; IBM: 4: <3>; 7: <14>; Microsoft: 1: <1>; 2: <1,21>; 3: <3>; 5: <16,22,51>; The /k operator, word1 /k word2 finds occurrences of word1 within k words of word2 (on either side), where k is a positive integer argument. Thus k = 1 demands that word1 be adjacent to word2. Describe the set of documents that satisfy the query Gates /2 Microsoft. O {1, 2} ○ {1,3} ○ {2, 3} ○ {4, 5}
Transcribed Image Text:(2) Consider the following fragment of a positional index with the format: word: document: <position, position, ...>; document: < position, ...>.. Gates: 1: <3>; 2: <6>; 3: <2,17>; 4: <1>; IBM: 4: <3>; 7: <14>; Microsoft: 1: <1>; 2: <1,21>; 3: <3>; 5: <16,22,51>; The /k operator, word1 /k word2 finds occurrences of word1 within k words of word2 (on either side), where k is a positive integer argument. Thus k = 1 demands that word1 be adjacent to word2. Describe the set of documents that satisfy the query Gates /2 Microsoft. O {1, 2} ○ {1,3} ○ {2, 3} ○ {4, 5}
Expert Solution
steps

Step by step

Solved in 1 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS