Having a question about SQL

Consider the relations: EMPLOYEE(ID, SURNAME, LINE_ID) CAR(EID, MAKE) For each employee, we store their unique ID and the ID of their line manager (if exists) LINE_ID. If an employee has a line manager then the corresponding LINE_ID is not NULL. A line manager does not have a line manager, i.e., the corresponding LINE_ID is NULL. The LINE_ID is a foreign key referencing to the ID primary key in the relation Employee. In the relation Car, we store the car(s) make of an employee, if exist(s). Specifically, for each car, we store its make (e.g., BMW, Jaguar, Aston Martin, Toyota) and the ID of its owner/employee (EID). The EID is a foreign key referencing to the ID in the relation Employee. The primary keys are underlined. Assume the following query: SELECT E.SURNAME, L.SURNAME FROM EMPLOYEE E, EMPLOYEE L, CAR C WHERE E.LINE_ID = L.ID AND C.EID = L.ID We know that: (i) there are 20 line managers, each one being the line manager of 10 employees; (ii) there are 120 employees, who have 1 car each, i.e., the CAR relation has 120 tuples, each one corresponds to different employee. (a) Provide the canonical tree of the query and estimate the expected number of tuples retrieved.

Google Sitemap XML isn’t showing About Page, Contact Page, Etc, only

My google sitemap has been uploaded to Google Search Console using mywebsite.com/sitemap_index.xml When I click to the page in google search console ‘sitemaps read:’ I can only see the following:

The actual pages my site consists of are: website.com/about

Should the about/work/services pages be listed in Google Search Console when I click into the sitemap_index.xml file? Or have I done the xml file incorrectly?

I am using a Child Theme on Elementor on WordPress. The only thing in my robots.txt file is the following
User-agent: *
Disallow: /wp-admin/
Allow: /wp-admin/admin-ajax.php
I do have a devoted page website.com/sitemap with all my pages listed out

[![my active sitemap on Google Search Console][1]][1] [1]: https://i.stack.imgur.com/Vnaju.jpg

I am counfused about when Oracle database won’t do parsing

I am confused about when Oracle database won’t do parsing? In the AWR report, there is a metrics called "execute to parse", which means more SQL just execute without parsing when it increases. But as the Oracle document describe: "When an application issues a SQL statement, the application makes a parse call to the database to prepare the statement for execution. " It seems that everytime a SQL statement is issued, parsing will be called. So I wandering when Oracle won’t do parsing and make the "execute to parse" become a larger number? Or I just misunderstood?

What Oracle document said is:

SQL Parsing The first stage of SQL processing is parsing. The parsing stage involves separating the pieces of a SQL statement into a data structure that other routines can process. The database parses a statement when instructed by the application, which means that only the applicationĀ­, and not the database itself, can reduce the number of parses. When an application issues a SQL statement, the application makes a parse call to the database to prepare the statement for execution.


So if "an application issues a SQL statement, the application makes a parse call", then how applications "can reduce the number of parses"?

Can a spellcaster anticipate that the duration of a spell he’s concentrating on is about to end?

For example, when a wizard casts invisibility, that target is invisible until they attack or after the duration of an one hour. Say a player wants to explore for 59 minutes, then duck into an alley as the duration expires. It would be a challenge for anyone to anticipate, by the second or even by the minute, when a 60 minute interval is going to end. Or maybe they would feel the spell waning?

This is similar to Does a spellcaster know when concentration ends?, but it’s a different question.

How do I deal with a fellow player who cheats, if the GM won’t do anything about it?

I have played with this same group of friends for over 20 years. However due to covid we have had to play virtually using roll 20.
This has had the surprising and revealing effect of letting us see that one of the player cheats a lot. The other players, and the GM don’t seem to care, and if I publicly call him out on his shenanigan’s (in a very polite and non-accusing way), he just does it anyway and no one seems to care.

I have tried to roll with it and just ignore it, but it just feels so disrespectful to me, I think I may have to quit the group.

Does anyone have any suggestions?

Can “Corporation” structured data on pages about other companies get rich snippets for my site?

On my website I have a list of several hundred companies. And after you click any of them, you are navigating to the page, where you are able to see their details. For SEO on each company page, can I use "Corporation" schema markup to get a rich result for the company?

For the example, I have a few words about Google Inc on my page, so can I use some simple markup?

{   "@context": "https://schema.org",   "@type": "Corporation",   "name": "Google Inc",   "address": "some address",   "description": "A few words about Google inc." } 

Or maybe the rich snippet is reserved only for Google’s own website? Am I going to get some penalties for this? Or it will help me with SEO?

When you find a trap, what do you know about it?

All I could find about this subject is in Detecting a Hazard:

When characters approach a hazard, they have a chance of finding the trigger area or mechanism before triggering the hazard.

Anyone who succeeds becomes aware of the hazard, and you can describe what they notice.

But what does this mean? Do you only know that there’s a trap, or the trigger of one, in that square? Do you know the whole trap statblock? Something else?

About Fermat’s Integer Factoring algorithm

An implementation of Fermat’s algorithm that is a slight improvement on code in this book is here.

FermatFactor[n_?OddQ]:=Module[{s=Floor@Sqrt[n+0``1],r,u,v=1},   If[s^2==n,Return@{s,s}];   {r,u}={(s+1)^2-n,2*s+3};   While[r!=0,     While[r>0,       r-=v;v+=2     ];     If[r<0,r+=u;u+=2]   ];   (u+{-v,v-2})/2 ] 

The main improvement above is the fast implementation of Floor[Sqrt[n]] from MichaelE2. The above implementation will factor the following in less than 0.1 seconds!

SeedRandom[100]; p=10^50; n=NextPrime@RandomInteger[{p-80000,p-60000}]*NextPrime@RandomInteger[{p+80000,p+60000}]; FermatFactor[n] (*{99999999999999999999999999999999999999999999920467,100000000000000000000000000000000000000000000075667}*) 

I have Mathematica Version 12.0.0 and FactorInteger[n] takes a very long time on that example. Can FactorInteger in Mathematica 12.2 do it in a reasonable amount of time?